Optimizing task assignment and routing operations with a heterogeneous fleet of unmanned aerial vehicles for emergency healthcare services

IF 4.1 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Computers & Operations Research Pub Date : 2024-11-06 DOI:10.1016/j.cor.2024.106890
Ziru Lin , Xiaofeng Xu , Emrah Demir , Gilbert Laporte
{"title":"Optimizing task assignment and routing operations with a heterogeneous fleet of unmanned aerial vehicles for emergency healthcare services","authors":"Ziru Lin ,&nbsp;Xiaofeng Xu ,&nbsp;Emrah Demir ,&nbsp;Gilbert Laporte","doi":"10.1016/j.cor.2024.106890","DOIUrl":null,"url":null,"abstract":"<div><div>This paper studies the optimization of task assignment and pickup and delivery operations using a heterogeneous fleet of unmanned aerial vehicles (UAVs). We specifically address the distribution of emergency medical supplies, including medications, vaccines, and essential medical aid, as well as the collection of biological blood samples for testing and analysis. Unique challenges, such as supply shortages, time windows, and geographical considerations, are explicitly taken into account. The problem is first formulated as a mixed-integer linear programming model aimed at maximizing the total profit derived from the execution of a set of emergency healthcare pickup and delivery tasks. An enhanced Q-learning-based adaptive large neighborhood search (QALNS) is proposed for large-scale benchmark instances. QALNS exhibits a superior performance on benchmark instances. It also improves the quality of the solutions on average by 5.49% and 6.86% compared to the Gurobi solver and a state-of-the-art adaptive large neighborhood search algorithm, respectively. Sensitivity analyses are performed on critical factors contributing to the performance of the QALNS algorithm, such as the learning rate and the discount indicator. Finally, we provide managerial insights on the use of the fleet of UAVs and the design of the network.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"174 ","pages":"Article 106890"},"PeriodicalIF":4.1000,"publicationDate":"2024-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054824003629","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

This paper studies the optimization of task assignment and pickup and delivery operations using a heterogeneous fleet of unmanned aerial vehicles (UAVs). We specifically address the distribution of emergency medical supplies, including medications, vaccines, and essential medical aid, as well as the collection of biological blood samples for testing and analysis. Unique challenges, such as supply shortages, time windows, and geographical considerations, are explicitly taken into account. The problem is first formulated as a mixed-integer linear programming model aimed at maximizing the total profit derived from the execution of a set of emergency healthcare pickup and delivery tasks. An enhanced Q-learning-based adaptive large neighborhood search (QALNS) is proposed for large-scale benchmark instances. QALNS exhibits a superior performance on benchmark instances. It also improves the quality of the solutions on average by 5.49% and 6.86% compared to the Gurobi solver and a state-of-the-art adaptive large neighborhood search algorithm, respectively. Sensitivity analyses are performed on critical factors contributing to the performance of the QALNS algorithm, such as the learning rate and the discount indicator. Finally, we provide managerial insights on the use of the fleet of UAVs and the design of the network.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
利用异构无人机队优化任务分配和路由操作,以提供紧急医疗服务
本文研究了利用异构无人机(UAV)优化任务分配和取送操作的问题。我们特别讨论了紧急医疗用品(包括药品、疫苗和基本医疗救助)的分发,以及生物血液样本的采集与分析。我们明确考虑到了独特的挑战,如供应短缺、时间窗口和地理因素。该问题首先被表述为一个混合整数线性规划模型,旨在最大化执行一系列紧急医疗保健取送任务所带来的总利润。针对大规模基准实例,提出了基于 Q-learning 的增强型自适应大邻域搜索(QALNS)。QALNS 在基准实例上表现出卓越的性能。与 Gurobi 求解器和最先进的自适应大型邻域搜索算法相比,QALNS 还能将求解质量平均提高 5.49% 和 6.86%。我们对影响 QALNS 算法性能的关键因素(如学习率和折扣指标)进行了敏感性分析。最后,我们就无人机队的使用和网络设计提供了管理见解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computers & Operations Research
Computers & Operations Research 工程技术-工程:工业
CiteScore
8.60
自引率
8.70%
发文量
292
审稿时长
8.5 months
期刊介绍: Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.
期刊最新文献
Understand your decision rather than your model prescription: Towards explainable deep learning approaches for commodity procurement Airline recovery problem under disruptions: A review A decomposition scheme for Wasserstein distributionally robust emergency relief network design under demand uncertainty and social donations Scheduling AMSs with generalized Petri nets and highly informed heuristic search Efficient arc-flow formulations for makespan minimisation on parallel machines with a common server
×
引用
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