Author
Listed:
- Hu, Qing-Mi
- Hu, Shaolong
- Dong, Zhijie Sasha
- Song, Yongjia
Abstract
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.
Suggested Citation
Hu, Qing-Mi & Hu, Shaolong & Dong, Zhijie Sasha & Song, Yongjia, 2025.
"Evacuation network design under road capacity improvement and uncertainty: second-order cone programming reformulations and Benders decomposition,"
European Journal of Operational Research, Elsevier, vol. 326(3), pages 674-690.
Handle:
RePEc:eee:ejores:v:326:y:2025:i:3:p:674-690
DOI: 10.1016/j.ejor.2025.04.030
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:326:y:2025:i:3:p:674-690. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.