Optimizing last-mile delivery services: a robust truck-drone cooperation model and hybrid metaheuristic algorithm

IF 4.4 3区 管理学 Q1 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Annals of Operations Research Pub Date : 2024-07-26 DOI:10.1007/s10479-024-06164-5
Seyed Mohammad Javad Mirzapour Al-e-Hashem, Taha-Hossein Hejazi, Ghazal Haghverdizadeh, Mohsen Shidpour
{"title":"Optimizing last-mile delivery services: a robust truck-drone cooperation model and hybrid metaheuristic algorithm","authors":"Seyed Mohammad Javad Mirzapour Al-e-Hashem, Taha-Hossein Hejazi, Ghazal Haghverdizadeh, Mohsen Shidpour","doi":"10.1007/s10479-024-06164-5","DOIUrl":null,"url":null,"abstract":"<p>In response to the increasing demand for faster customer service and cost-effective solutions in competitive markets, many companies are exploring strategies and tools to streamline their services. One emerging approach involves the integration of drones with trucks, offering potential benefits such as reduced environmental impact and delivery time. This study focuses on the use of a single truck coordinating with multiple drones for postal package delivery. The drones are transported by the truck, and both vehicles are responsible for carrying out deliveries. To account for weather uncertainties, specifically wind direction and speed affecting drone travel time, a robust optimization model is developed to address the truck-drone routing problem. Additionally, a hybrid metaheuristic algorithm is proposed, combining Adaptive Large Neighborhood Search, Clarke and Wright Saving Algorithm, and Genetic Algorithm. The effectiveness of this algorithm is assessed through numerical experiments, including sensitivity analyses on key problem parameters. The findings demonstrate that the proposed model has practical applications in last-mile delivery services, while the algorithm provides near-optimal solutions within a reasonable timeframe (ALNS reaches the solutions 3500% faster than GAMS for small-sized problems in average). Also the results show that with the 100% increase in average distance between nodes in the network, the service time increases by more than 200%.</p>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":null,"pages":null},"PeriodicalIF":4.4000,"publicationDate":"2024-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Operations Research","FirstCategoryId":"91","ListUrlMain":"https://doi.org/10.1007/s10479-024-06164-5","RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0

Abstract

In response to the increasing demand for faster customer service and cost-effective solutions in competitive markets, many companies are exploring strategies and tools to streamline their services. One emerging approach involves the integration of drones with trucks, offering potential benefits such as reduced environmental impact and delivery time. This study focuses on the use of a single truck coordinating with multiple drones for postal package delivery. The drones are transported by the truck, and both vehicles are responsible for carrying out deliveries. To account for weather uncertainties, specifically wind direction and speed affecting drone travel time, a robust optimization model is developed to address the truck-drone routing problem. Additionally, a hybrid metaheuristic algorithm is proposed, combining Adaptive Large Neighborhood Search, Clarke and Wright Saving Algorithm, and Genetic Algorithm. The effectiveness of this algorithm is assessed through numerical experiments, including sensitivity analyses on key problem parameters. The findings demonstrate that the proposed model has practical applications in last-mile delivery services, while the algorithm provides near-optimal solutions within a reasonable timeframe (ALNS reaches the solutions 3500% faster than GAMS for small-sized problems in average). Also the results show that with the 100% increase in average distance between nodes in the network, the service time increases by more than 200%.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
优化最后一英里配送服务:稳健的卡车-无人机合作模型和混合元启发式算法
为了满足竞争激烈的市场对更快的客户服务和具有成本效益的解决方案日益增长的需求,许多公司正在探索简化服务的战略和工具。一种新出现的方法是将无人机与卡车整合在一起,从而带来潜在的好处,如减少对环境的影响和缩短投递时间。本研究的重点是使用一辆卡车协调多架无人机进行邮政包裹递送。无人机由卡车运输,两辆车都负责送货。为了考虑天气的不确定性,特别是影响无人机飞行时间的风向和风速,开发了一个稳健的优化模型来解决卡车-无人机路由问题。此外,还提出了一种混合元启发式算法,该算法结合了自适应大邻域搜索、克拉克和莱特节省算法以及遗传算法。通过数值实验,包括关键问题参数的敏感性分析,对该算法的有效性进行了评估。实验结果表明,所提出的模型在最后一英里配送服务中具有实际应用价值,同时该算法能在合理的时间范围内提供接近最优的解决方案(对于小型问题,ALNS 的求解速度比 GAMS 平均快 3500%)。结果还显示,网络中节点之间的平均距离增加 100%,服务时间就会增加 200%以上。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Annals of Operations Research
Annals of Operations Research 管理科学-运筹学与管理科学
CiteScore
7.90
自引率
16.70%
发文量
596
审稿时长
8.4 months
期刊介绍: The Annals of Operations Research publishes peer-reviewed original articles dealing with key aspects of operations research, including theory, practice, and computation. The journal publishes full-length research articles, short notes, expositions and surveys, reports on computational studies, and case studies that present new and innovative practical applications. In addition to regular issues, the journal publishes periodic special volumes that focus on defined fields of operations research, ranging from the highly theoretical to the algorithmic and the applied. These volumes have one or more Guest Editors who are responsible for collecting the papers and overseeing the refereeing process.
期刊最新文献
Efficiency and the core in NTU games in partition function form Longer healthy life, but for how many? A stochastic analysis of healthy lifespan inequality Efficient allocation of load-balancing and differentiation tasks in tandem queue services Portfolio optimization for sustainable investments Power utility maximization with expert opinions at fixed arrival times in a market with hidden Gaussian drift
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1