Evacuation network design under road capacity improvement and uncertainty: second-order cone programming reformulations and Benders decomposition

• Evacuation network design with road capacity improvement and uncertainty is stated. • A non-convex mixed-integer nonlinear program model is established. • Second-order cone programming reformulations are developed. • Benders decomposition with various acceleration strategies is devised. • Efficiency of proposed methods and comparison of existing method are explored. This work first presents a stochastic shelter location and evacuation planning problem with considering road capacity improvement strategies, in which the fixed setup cost of shelters and the improvement cost of road capacity are subject to a budget limit. To explicitly capture the impact of traffic volumes and road capacity improvement decisions on evacuation time, the Bureau of Public Roads function is employed. The problem is formulated as a non-convex mixed-integer nonlinear program (MINLP) model that is difficult to solve directly since the objective function is a multivariable non-convex nonlinear function. To tackle the non-convex MINLP, second-order cone programming (SOCP) reformulations that can be directly solved by using the state-of-the-art solvers are developed. Furthermore, a Benders decomposition (BD) approach that utilizes duality results of SOCP and employs acceleration strategies associated with valid inequalities, multi-cut, strengthened Benders cuts, knapsack inequalities, and callback routine, is proposed to solve large-scale problems. Moreover, extensive numerical experiments and a real-world case study (a potential hurricane risk zone in Texas, U.S.) are conducted to verify the applicability and effectiveness of the proposed model and solution approaches. Computational results show that the derived reformulations are competitive in dealing with small- and medium-scale problems, whereas BD approach demonstrates the best computational performance in solving large-scale problems. The devised acceleration strategies are effective in improving the computational efficiency of the BD approach. In addition, exerting investment for those shelters and arcs that are close to evacuation regions is useful to reduce the expected total evacuation time.

Authors

Institutions

Publication Details

Journal
European Journal of Operational Research
Published
2025-04-18
DOI
https://doi.org/10.1016/j.ejor.2025.04.030
Primary Topic
Evacuation and Crowd Dynamics
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Evacuation network design under road capacity improvement and uncertainty: second-order cone programming reformulations and Benders decomposition

Zhijie Dong, Yongjia Song, Qingmi Hu, Shaolong Hu
European Journal of Operational Research
Evacuation and Crowd Dynamics
article

Evacuation network design under road capacity improvement and uncertainty: second-order cone programming reformulations and Benders decomposition

Zhijie Dong, Yongjia Song, Qingmi Hu, Shaolong Hu
article en

Abstract

• Evacuation network design with road capacity improvement and uncertainty is stated. • A non-convex mixed-integer nonlinear program model is established. • Second-order cone programming reformulations are developed. • Benders decomposition with various acceleration strategies is devised. • Efficiency of proposed methods and comparison of existing method are explored. This work first presents a stochastic shelter location and evacuation planning problem with considering road capacity improvement strategies, in which the fixed setup cost of shelters and the improvement cost of road capacity are subject to a budget limit. To explicitly capture the impact of traffic volumes and road capacity improvement decisions on evacuation time, the Bureau of Public Roads function is employed. The problem is formulated as a non-convex mixed-integer nonlinear program (MINLP) model that is difficult to solve directly since the objective function is a multivariable non-convex nonlinear function. To tackle the non-convex MINLP, second-order cone programming (SOCP) reformulations that can be directly solved by using the state-of-the-art solvers are developed. Furthermore, a Benders decomposition (BD) approach that utilizes duality results of SOCP and employs acceleration strategies associated with valid inequalities, multi-cut, strengthened Benders cuts, knapsack inequalities, and callback routine, is proposed to solve large-scale problems. Moreover, extensive numerical experiments and a real-world case study (a potential hurricane risk zone in Texas, U.S.) are conducted to verify the applicability and effectiveness of the proposed model and solution approaches. Computational results show that the derived reformulations are competitive in dealing with small- and medium-scale problems, whereas BD approach demonstrates the best computational performance in solving large-scale problems. The devised acceleration strategies are effective in improving the computational efficiency of the BD approach. In addition, exerting investment for those shelters and arcs that are close to evacuation regions is useful to reduce the expected total evacuation time.

European Journal of Operational ResearchVol. 326(3)
Jiangsu University of Science and Technology (CN), Science and Technology Department of Sichuan Province (CN), Southwest Jiaotong University (CN), Southeast University (CN), Clemson University (US)
National Natural Science Foundation of China
Openalex Percentile: Top 90%
Evacuation and Crowd Dynamics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.