Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/118292
DC FieldValueLanguage
dc.contributorDepartment of Aeronautical and Aviation Engineering-
dc.creatorLi, X-
dc.creatorLyu, M-
dc.creatorLiu, W-
dc.creatorLi, A-
dc.date.accessioned2026-03-31T01:47:56Z-
dc.date.available2026-03-31T01:47:56Z-
dc.identifier.issn2324-9935-
dc.identifier.urihttp://hdl.handle.net/10397/118292-
dc.language.isoenen_US
dc.publisherTaylor & Francisen_US
dc.subjectAdaptive large neighbourhood searchen_US
dc.subjectDrone-assisted deliveryen_US
dc.subjectHealthcare logisticsen_US
dc.subjectMixed-integer linear programmingen_US
dc.subjectReal-time path planningen_US
dc.titleReal-time coordinated vehicle-drone path planning for urban healthcare delivery servicesen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.doi10.1080/23249935.2025.2543488-
dcterms.abstractDrone-assisted delivery applications in healthcare services have been implemented/tested in various cities. To support drone-assisted healthcare delivery applications, this paper examines the real-time path-planning problem for a heterogeneous fleet of drones and trucks, given a set of depots respectively hosting a fleet of parallel-working trucks and drones. We consider both deterministic scheduled demand and dynamic new demand, and optimise the routing and scheduling for the truck-drone fleets in real-time. We introduce a rolling horizon framework, where the demand information and the status of the drones and the trucks are updated at each epoch as new demands emerge. The operator can re-optimise the routing and scheduling of all vehicles (including en-route vehicles) to meet demand as far as possible and save operating cost. To tackle this problem, we develop a mixed-integer linear programming model that allows multi-visit and multi-trip in a journey of a planning horizon for the drones and trucks. The model also considers the decision on service split (among vehicles) at demand sites to address the payload capacity limitation of a single drone or a single truck. A tailored Adaptive Large Neighborhood Search (ALNS) heuristic is then developed to efficiently solve large-scale instances in computationally tractable time. We also conduct a large-scale case study based on Hong Kong blood product delivery instances to showcase the applicability of the proposed approach, as well as the impact of the number of dynamic demands generated in a planning period and their spatial distribution features on the cost outcomes.-
dcterms.accessRightsembargoed accessen_US
dcterms.bibliographicCitationTransportmetrica. A, Transport science, Published online: 11 Aug 2025, Latest Articles, https://doi.org/10.1080/23249935.2025.2543488-
dcterms.isPartOfTransportmetrica. A, Transport science-
dcterms.issued2025-
dc.identifier.scopus2-s2.0-105012864396-
dc.identifier.eissn2324-9943-
dc.description.validate202603 bcjz-
dc.description.oaNot applicableen_US
dc.identifier.SubFormIDG001338/2025-12en_US
dc.description.fundingSourceRGCen_US
dc.description.fundingSourceOthersen_US
dc.description.fundingTextThis research was partly supported by National Natural Science Foundation of China (No. 72301228) and Research Grants Council of Hong Kong through the NSFC/RGC Joint Research Scheme (N PolyU521/22).en_US
dc.description.pubStatusEarly releaseen_US
dc.date.embargo2026-08-11en_US
dc.description.oaCategoryGreen (AAM)en_US
Appears in Collections:Journal/Magazine Article
Open Access Information
Status embargoed access
Embargo End Date 2026-08-11
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.