IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v322y2025i3p854-869.html
   My bibliography  Save this article

Truck–drone routing problem with stochastic demand

Author

Listed:
  • Wang, Feilong
  • Li, Hongqi
  • Xiong, Hanxi

Abstract

Truck–drone combination involves launch/retrieval of rotary-wing drones on trucks, which can address the issues of limited endurance and capacity of rotary-wing drones in delivery systems. Truck–drone combination technologies provide a compelling alternative to traditional emergency logistics systems that rely on on-ground transportation networks. Thus far, little research has been conducted on the truck–drone routing variant with stochastic demand, which is closely related to emergency logistics systems. Herein, we formally define the truck–drone routing problem with stochastic demand (TDRP-SD), which involves drones responding quickly to stochastic demands and restocking the supply. In particular, a new restocking policy, termed the truck–drone synchronized (TDS) restocking policy, is introduced to complement the traditional restocking operations that rely on ground vehicles. We analyze the characteristics of the introduced restocking policy and develop several propositions to address the computational burden caused by the dynamic programming computation of the expected cost. We propose a hybrid heuristic that combines the state-of-the-art Slack Induction by String Removals (SISRs) and greedy insertion utilizing blink rules. Several mechanisms, such as short-route deep search, lower-bound and upper-bound guiding, and simulated annealing, are adopted to ensure the algorithm performance. In computational experiments, the hybrid heuristic solves two types of benchmark instances and achieves new solutions. In addition, a collection of converted instances with up to 302 customers is effectively solved. The sensitivity analysis demonstrates the performance of the TDS restocking policy.

Suggested Citation

  • Wang, Feilong & Li, Hongqi & Xiong, Hanxi, 2025. "Truck–drone routing problem with stochastic demand," European Journal of Operational Research, Elsevier, vol. 322(3), pages 854-869.
  • Handle: RePEc:eee:ejores:v:322:y:2025:i:3:p:854-869
    DOI: 10.1016/j.ejor.2024.11.036
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221724009214
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2024.11.036?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:322:y:2025:i:3:p:854-869. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.