The large scale maximal covering location problem

The maximal covering location problem (MCLP) is a challenging problem with numerous applications in practice. Previous publications in the area of MCLP proposed models and presented solution methodologies to solve this problem with up to 900 nodes. Due to the fact that in real-life applications, the number of nodes could be much higher, this paper presents a customized Genetic Algorithm (GA) to solve MCLP instances, with up to 2500 nodes. Results show that the proposed approach is capable of solving problems with a fair amount of exactness. In order to fine-tune the algorithm, Tukey’s Least Significant Difference (LSD) tests are employed on a set of test problems.

[1]  Savas Balin,et al.  Non-identical parallel machine scheduling using genetic algorithm , 2011, Expert Syst. Appl..

[2]  Zvi Drezner,et al.  The gradual covering decay location problem on a network , 2003, Eur. J. Oper. Res..

[3]  Young Hoon Lee,et al.  Tabu based heuristics for the generalized hierarchical covering location problem , 2010, Comput. Ind. Eng..

[4]  Cem Saydam,et al.  Solving large-scale maximum expected covering location problems by genetic algorithms: A comparative study , 2002, Eur. J. Oper. Res..

[5]  Jiamin Wang,et al.  The minmax regret gradual covering location problem on a network with incomplete information of demand weights , 2011, Eur. J. Oper. Res..

[6]  Hasan Selim,et al.  A fuzzy multi-objective covering-based vehicle location model for emergency services , 2007, Comput. Oper. Res..

[7]  Kenneth L. Roberts,et al.  Generalized coverage models and public facility location , 1983 .

[8]  Oded Berman,et al.  The Ordered Gradual Covering Location Problem on a Network , 2009, Discret. Appl. Math..

[9]  Mohammad Hossein Fazel Zarandi,et al.  Maximal covering location problem (MCLP) with fuzzy travel times , 2011, Expert Syst. Appl..

[10]  Jiamin Wang,et al.  The probabilistic gradual covering location problem on a network with discrete random demand weights , 2011, Comput. Oper. Res..

[11]  Yinzhen Li,et al.  The fuzzy quadratic assignment problem with penalty: New models and genetic algorithm , 2006, Appl. Math. Comput..

[12]  Mustafa S. Canbolat,et al.  Planar maximal covering with ellipses , 2009, Comput. Ind. Eng..

[13]  Brian Boffey,et al.  Dual-based heuristics for a hierarchical covering location problem , 2003, Comput. Oper. Res..

[14]  Keivan Ghoseiri,et al.  Multi-objective vehicle routing problem with time windows using goal programming and genetic algorithm , 2010, Appl. Soft Comput..

[15]  Brian Boffey,et al.  A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem , 2000, Eur. J. Oper. Res..

[16]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[17]  Kevin M. Curtin,et al.  Determining Optimal Police Patrol Areas with Maximal Covering and Backup Covering Location Models , 2010 .

[18]  Kwang Ryel Ryu,et al.  Exploiting Unexpressed Genes for Solving Large-Scaled Maximal Covering Problems , 2004, PRICAI.

[19]  Zvi Drezner,et al.  Generalized coverage: New developments in covering location models , 2010, Comput. Oper. Res..

[20]  Hamid Reza Golmakani,et al.  Markowitz-based portfolio selection with minimum transaction lots, cardinality constraints and regarding sector capitalization using genetic algorithm , 2009, Expert Syst. Appl..

[21]  Esra Köktener Karasakal,et al.  A maximal covering location model in the presence of partial coverage , 2004, Comput. Oper. Res..

[22]  Glaydston Mattos Ribeiro,et al.  A decomposition approach for the probabilistic maximal covering location-allocation problem , 2009, Comput. Oper. Res..

[23]  Bülent Çatay,et al.  A multi-period double coverage approach for locating the emergency medical service stations in Istanbul , 2011, J. Oper. Res. Soc..

[24]  Hassan Shavandi,et al.  A fuzzy queuing location model with a genetic algorithm for congested systems , 2006, Appl. Math. Comput..

[25]  Frank Plastria,et al.  Discrete models for competitive location with foresight , 2008, Comput. Oper. Res..

[26]  Ioannis Giannikos,et al.  A new model for maximal coverage exploiting GIS capabilities , 2010, Eur. J. Oper. Res..

[27]  Radivoj Petrovic,et al.  Fuzzy logic based algorithms for maximum covering location problems , 2009, Inf. Sci..

[28]  Bo Qu,et al.  Path relinking approach for multiple allocation hub maximal covering problem , 2009, Comput. Math. Appl..

[29]  George O. Wesolowsky,et al.  A mixed integer formulation for maximal covering by inclined parallelograms , 2004, Eur. J. Oper. Res..

[30]  Charles ReVelle,et al.  The Hierarchical Service Location Problem , 1982 .

[31]  Mohammad Hossein Fazel Zarandi,et al.  Design of a closed-loop supply chain (CLSC) model using an interactive fuzzy goal programming , 2011 .

[32]  Richard L. Church,et al.  Improving accessibility to rural health services: The maximal covering network improvement problem , 2009 .

[33]  Haluk Topcuoglu,et al.  Solving the uncapacitated hub location problem using genetic algorithms , 2005, Comput. Oper. Res..

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

[35]  Cem Saydam,et al.  A multiperiod set covering location model for dynamic redeployment of ambulances , 2008, Comput. Oper. Res..

[36]  Horst A. Eiselt,et al.  A bibliography for some fundamental problem categories in discrete location science , 2008, Eur. J. Oper. Res..

[37]  Samuel J. Ratick,et al.  Application and extension of the Moore and ReVelle Hierarchical Maximal Covering Model , 2009 .

[38]  Justin C. Williams,et al.  Solving the maximal covering location problem with heuristic concentration , 2008, Comput. Oper. Res..