论文信息 - A dynamic model and parallel tabu search heuristic for real-time ambulance relocation

A dynamic model and parallel tabu search heuristic for real-time ambulance relocation

Abstract This paper considers the redeployment problem for a fleet of ambulances. This problem is encountered in the real-time management of emergency medical services. A dynamic model is proposed and a dynamic ambulance management system is described. This system includes a parallel tabu search heuristic to precompute redeployment scenarios. Simulations based on real-data confirm the efficiency of the proposed approach.

[1] Vladimir Marianov,et al. Siting Emergency Services , 1995 .

[2] Vladimir Marianov,et al. The Queueing Maximal availability location problem: A model for the siting of emergency vehicles , 1996 .

[3] Charles ReVelle,et al. Concepts and applications of backup coverage , 1986 .

[4] Fred W. Glover,et al. Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[5] Michel Gendreau,et al. Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching , 1999, Transp. Sci..

[6] Charles S. ReVelle,et al. The Maximum Availability Location Problem , 1989, Transp. Sci..

[7] Said Salhi,et al. Facility Location: A Survey of Applications and Methods , 1996 .

[8] Gilbert Laporte,et al. Solving an ambulance location model by tabu search , 1997 .

[9] Gilbert Laporte,et al. Metaheuristics: A bibliography , 1996, Ann. Oper. Res..

[10] Fred W. Glover,et al. Tabu Search , 1997, Handbook of Heuristics.

[11] Michael O. Ball,et al. A Reliability Model Applied to Emergency Service Vehicle Location , 1993, Oper. Res..

[12] Marvin B. Mandell,et al. Covering models for two-tiered emergency medical services systems , 1998 .