A Maximal Covering Facility Location Model For Emergency Services Within An M ((T))/M/M/M Queuing System

PurposeIn emergency services, maximizing population coverage with the lowest cost at the peak of the demand is important. In addition, due to the nature of services in emergency centers, including hospitals, the number of servers and beds is actually considered as the capacity of the system. Hence, the purpose of this paper is to propose a multi-objective maximal covering facility location model for emergency service centers within an M ((t))/M/m/m queuing system considering different levels of service and periodic demand rate.Design/methodology/approachThe process of serving patients is modeled according to queuing theory and mathematical programming. To cope with multi-objectiveness of the proposed model, an augmented epsilon-constraint method has been used within GAMS software. Since the computational time ascends exponentially as the problem size increases, the GAMS software is not able to solve large-scale problems. Thus, a NSGA-II algorithm has been proposed to solve this category of problems and results have been compared with GAMS through random generated sample problems. In addition, the applicability of the proposed model in real situations has been examined within a case study in Iran.FindingsResults obtained from the random generated sample problems illustrated while both the GAMS software and NSGA-II almost share the same quality of solution, the CPU execution time of the proposed NSGA-II algorithm is lower than GAMS significantly. Furthermore, the results of solving the model for case study approve that the model is able to determine the location of the required facilities and allocate demand areas to them appropriately.Originality/valueIn the most of previous works on emergency services, maximal coverage with the minimum cost were the main objectives. Hereby, it seems that minimizing the number of waiting patients for receiving services have been neglected. To the best of the authors' knowledge, it is the first time that a maximal covering problem is formulated within an M ((t))/M/m/m queuing system. This novel formulation will lead to more satisfaction for injured people by minimizing the average number of injured people who are waiting in the queue for receiving services.