Resilient facility location optimization under failure scenarios using NSGA-III: A multi-objective approach for enhanced system robustness

被引:1
作者
Vargas-Santiago, Mariano [1 ]
Leon-Velasco, Diana A. [2 ,3 ]
Monroy, Raul [4 ]
机构
[1] Secretaria Ciencia Human Tecnol & Innovac SECIHTI, Ave Insurgentes Sur 1582, Mexico City 03940, Mexico
[2] Univ Autonoma Hidalgo, Escuela Super Apan, Carretera Apan Calpulalpan Km 8, Apan 43900, Hidalgo, Mexico
[3] Univ Autonoma Metropolitana, Dept Sistemas, Unidad Azcapotzalco, Ave San Pablo Xalpa 180, Mexico City 02128, Mexico
[4] Tecnol Monterrey, Sch Engn & Sci, Carretera Lago Guadalupe Km 3-5, Atizapan 52926, Mexico State, Mexico
关键词
Facility location problem; Multi-objective optimization; Problems; Pareto set; Heuristics; Serious video games; Crowdsourcing; MODEL;
D O I
10.1016/j.eswa.2025.127210
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The Uncapacitated Facility Location Problem (UFLP) is a classical optimization problem that seeks to determine the optimal placement of facilities to minimize the total distance between facilities and demand points. In the face of increasing disruptions, such as natural disasters and other operational failures, the need for robust solutions that can maintain high levels of performance before and after disruptions has become more pressing. This paper presents an improved approach to the UFLP using the Non-dominated Sorting Genetic Algorithm III (NSGA-III). Compared to its predecessor, NSGA-II, NSGA-III exhibits significant computational improvements, including a reduction in computation time and an enhanced capability to explore the Pareto front efficiently. The proposed method aims to provide decision makers with robust solutions that minimize the total weighted distance under normal operating conditions and maintain resilience in the event of facility failures. NSGAIII demonstrates superior computational performance by requiring less time to obtain high-quality solutions and achieving a more diverse set of Pareto-optimal solutions. Computational experiments demonstrate a 25% improvement in Pareto front diversity and a 15% reduction in computational time compared to NSGA-II. Unlike previous methods requiring probabilistic failure data or additional resource allocation for protection, the proposed approach directly incorporates resilience considerations into the optimization process. The method allows decision-makers to identify robust facility placements that minimize the total weighted distance during normal operations and maintain performance under interruptions. Practical insights for resilient infrastructure planning are provided, supported by benchmark dataset analyses. The results underscore the efficacy of NSGAIII in achieving computational efficiency and solution diversity, advancing the state-of-the-art in multi-objective optimization for complex FLPs.
引用
收藏
页数:14
相关论文
共 44 条
[1]  
Aboolian R., 2021, Journal of Heuristics, V27, P625
[2]   Uncapacitated (Facility) Location Problem: A Hybrid Genetic-Tabu Search Approach [J].
Alidaee, Bahram ;
Wang, Haibo .
IFAC PAPERSONLINE, 2022, 55 (10) :1619-1624
[3]  
American Red Cross, 2023, Hurricane response efforts
[4]  
Babaeinesami A., 2020, IJE, V184, P191
[5]  
Back T, 1996, Evolutionary Algorithms in Theory and Practice:Evolution Strategies, Evolutionary Programming, Genetic Algorithms
[6]   A bi-level maximal covering location problem [J].
Casas-Ramirez, Martha-Selene ;
Camacho-Vallejo, Jose-Fernando ;
Diaz, Juan A. ;
Luna, Dolores E. .
OPERATIONAL RESEARCH, 2020, 20 (02) :827-855
[7]   Optimal charging facility location and capacity for electric vehicles considering route choice and charging time equilibrium [J].
Chen, Rui ;
Qian, Xinwu ;
Miao, Lixin ;
Ukkusuri, Satish V. .
COMPUTERS & OPERATIONS RESEARCH, 2020, 113
[8]  
Chen X., 2023, Journal of Advanced Computational Optimization, V98, P300
[9]   Robust facility location under demand uncertainty and facility disruptions [J].
Cheng, Chun ;
Adulyasak, Yossiri ;
Rousseau, Louis-Martin .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2021, 103
[10]  
Cinalli D, 2020, IEEE C EVOL COMPUTAT