An Improved Voronoi-Diagram-Based Algorithm for Continuous Facility Location Problem under Disruptions

被引:4
|
作者
Wang, Jiguang [1 ]
Wu, Yucai [1 ]
机构
[1] Shanxi Univ, Sch Econ & Management, Taiyuan 030006, Shanxi, Peoples R China
关键词
facility network design; disruption; continuous approximation; misestimation; SUPPLY CHAIN; APPROXIMATION APPROACH; DESIGN; RISKS; MODEL; INFORMATION; RESILIENCE; MANAGEMENT; COST;
D O I
10.3390/su10093099
中图分类号
X [环境科学、安全科学];
学科分类号
08 ; 0830 ;
摘要
The classical location models implicitly assume that the facilities, once built, will always operate as planned. However, some of the facilities may become unavailable from time to time due to disruptions which highlight the urgent need to effectively manage supply chain disruptions in spite of their low probability of occurrence. Therefore, it is critical to take account of disruptions when designing a resilient supply chain network so that it performs well as a whole even after an accidental disruption. In this paper, a stylized facility location problem is considered in a continuous plane which is solved through an improved Voronoi-diagram-based algorithm under disruption risks. The research problem is to minimize the total cost in normal and failure scenarios. Furthermore, the impact of misestimating the disruption probability is also investigated. The results numerically show that although the estimated disruption probability has a significant impact on the facilities configuration, it has a minor impact on the total quantity of facilities and the expected total cost. Therefore, this paper proposes that the decision-maker should moderately overestimate disruption risk based on the pessimistic principle. Finally, the conclusion considers managerial insights and proposes potential areas for future research.
引用
收藏
页数:13
相关论文
共 50 条
  • [21] An Algorithm to Generate a Weighted Network Voronoi Diagram Based on Improved PCNN
    Lu, Xiaomin
    Yan, Haowen
    APPLIED SCIENCES-BASEL, 2022, 12 (12):
  • [22] Two level uncapacitated facility location problem with disruptions
    Ramshani, Mohammad
    Ostrowski, Jim
    Zhang, Kaike
    Li, Xueping
    COMPUTERS & INDUSTRIAL ENGINEERING, 2019, 137
  • [23] A Clustering Density Weighted Algorithm of KNN Fingerprint Location Based on Voronoi Diagram
    Dang, Xiaochao
    Hei, Yili
    Hao, Zhanjun
    WIRELESS SENSOR NETWORKS (CWSN 2017), 2018, 812 : 175 - 190
  • [24] A risk-averse location-protection problem under intentional facility disruptions: A modified hybrid decomposition algorithm
    Jalali, Sajjad
    Seifbarghy, Mehdi
    Niaki, Seyed Taghi Akhavan
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2018, 114 : 196 - 219
  • [25] Location equilibria for a continuous competitive facility location problem under delivered pricing
    Fernandez, Jose
    Salhi, Said
    Toth, Boglarka G.
    COMPUTERS & OPERATIONS RESEARCH, 2014, 41 : 185 - 195
  • [26] A General Model and Efficient Algorithms for Reliable Facility Location Problem Under Uncertain Disruptions
    Li, Yongzhen
    Li, Xueping
    Shu, Jia
    Song, Miao
    Zhang, Kaike
    INFORMS JOURNAL ON COMPUTING, 2022, 34 (01) : 407 - 426
  • [27] A Voronoi-diagram-based dynamic path-planning system for underactuated marine vessels
    Candeloro, Mauro
    Lekkas, Anastasios M.
    Sorensen, Asgeir J.
    CONTROL ENGINEERING PRACTICE, 2017, 61 : 41 - 54
  • [28] A continuous particle swarm optimization algorithm for uncapacitated facility location problem
    Sevkli, Mehmet
    Guner, Ali R.
    ANT COLONY OPTIMIZATION AND SWARM INTELLIGENCE, PROCEEDINGS, 2006, 4150 : 316 - 323
  • [29] Reliable Facility Location Design Under the Risk of Disruptions
    Cui, Tingting
    Ouyang, Yanfeng
    Shen, Zuo-Jun Max
    OPERATIONS RESEARCH, 2010, 58 (04) : 998 - 1011
  • [30] Improved Exact Algorithm for the Capacitated Facility Location Problem on a Line Graph
    Gimadi, Edward
    Shtepa, Alexandr
    Tsidulko, Oxana
    2019 15TH INTERNATIONAL ASIAN SCHOOL-SEMINAR OPTIMIZATION PROBLEMS OF COMPLEX SYSTEMS (OPCS 2019), 2019, : 53 - 57