Optimization of the ambulance fleet location and relocation

We consider the problem of optimal location of an ambulance fleet at the base stations. The objective is to minimize the average waiting time for ambulance arrival. We elaborate a simulation model that describes a day of work of the Emergency Medical Service (EMS). This model takes into account the stochastic nature of the problem and the changing busyness of the city’s transport network. To solve the problem, a genetic local search algorithm was developed with 4 types of neighborhoods. The simulation model in this algorithm is used to compute the value of the objective function. We investigate the influence of neighborhoods on the accuracy of the obtained solutions and conduct computer simulations on the example of the Vladivostok EMS. We show that it is possible to reduce the average waiting time by 1.5 times. Some estimates on the impact of traffic congestion on the average waiting time are obtained. Tab. 4, illustr. 11, bibliogr. 28.