灾后协同交付和观察的调度问题

IF 8.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Li Chen , Enming Chen , Ruiyang Li , Zhongbao Zhou , Wenting Sun , Jianmai Shi
{"title":"灾后协同交付和观察的调度问题","authors":"Li Chen ,&nbsp;Enming Chen ,&nbsp;Ruiyang Li ,&nbsp;Zhongbao Zhou ,&nbsp;Wenting Sun ,&nbsp;Jianmai Shi","doi":"10.1016/j.swevo.2025.102047","DOIUrl":null,"url":null,"abstract":"<div><div>After the disaster, incremental disaster points, uncertain information on emergency needs, and changing weather impede emergency deliveries and increase the risk to delivery personnel. This paper introduces the scheduling problem with a delivery vehicle and a high-performance observation unmanned aerial vehicle (UAV) in collaboration (SP-DVOUC) to address the difficulties encountered in emergency delivery. In the SP-DVOUC, the routes of the UAV and the delivery vehicle depend on the information updates on points, needs, and changing weather. Considering the information updates, we solve the SP-DVOUC by the rolling-horizon approach. We formulate a MIP model and propose two acceleration strategies specific to post-disaster dynamics, an insertion heuristic designed to rapidly restore solution feasibility during dynamic updates, and a large neighborhood search algorithm for the fast rolling-horizon approach. After extensive experiments based on the Yushu Earthquake in China, the performance of the SP-DVOUC and the fast rolling-horizon approach is verified. In particular, our algorithm outperforms three algorithms used in other studies to solve similar problems. In addition, some suggestions for urgent delivery and algorithm parameterization are given.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"97 ","pages":"Article 102047"},"PeriodicalIF":8.5000,"publicationDate":"2025-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The scheduling problem with delivery and observation in collaboration after the disaster\",\"authors\":\"Li Chen ,&nbsp;Enming Chen ,&nbsp;Ruiyang Li ,&nbsp;Zhongbao Zhou ,&nbsp;Wenting Sun ,&nbsp;Jianmai Shi\",\"doi\":\"10.1016/j.swevo.2025.102047\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>After the disaster, incremental disaster points, uncertain information on emergency needs, and changing weather impede emergency deliveries and increase the risk to delivery personnel. This paper introduces the scheduling problem with a delivery vehicle and a high-performance observation unmanned aerial vehicle (UAV) in collaboration (SP-DVOUC) to address the difficulties encountered in emergency delivery. In the SP-DVOUC, the routes of the UAV and the delivery vehicle depend on the information updates on points, needs, and changing weather. Considering the information updates, we solve the SP-DVOUC by the rolling-horizon approach. We formulate a MIP model and propose two acceleration strategies specific to post-disaster dynamics, an insertion heuristic designed to rapidly restore solution feasibility during dynamic updates, and a large neighborhood search algorithm for the fast rolling-horizon approach. After extensive experiments based on the Yushu Earthquake in China, the performance of the SP-DVOUC and the fast rolling-horizon approach is verified. In particular, our algorithm outperforms three algorithms used in other studies to solve similar problems. In addition, some suggestions for urgent delivery and algorithm parameterization are given.</div></div>\",\"PeriodicalId\":48682,\"journal\":{\"name\":\"Swarm and Evolutionary Computation\",\"volume\":\"97 \",\"pages\":\"Article 102047\"},\"PeriodicalIF\":8.5000,\"publicationDate\":\"2025-06-27\",\"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/S2210650225002056\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650225002056","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

灾后,灾害点增加、应急需求信息不确定以及天气变化阻碍了紧急交付,增加了交付人员面临的风险。本文介绍了一种运载工具与高性能观测无人机(SP-DVOUC)协同调度的问题,以解决紧急交付中遇到的困难。在SP-DVOUC中,无人机和运载工具的路线取决于对点、需求和变化天气的信息更新。考虑到信息的不断更新,我们采用滚动视界法求解SP-DVOUC。我们建立了一个MIP模型,并提出了两种针对灾后动态的加速策略,一种旨在在动态更新期间快速恢复解决方案可行性的插入启发式策略,以及一种用于快速滚动地平线方法的大邻域搜索算法。通过对中国玉树地震的大量实验,验证了SP-DVOUC和快速滚动地平线方法的性能。特别是,我们的算法优于其他研究中用于解决类似问题的三种算法。此外,对紧急交付和算法参数化提出了一些建议。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The scheduling problem with delivery and observation in collaboration after the disaster
After the disaster, incremental disaster points, uncertain information on emergency needs, and changing weather impede emergency deliveries and increase the risk to delivery personnel. This paper introduces the scheduling problem with a delivery vehicle and a high-performance observation unmanned aerial vehicle (UAV) in collaboration (SP-DVOUC) to address the difficulties encountered in emergency delivery. In the SP-DVOUC, the routes of the UAV and the delivery vehicle depend on the information updates on points, needs, and changing weather. Considering the information updates, we solve the SP-DVOUC by the rolling-horizon approach. We formulate a MIP model and propose two acceleration strategies specific to post-disaster dynamics, an insertion heuristic designed to rapidly restore solution feasibility during dynamic updates, and a large neighborhood search algorithm for the fast rolling-horizon approach. After extensive experiments based on the Yushu Earthquake in China, the performance of the SP-DVOUC and the fast rolling-horizon approach is verified. In particular, our algorithm outperforms three algorithms used in other studies to solve similar problems. In addition, some suggestions for urgent delivery and algorithm parameterization are given.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Swarm and Evolutionary Computation
Swarm and Evolutionary Computation COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCEC-COMPUTER SCIENCE, THEORY & METHODS
CiteScore
16.00
自引率
12.00%
发文量
169
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信