A Genetic Algorithm for Multi-Period Location Problem with Modular Emergency Facilities and Backup Services

Abstract

In this paper, we develop a dynamic model and a solution procedure for maximal covering location problem with backup services for locating emergency facilities like fire stations. In this study, two main concepts are used to model a real life condition to improve the service level for demand nodes. These concepts are modular arrangement of different fire trucks and ambulances, as an example for modules, and backup services for demand nodes. The mathematical model is a pure 0-1 integer programming problem. To solve the problem, an efficient genetic algorithm is used because the algorithm has appeared as a strong method to solve integer programning problems. Some test problems are generated and solved by CPLEX, GA and a developed heuristic to be able to compare the results with managerial insights.