A Genetic Algorithm Based Approach to Provide Solutions for Emergency Aid Stations Location Problem and a Case Study for Pendik/İstanbul

Abstract The emergency aid station is one of the crucial components of the emergency health service chain providing vital acute medical care. This paper aims to solve a real world case related with the deployment of emergency aid stations in one of the densely populated districts of İstanbul/Turkey in order to determine the minimal number of ambulances needed to maintain complete coverage of all districts and also to obtain maximum population coverage with limited available ambulances. In this context, a new genetic algorithm capable of presenting quick and qualified solutions for a specific set and maximal covering location problems with limitations on service capacity of facilities is proposed.

[1]  Daniel Castro-Lacouture,et al.  Optimal decision making on urban renewal projects , 2010 .

[2]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

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

[4]  Daniel Miller,et al.  Modeling Decision Making in Trauma Centers from the Standpoint of Complex Adaptive Systems , 2012 .

[5]  Michel Gendreau,et al.  A dynamic model and parallel tabu search heuristic for real-time ambulance relocation , 2001, Parallel Comput..

[6]  J. Current,et al.  Capacitated Covering Models , 1988 .

[7]  Richard L. Church,et al.  The Team/Fleet Models for Simultaneous Facility and Equipment Siting , 1979 .

[8]  J. Beasley,et al.  A genetic algorithm for the set covering problem , 1996 .

[9]  Pedro A. Diaz-Gomez,et al.  Initial Population for Genetic Algorithms: A Metric Approach , 2007, GEM.

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

[11]  H. Pirkul,et al.  The Maximal Covering Location Problem with Capacities on Total Workload , 1991 .

[12]  Khaled Rasheed,et al.  An Adaptive Penalty Approach for Constrained Genetic-Algorithm Optimization , 1998 .

[13]  George O. Wesolowsky,et al.  FACILITIES LOCATION: MODELS AND METHODS , 1988 .

[14]  Mark Goh,et al.  Covering problems in facility location: A review , 2012, Comput. Ind. Eng..

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

[16]  Charles S. ReVelle,et al.  The Location of Emergency Service Facilities , 1971, Oper. Res..

[17]  Vassilios Petridis,et al.  Varying Fitness Functions in Genetic Algorithms: Studying the Rate of Increase of the Dynamic Penalty Terms , 1998, PPSN.

[18]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[19]  Mehpare Timor,et al.  The analytic hierarchy process and analytic network process: an overview of applications , 2010 .

[20]  S. N. Sivanandam,et al.  Introduction to genetic algorithms , 2007 .