مدل سازی ,و حل مسائل مکان‌یابی حداکثر پوشش‌دهی پویا با درنظر گرفتن خدمت پشتیبان ؛ مطالعه موردی رخداد بحران در منطقه سه تهران

نوع مقاله : پژوهشی

نویسندگان

1 رئیس دانشکده فنی مهندسی-دانشیار گروه مهندسی صنایع-دانشکده مهندسی-دانشگاه الزهرا(س)

2 دانشجو

3 محقق پسادکتری

10.24200/j65.2025.65842.2423

چکیده

این تحقیق به مدلسازی و حل مسئله مکان‌یابی حداکثر پوشش‌دهی پویا پرداخته که در آن تسهیلات از واحدهای مستقلی تشکیل شده که قابلیت جابه‌جایی در دوره های مختلف داشته و ماژول نامیده میشوند. ماژول‌ها ممکن است به هر دلیلی از دسترس خارج شوند و نتوانند تقاضای انتصاب شده را پوشش دهند. هدف اصلی مسئله تخصیص حداکثر خدمت پایه و پشتیبان به افرادی است که دچار بحران شده‌اند. مدل ریاضی عدد صحیح مختلط بوده و یک مطالعه موردی بر روی منطقه سه تهران انجام داده که تمامی فاکتورها و پارامترهای مربوط به مدل را با توجه ویژه به شرایط واقعی در نظر گرفته‌ایم. مدل توسط نرم‌افزار گمز حل گردیده است و همچنین راه حلی در غالب الگوریتم تجزیه بندرز ارائه داده شده است. در نهایت نیز بر روی برخی پارامترهای مدل تحلیل حساسیت انجام شده و مشاهده شد که تغییرات در پارامترها روی خدمت پشتیبان تاثیر بیشتری می‌گذارند تا خدمت پایه.

کلیدواژه‌ها

موضوعات


عنوان مقاله [English]

mathematical modeling of dynamic maximal coverage location problem considering backup services; A case study of crises situation in the third district of Tehran

نویسندگان [English]

  • jafar Bagherinejad 1
  • Hanieh Sabiza 2
  • Roghayyeh Alizadeh 3
1 Department of Industrial Engineering, Faculty of Engineering, Alzahra University
2 student
3 Postdoctoral researcher
چکیده [English]

This research deals with modeling and solving the maximal covering location problem, in which the facilities are composed of independent units that have the ability to move between facilities in different time periods and are called modules. The main goal is to provide maximum service to people who are in crisis during an accident and need basic services. Modules may become unavailable for any reason and fail to cover assigned demand. The problem model first determines the location of the facility and when a crisis occurs, according to the needs that arise in each demand area, it sends the modules responding to the same needs to the facilities in those areas. These modules are deployed in localized facilities and are moved to other demand areas after completion of service work. Therefore, the main objective is to allocate maximum basic and backup services to people who are in crisis. Another issue discussed in this article is that modules may become unavailable for any reason and fail to cover the demand assigned to them. For this reason, in addition to providing the main and basic service to the demand points, when the entire capacity of some modules is not available, the modules located in the nearby facilities can cover the demand of the neglected points and compensate for this deficiency by providing backup service.
The mathematical model is a mixed integer problem, and a case study has been conducted on the third district of Tehran, where we have considered all the factors and parameters related to the model with special attention to the real conditions. The model has been solved by Gams software, and a solution based on Benders decomposition algorithm has been presented. Finally, sensitivity analysis was performed on some parameters of the model and it was observed that the changes in the parameters affect the backup service more than the basic service

کلیدواژه‌ها [English]

  • Dynamic maximal covering location problem
  • modular facility
  • back-up services
  • capacitated modules
  • Benders decomposition algorithm