Andy Oakey , Antonio Martinez-Sykora , Tom Cherrett
{"title":"An adapted savings algorithm for planning heterogeneous logistics with uncrewed aerial vehicles","authors":"Andy Oakey , Antonio Martinez-Sykora , 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}
引用次数: 0
Abstract
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.