Multi-period Maximal Covering Location Problem with Modular Facilities for Locating Emergency Facilities with Back-up Services

摘要

In this paper, an extension of Maximal Covering Location Problem (MCLP) has been developed for locating emergency facilities, composed of discrete structural components. These components are called modules of facilities. In the developed model, demand nodes are assigned to modules first and then modules are allocated to facilities. As the demands in emergency cases vary in different time periods, the problem is studied in multi-time periods. The problem is formulated as an integer programming model. We utilize a genetic algorithm to solve the problem because of this metaheuristic's strength to solve binary optimization problems and other extension of MCLP. Computational experiments are conducted to derive managerial insights.