Dynamic optimization with restricted and unrestricted moves between changes: A study on the dynamic maximal covering location problem

Adaptation to changes in real scenarios is not a “cost-free” operation. However, in general, this is not considered in most of the studies done in dynamic optimization problems. Our focus here is to analyse what happens when a relocation cost is added in the dynamic maximal covering location problem, that is, when the adaptation to changes entails some cost. Comparing two models with and without “cost-free” adaptation, respectively, we study how much coverage is lost, how similar are the solutions obtained for both problems along the time and we preliminarily explore the relation between solution similarity and coverage differences.

[1]  Shengxiang Yang,et al.  Metaheuristics for dynamic combinatorial optimization problems. , 2013 .

[2]  Tad Hogg,et al.  An Economics Approach to Hard Computational Problems , 1997, Science.

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

[4]  John J. Bernardo,et al.  Developing and validating a decision support system for locating emergency medical vehicles in Louisville, Kentucky , 1994 .

[5]  Ken-ichi Tanaka.  Maximum flow-covering location and service start time problem and its application to tokyo metropolitan railway network , 2011 .

[6]  Gamini Gunawardane,et al.  Dynamic versions of set covering type public facility location problems , 1982 .

[7]  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..

[8]  Rosbi Mamat,et al.  Impact of Ambulance Dispatch Policies on Performance of Emergency Medical Services , 2011, IEEE Transactions on Intelligent Transportation Systems.

[9]  Jenny Fajardo Calderín,et al.  Algorithm portfolio based scheme for dynamic optimization problems , 2015, Int. J. Comput. Intell. Syst..

[10]  Shengxiang Yang,et al.  Evolutionary dynamic optimization: A survey of the state of the art , 2012, Swarm Evol. Comput..

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

[12]  Bart Selman,et al.  Algorithm portfolios , 2001, Artif. Intell..

[13]  Xin Yao,et al.  Experimental study on population-based incremental learning algorithms for dynamic optimization problems , 2005, Soft Comput..

[14]  Yves Crama,et al.  Simulated annealing for complex portfolio selection problems , 2003, Eur. J. Oper. Res..

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

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

[17]  Verena Schmid,et al.  Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming , 2012, Eur. J. Oper. Res..

[18]  Jürgen Branke,et al.  Memory enhanced evolutionary algorithms for changing optimization problems , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

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

[20]  David A. Schilling,et al.  DYNAMIC LOCATION MODELING FOR PUBLIC‐SECTOR FACILITIES: A MULTICRITERIA APPROACH , 1980 .

[21]  Xin Yao,et al.  Benchmark Generator for CEC'2009 Competition on Dynamic Optimization , 2008 .

[22]  Karl F. Doerner,et al.  Ambulance location and relocation problems with time-dependent travel times , 2010, Eur. J. Oper. Res..

[23]  Mohammad Hossein Fazel Zarandi,et al.  The large-scale dynamic maximal covering location problem , 2013, Math. Comput. Model..