عنوان مقاله :
به كارگيري مدل صف فوق مكعبي در مكان يابي تسهيلات اضطراري با درنظر گرفتن تسهيل پشتيبان
عنوان به زبان ديگر :
HYPERCUBE QUEUE MODEL FOR EMERGENCY FACILITY LOCATION PROBLEM CONSIDERING BACKUP FACILITY
پديد آورندگان :
اركات، جمال دانشگاه كردستان - گروه مهندسي صنايع , مهران،يعقوبي
كليدواژه :
مكان يابي تسهيلات اضطراري , خدمت دهنده ي متحرك , تسهيل پشتيبان , مدل صف فوق مكعبي , الگوريتم ژنتيك
چكيده فارسي :
در مسائل مكان يابي تسهيلات اضطراري، در نظر گرفتن تسهيل يا تسهيلات پشتيبان براي مشتريان باعث افزايش سطح پوشش تقاضا مي شود. در اين مقاله با در نظر گرفتن چنين فرضي، از مدل صف فوق مكعبي براي مدل سازي مسئله ي مكان يابي تسهيلات اضطراري با خدمت دهندگان متحرك استفاده مي شود. هدف مدل ارائه شده، انتخاب تعدادي از سايت هاي كانديدا براي استقرار تعداد مشخصي تسهيل است به گونه يي كه مجموع ميانگين زمان هاي انتظار مشتريان تا رسيدن خدمت دهنده، كمينه شود. در اين مدل، فرض مي شود كه فواصل زماني بين تقاضاهاي متوالي هر مشتري و همچنين زمان هاي خدمت دهي توسط هر تسهيل، داراي توزيع نمايي با نرخ مشخص است. به منظور ارزيابي صحت مدل رياضي ارائه شده، تعدادي مثال عددي ارائه و توسط نرم افزار G A M S و حل كننده ي C P L E X حل و تحليل مي شوند. همچنين با توجه به ناچندجمله يي سخت بودن مسئله ي تحت بررسي، يك الگوريتم ژنتيك به منظور حل مسائل در ابعاد بزرگ توسعه داده مي شود.
چكيده لاتين :
Most of the studies, which deal with the congested facility location problems, assumed that each customer must be only served by a facility, such that if the corresponding facility is out of service, the customers request will not be covered by other facilities. Considering backup facilities for customers help mathematical model to cope with the real-world situations; however, the common queue models will not be suitable any longer for analyzing the service system. In these situations, a common queueing system is hyper-cube queue models, in which the states of the queue are represented by a binary vector, showing the availability (i.e., 1) and unavailability or busyness (i.e., 0) of the facilities. In this paper, we use the concept of hypercube queue system in modelling emergency facility location problem with mobile servers. The proposed model aims to select a number of facilities from a number of candidate sites in a way that total expected waiting time for customers is minimized. It is assumed that each customers demand is provided by the closest free facility, and his or her arrival (call for service) process is considered to be Poisson process. Furthermore, in each facility, a single server with exponentially distributed service times is established. All previous studies on the applications of hyper-cube queue models in location problems considered the structure of queue model in terms of steady-state equations in the body of the proposed heuristic algorithms. For the first time, the steady-state equations of the hyper-cube queue model are included in the mathematical model; hence, the optimal solution can be found by solving the proposed model. Moreover, since the problem is NP-hard, a genetic algorithm is developed to solve large-scale problems. In order to evaluate the accuracy of the proposed model and the effectiveness of the proposed algorithm, a number of numerical examples are presented and analyzed. The results of the numerical examples demonstrate the acceptable performance of the proposed genetic algorithm.
عنوان نشريه :
مهندسي صنايع و مديريت شريف
عنوان نشريه :
مهندسي صنايع و مديريت شريف
