Heuristic Solution of an Extended Double-Coverage Ambulance Location Problem for Austria

In this paper, we present solution procedures to tackle an am- bulance location problem in Austria. We consider the problem as a double- coverage ambulance location problem, and for specifying it in formal terms, we use an extension of a model developed by Gendreau, Laporte and Semet (11) by introducing a limit on the number of inhabitants served per ambu- lance. To solve the problem, we reimplemented the Tabu Search algorithm

[1]  Richard L. Church,et al.  The maximal covering location problem , 1974 .

[2]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

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

[4]  Karl F. Doerner,et al.  Multicriteria tour planning for mobile healthcare facilities in a developing country , 2007, Eur. J. Oper. Res..

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

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

[7]  Piero Mussio,et al.  Toward a Practice of Autonomous Systems , 1994 .

[8]  Gilbert Laporte,et al.  Ambulance location and relocation models , 2000, Eur. J. Oper. Res..

[9]  Mark S. Daskin,et al.  A Maximum Expected Covering Location Model: Formulation, Properties and Heuristic Solution , 1983 .

[10]  Adnan Acan.  An External Memory Implementation in Ant Colony Optimization , 2004, ANTS Workshop.

[11]  Walter J. Gutjahr,et al.  ACO algorithms with guaranteed convergence to the optimal solution , 2002, Inf. Process. Lett..

[12]  Manuel López-Ibáñez,et al.  Ant colony optimization , 2010, GECCO '10.

[13]  Marco Dorigo,et al.  Distributed Optimization by Ant Colonies , 1992 .

[14]  Maria Paola Scaparra,et al.  Facilities, Locations, Customers: Building Blocks of Location Models. A Survey. , 2001 .