Abstract: When an emergency vehicle scheduling problem involving multiple accidents and multiple rescue sites occurs,the response time of potential accidents can be shortened by redistributing idle emergency vehicles on res- cue sites,in addition to optimizing the scheduling of vehicles for current accidents.This paper presents an improved model of emergency vehicle scheduling and reallocation on the basis of bi-level programming and non-cooperative game.The upper level of the model is established under the constraints of accident requirements and accident rescue window to minimize the response time for current accidents,while in the lower level of the model,each rescue site is treated as a participant in a non-cooperative game,the payoff function of each participant is determined after tak- ing into account the reallocation time of the vehicle and the potential risks within the coverage area of each rescue site,so that the optimal reallocation strategy is transferred into Nash equilibrium in a non-cooperative game.After- wards,an integrated bi-level shuffled frog-leaping algorithm is proposed,which contains an upper-layer algorithm for single-objective programming and a lower-layer algorithm for solving the non-cooperative game.Several illustra- tive examples verify the rationality of the proposed model and the effectiveness of the integrated bi-level shuffled frog-leaping algorithm.

Key words: emergency vehicles, scheduling algorithms, resource allocation, game theory