Reliable Facility Location Problem with Facility Protection

Luohao Tang; Cheng Zhu; Zaili Lin; Jianmai Shi; Weiming Zhang

doi:10.1371/journal.pone.0161532

Reliable Facility Location Problem with Facility Protection

PLoS One. 2016 Sep 1;11(9):e0161532. doi: 10.1371/journal.pone.0161532. eCollection 2016.

Authors

Luohao Tang¹, Cheng Zhu¹, Zaili Lin², Jianmai Shi¹, Weiming Zhang¹

Affiliations

¹ Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, Changsha, Hunan, China.
² College of Mechanical and Power Engineering, Chongqing University of Science and Technology, Chongqing, China.

Abstract

This paper studies a reliable facility location problem with facility protection that aims to hedge against random facility disruptions by both strategically protecting some facilities and using backup facilities for the demands. An Integer Programming model is proposed for this problem, in which the failure probabilities of facilities are site-specific. A solution approach combining Lagrangian Relaxation and local search is proposed and is demonstrated to be both effective and efficient based on computational experiments on random numerical examples with 49, 88, 150 and 263 nodes in the network. A real case study for a 100-city network in Hunan province, China, is presented, based on which the properties of the model are discussed and some managerial insights are analyzed.

MeSH terms

Algorithms
China
Costs and Cost Analysis
Facility Design and Construction* / economics
Models, Theoretical
Organizational Case Studies
Probability
Security Measures*

Grants and funding

This research was supported by the National Science Foundation of China Grant (61273322, 71571186, 71201169: http://www.nsfc.gov.cn/). LT was also supported by the China Scholarship Council (20123013: http://en.csc.edu.cn/). The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.