A New Model for Location-Allocation Problem within Queuing Framework
Publish Year: 1388
نوع سند: مقاله ژورنالی
زبان: English
View: 377
This Paper With 9 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_JOIE-3-6_007
تاریخ نمایه سازی: 22 آبان 1397
Abstract:
This paper proposes a bi-objective model for the facility location problem under a congestion system. The idea of the model is motivated by applications of locating servers in bank automated teller machines (ATMS), communication networks, and so on. This model can be specifically considered for situations in which fixed service facilities are congested by stochastic demand within queueing framework. We formulate this model with two perspectives simultaneously: (i) customers and (ii) service provider. The objectives of the model are to minimize (i) the total expected travelling and waiting time and (ii) the average facility idle-time. This model represents a mixed-integer nonlinear programming problem which belongs to the class of NP-hard problems. In addition, to solve the model, two metaheuristic algorithms including non-dominated sorting genetic algorithms (NSGA-II) and non-dominated ranking genetic algorithms (NRGA) are proposed. Besides, to evaluate the performance of the two algorithms some numerical examples are produced and analyzed with some metrics to determine which algorithm works better
Keywords:
Authors
Seyed Hamid Reza Pasandideh
Islamic Azad University, Qazvin Branch, Department of Industrial and Mechanical Engineering, Qazvin, Iran
Amirhossain Chambari
Islamic Azad University, Qazvin Branch, Department of Industrial and Mechanical Engineering, Qazvin, Iran