Emergency Service Vehicle Location Problem With Batch Arrival of Demands

In this paper an emergency service vehicle (esv) location problem has been considered in which it is assumed that each emergency call may require more than one esv. in esv location problem two factors should be known; the location of stations and the number of esvs at each station. hence, a nonlinear mixed integer programming model is presented in order to maximize the total response rate to the emergency calls. moreover, a solution method based on genetic algorithm is provided and efficiency of the algorithm is evaluated with regard to the results from an exhaustive enumeration method. the model is applied to the real case study based on the data from mashhad city to find the emergency gas stations and the required esvs. finally, a sensitivity analysis on the main parameters of the model is conducted and the managerial insights were reported. the results indicate that considering the fact that each call may require more than one esv is very influential on the response rate and the assumption of each call requires just one esv makes the results unrealistic.