An MCDM-integrated maximum coverage approach for positioning of military surveillance systems

Abstract We study a surveillance system positioning problem within a national security project in Turkey. Urban areas throughout the country need to be monitored against probable attacks, and we propose set covering approaches to the problem. Working with a representative pilot area, we first find the minimum-cost solution that covers all demand points. We then calculate the criticality weights of these demand points by analytic hierarchy process. In the presence of constraints on the budget use and the number of surveillance systems used, we maximise weighted coverage. We also generate efficient solutions with the criteria of weighted coverage and budget use, and also weighted coverage and number of surveillance systems used. Moreover, we carry out sensitivity analysis on the weights used for demand points, and observe that the results are quite robust to weight changes.

[1]  Shengyin Li,et al.  Heuristic approaches for the flow-based set covering problem with deviation paths , 2014 .

[2]  Michel Gendreau,et al.  The maximal expected coverage relocation problem for emergency vehicles , 2006, J. Oper. Res. Soc..

[3]  L. Lasdon,et al.  On a bicriterion formation of the problems of integrated system identification and system optimization , 1971 .

[4]  Mark S. Daskin,et al.  Network and Discrete Location: Models, Algorithms and Applications , 1995 .

[5]  T. Saaty,et al.  Fundamentals of the analytic network process — Dependence and feedback in decision-making with a single network , 2004 .

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

[7]  Kathleen Hogan,et al.  The maximum reliability location problem and α-reliablep-center problem: Derivatives of the probabilistic location set covering problem , 1990 .

[8]  Thomas L. Saaty,et al.  DECISION MAKING WITH THE ANALYTIC HIERARCHY PROCESS , 2008 .

[9]  Charles S. ReVelle,et al.  The Maximum Availability Location Problem , 1989, Transp. Sci..

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

[11]  George Mavrotas,et al.  Effective implementation of the epsilon-constraint method in Multi-Objective Mathematical Programming problems , 2009, Appl. Math. Comput..

[12]  Y. H. Liu,et al.  Solving a fuzzy set-covering problem , 2004, Math. Comput. Model..

[13]  Michael O. Ball,et al.  A Reliability Model Applied to Emergency Service Vehicle Location , 1993, Oper. Res..

[14]  Paolo Dell'Olmo,et al.  A Multiperiod Maximal Covering Location Model for the optimal location of intersection safety cameras on an urban traffic network , 2014 .

[15]  Valentina Cacchiani,et al.  A set-covering based heuristic algorithm for the periodic vehicle routing problem , 2014, Discret. Appl. Math..

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

[17]  Daoqin Tong,et al.  Enhancing Classic Coverage Location Models , 2010 .

[18]  Daniel Serra,et al.  Locating emergency services with different priorities: the priority queuing covering location problem , 2008, J. Oper. Res. Soc..

[19]  Jing He,et al.  Reliable and Energy Efficient Target Coverage for Wireless Sensor Networks , 2011 .

[20]  Heung-Suk Hwang,et al.  Design of supply-chain logistics system considering service level , 2002 .

[21]  Mark S. Daskin,et al.  Strategic facility location: A review , 1998, Eur. J. Oper. Res..

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

[23]  S. Meng,et al.  Set covering location models with stochastic critical distances , 2013, J. Oper. Res. Soc..

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

[25]  Mark S. Daskin,et al.  A Maximum Expected Covering Location Model: Formulation, Properties and Heuristic Solution , 1983 .