IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v72y2021i2p398-416.html
   My bibliography  Save this article

Parcel delivery by vehicle and drone

Author

Listed:
  • Amro M. El-Adle
  • Ahmed Ghoniem
  • Mohamed Haouari

Abstract

We investigate a single-vehicle parcel delivery problem in which customers may be served either by the vehicle or by a portable companion drone launched from the vehicle. The problem may be viewed as a Traveling Salesman Problem with Drone (TSP-D), and is modelled as a 0-1 mixed-integer program (MIP) that synchronizes vehicle and drone operations with the objective of minimizing the duration of the joint tour. Using a combination of valid inequalities, pre-processing, and other bound tightening strategies, we enhance the tractability of the proposed MIP formulation.

Suggested Citation

  • Amro M. El-Adle & Ahmed Ghoniem & Mohamed Haouari, 2021. "Parcel delivery by vehicle and drone," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 72(2), pages 398-416, February.
    • Handle: RePEc:taf:tjorxx:v:72:y:2021:i:2:p:398-416
    DOI: 10.1080/01605682.2019.1671156
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2019.1671156
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2019.1671156?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ren, Xuan & Froger, Aurélien & Jabali, Ola & Liang, Gongqian, 2024. "A competitive heuristic algorithm for vehicle routing problems with drones," European Journal of Operational Research, Elsevier, vol. 318(2), pages 469-485.
    2. Zhou, Hang & Qin, Hu & Cheng, Chun & Rousseau, Louis-Martin, 2023. "An exact algorithm for the two-echelon vehicle routing problem with drones," Transportation Research Part B: Methodological, Elsevier, vol. 168(C), pages 124-150.
    3. Morandi, Nicola & Leus, Roel & Matuschke, Jannik & Yaman, Hande, 2023. "The traveling salesman problem with drones: The benefits of retraversing the arcs," Other publications TiSEM 09f54df0-875e-40af-a43d-5, Tilburg University, School of Economics and Management.
    4. Dell’Amico, Mauro & Montemanni, Roberto & Novellani, Stefano, 2021. "Algorithms based on branch and bound for the flying sidekick traveling salesman problem," Omega, Elsevier, vol. 104(C).
    5. Fernanda Alves de Araújo & João Gilberto Mendes dos Reis & Marcia Terra da Silva & Emel Aktas, 2022. "A Fuzzy Analytic Hierarchy Process Model to Evaluate Logistics Service Expectations and Delivery Methods in Last-Mile Delivery in Brazil," Sustainability, MDPI, vol. 14(10), pages 1-18, May.
    6. Morandi, Nicola & Leus, Roel & Yaman, Hande, 2024. "The orienteering problem with drones," Other publications TiSEM 593f31f0-7b7b-4069-84ca-8, Tilburg University, School of Economics and Management.
    7. Tiniç, Gizem Ozbaygin & Karasan, Oya E. & Kara, Bahar Y. & Campbell, James F. & Ozel, Aysu, 2023. "Exact solution approaches for the minimum total cost traveling salesman problem with multiple drones," Transportation Research Part B: Methodological, Elsevier, vol. 168(C), pages 81-123.
    8. Zhu, Waiming & Hu, Xiaoxuan & Pei, Jun & Pardalos, Panos M., 2024. "Minimizing the total travel distance for the locker-based drone delivery: A branch-and-cut-based method," Transportation Research Part B: Methodological, Elsevier, vol. 184(C).

    More about this item

    Statistics

    Access and download statistics

    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:taf:tjorxx:v:72:y:2021:i:2:p:398-416. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.