用于规划无载人飞行器异质物流的调整节约算法

Andy Oakey , Antonio Martinez-Sykora , Tom Cherrett
{"title":"用于规划无载人飞行器异质物流的调整节约算法","authors":"Andy Oakey ,&nbsp;Antonio Martinez-Sykora ,&nbsp;Tom Cherrett","doi":"10.1016/j.multra.2024.100170","DOIUrl":null,"url":null,"abstract":"<div><div>This paper proposes a new extension to the Sustainable Specimen Collection Problem (SSCP), where medical specimens are transported by vans, bikes, and uncrewed aerial vehicles (UAVs, or drones) from local medical practices/offices to a central hospital laboratory for analysis, employing a two-echelon collection approach. Time restrictions from existing operations and literature are also introduced, with the study being formulated as a weighted multi-objective problem seeking to minimise (i) operating costs; (ii) transit times; and (iii) energy/environmental impacts. A new adaptation of the Clarke and Wright Savings Algorithm is subsequently presented to create collection rounds that leverage each mode’s strengths. Subsequently, routes are compiled into workable fixed shifts using a modified bin-packing algorithm in each iteration.</div><div>The approach of this study is based on a case study of the UK’s National Health Service (NHS), involving the collection of pathology samples using traditional vans operating within fixed time slots. Using case study data from the Solent region (England), a novel test instance generation methodology was also developed, whereby realistic site positioning and origin-destination travel data are captured to enable effective algorithm experimentation. The findings from applying the proposed algorithm to a set of test instances based on this methodology are subsequently discussed, where it was found that the adapted savings and bin-packing approach produced effective solutions quickly, with 90% of all large instances (200 sites) being solved within 15 min. Further algorithm developments and the application of the devised problem/methodologies are also discussed.</div></div>","PeriodicalId":100933,"journal":{"name":"Multimodal Transportation","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An adapted savings algorithm for planning heterogeneous logistics with uncrewed aerial vehicles\",\"authors\":\"Andy Oakey ,&nbsp;Antonio Martinez-Sykora ,&nbsp;Tom Cherrett\",\"doi\":\"10.1016/j.multra.2024.100170\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>This paper proposes a new extension to the Sustainable Specimen Collection Problem (SSCP), where medical specimens are transported by vans, bikes, and uncrewed aerial vehicles (UAVs, or drones) from local medical practices/offices to a central hospital laboratory for analysis, employing a two-echelon collection approach. Time restrictions from existing operations and literature are also introduced, with the study being formulated as a weighted multi-objective problem seeking to minimise (i) operating costs; (ii) transit times; and (iii) energy/environmental impacts. A new adaptation of the Clarke and Wright Savings Algorithm is subsequently presented to create collection rounds that leverage each mode’s strengths. Subsequently, routes are compiled into workable fixed shifts using a modified bin-packing algorithm in each iteration.</div><div>The approach of this study is based on a case study of the UK’s National Health Service (NHS), involving the collection of pathology samples using traditional vans operating within fixed time slots. Using case study data from the Solent region (England), a novel test instance generation methodology was also developed, whereby realistic site positioning and origin-destination travel data are captured to enable effective algorithm experimentation. The findings from applying the proposed algorithm to a set of test instances based on this methodology are subsequently discussed, where it was found that the adapted savings and bin-packing approach produced effective solutions quickly, with 90% of all large instances (200 sites) being solved within 15 min. Further algorithm developments and the application of the devised problem/methodologies are also discussed.</div></div>\",\"PeriodicalId\":100933,\"journal\":{\"name\":\"Multimodal Transportation\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Multimodal Transportation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2772586324000510\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Multimodal Transportation","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2772586324000510","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文对可持续标本采集问题(Sustainable Specimen Collection Problem,SSCP)提出了一个新的扩展,即采用双梯队采集方法,用货车、自行车和无人驾驶飞行器(UAV 或无人机)将医疗标本从当地医疗机构/办公室运送到医院中心实验室进行分析。研究还引入了现有操作和文献中的时间限制,并将其表述为一个加权多目标问题,以寻求最大限度地降低 (i) 运营成本;(ii) 运输时间;(iii) 能源/环境影响。随后,对克拉克和莱特节约算法进行了新的调整,以创建充分利用每种模式优势的收集轮。本研究的方法基于英国国家医疗服务系统(NHS)的一个案例研究,涉及在固定时段内使用传统货车收集病理样本。利用索伦特地区(英格兰)的案例研究数据,还开发了一种新颖的测试实例生成方法,通过该方法可获取真实的站点定位和出发地-目的地旅行数据,从而进行有效的算法实验。随后讨论了基于该方法将所提出的算法应用于一组测试实例的结果,结果发现,经过调整的节省和分仓打包方法能够快速产生有效的解决方案,所有大型实例(200 个站点)中的 90% 都能在 15 分钟内解决。此外,还讨论了算法的进一步发展和所设计问题/方法的应用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An adapted savings algorithm for planning heterogeneous logistics with uncrewed aerial vehicles
This paper proposes a new extension to the Sustainable Specimen Collection Problem (SSCP), where medical specimens are transported by vans, bikes, and uncrewed aerial vehicles (UAVs, or drones) from local medical practices/offices to a central hospital laboratory for analysis, employing a two-echelon collection approach. Time restrictions from existing operations and literature are also introduced, with the study being formulated as a weighted multi-objective problem seeking to minimise (i) operating costs; (ii) transit times; and (iii) energy/environmental impacts. A new adaptation of the Clarke and Wright Savings Algorithm is subsequently presented to create collection rounds that leverage each mode’s strengths. Subsequently, routes are compiled into workable fixed shifts using a modified bin-packing algorithm in each iteration.
The approach of this study is based on a case study of the UK’s National Health Service (NHS), involving the collection of pathology samples using traditional vans operating within fixed time slots. Using case study data from the Solent region (England), a novel test instance generation methodology was also developed, whereby realistic site positioning and origin-destination travel data are captured to enable effective algorithm experimentation. The findings from applying the proposed algorithm to a set of test instances based on this methodology are subsequently discussed, where it was found that the adapted savings and bin-packing approach produced effective solutions quickly, with 90% of all large instances (200 sites) being solved within 15 min. Further algorithm developments and the application of the devised problem/methodologies are also discussed.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
5.10
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信