Peiyu Zhang, Zhenge Yang, Haorui Ge, Zichao Xu, Luzheng Bi
{"title":"Integrating evacuation and relief redistribution into last-mile relief network design: A two-stage distributionally robust optimization approach","authors":"Peiyu Zhang, Zhenge Yang, Haorui Ge, Zichao Xu, Luzheng Bi","doi":"10.1016/j.swevo.2025.102192","DOIUrl":null,"url":null,"abstract":"<div><div>Last-mile relief networks (LMRNs) play a critical role in disaster response, as they directly connect relief supplies to affected populations and determine the timeliness and effectiveness of emergency operations. Consequently, an efficient and reliable LMRN is essential for post-disaster management, ensuring that evacuation and relief distribution processes are seamlessly integrated and effectively executed. However, current approaches often neglect the varying severity of disasters, which is essential for tailoring evacuation networks, shelter planning, and relief distribution to real-world post-disaster needs. This paper investigates the design of a last-mile relief network that jointly integrates emergency evacuation and relief redistribution in post-disaster scenarios. The objective is to provide effective evacuation plans for severely affected areas while ensuring equitable relief allocation, even in cases where distribution centers are damaged. To capture the dual uncertainties of disaster environments and varying severity levels, we propose a two-stage distributionally robust optimization (DRO) model, where distinct ambiguity sets describe uncertain parameters. In the first stage, we determine the locations of candidate distribution centers (CDCs), local distribution centers (LDCs), and shelters. In the second stage, we optimize the evacuation plan and the allocation of relief supplies in response to the realized post-disaster conditions. To address the computational complexity of the two-stage DRO, we derive a tractable robust counterpart based on partial probability information and design a tailored solution algorithm to efficiently obtain optimal strategies. The proposed approach is validated using a real-world case study of the Nepal earthquake, demonstrating improvements in evacuation efficiency and relief distribution reliability, while sensitivity analyses further yield practical insights for disaster response planning.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"99 ","pages":"Article 102192"},"PeriodicalIF":8.5000,"publicationDate":"2025-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650225003499","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
Last-mile relief networks (LMRNs) play a critical role in disaster response, as they directly connect relief supplies to affected populations and determine the timeliness and effectiveness of emergency operations. Consequently, an efficient and reliable LMRN is essential for post-disaster management, ensuring that evacuation and relief distribution processes are seamlessly integrated and effectively executed. However, current approaches often neglect the varying severity of disasters, which is essential for tailoring evacuation networks, shelter planning, and relief distribution to real-world post-disaster needs. This paper investigates the design of a last-mile relief network that jointly integrates emergency evacuation and relief redistribution in post-disaster scenarios. The objective is to provide effective evacuation plans for severely affected areas while ensuring equitable relief allocation, even in cases where distribution centers are damaged. To capture the dual uncertainties of disaster environments and varying severity levels, we propose a two-stage distributionally robust optimization (DRO) model, where distinct ambiguity sets describe uncertain parameters. In the first stage, we determine the locations of candidate distribution centers (CDCs), local distribution centers (LDCs), and shelters. In the second stage, we optimize the evacuation plan and the allocation of relief supplies in response to the realized post-disaster conditions. To address the computational complexity of the two-stage DRO, we derive a tractable robust counterpart based on partial probability information and design a tailored solution algorithm to efficiently obtain optimal strategies. The proposed approach is validated using a real-world case study of the Nepal earthquake, demonstrating improvements in evacuation efficiency and relief distribution reliability, while sensitivity analyses further yield practical insights for disaster response planning.
期刊介绍:
Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.