IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v55y2023i3p271-287.html
   My bibliography  Save this article

Branch-price-and-cut for trucks and drones cooperative delivery

Author

Listed:
  • Lu Zhen
  • Jiajing Gao
  • Zheyi Tan
  • Shuaian Wang
  • Roberto Baldacci

Abstract

The truck and drone-based cooperative model of delivery can improve the efficiency of last mile delivery, and has thus increasingly attracted attention in academia and from practitioners. In this study, we examine a vehicle routing problem and apply a cooperative form of delivery involving trucks and drones. We propose a mixed-integer programming model and a branch-price-and-cut-based exact algorithm to address this problem. To reduce the computation time, we design several acceleration strategies, including a combination of dynamic programming and calculus-based approximation for the pricing problem, and various effective inequalities for the restricted master problem. Numerical experiments are conducted to validate the effectiveness and efficiency of the proposed solution.

Suggested Citation

  • Lu Zhen & Jiajing Gao & Zheyi Tan & Shuaian Wang & Roberto Baldacci, 2023. "Branch-price-and-cut for trucks and drones cooperative delivery," IISE Transactions, Taylor & Francis Journals, vol. 55(3), pages 271-287, March.
    • Handle: RePEc:taf:uiiexx:v:55:y:2023:i:3:p:271-287
    DOI: 10.1080/24725854.2022.2060535
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/24725854.2022.2060535
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/24725854.2022.2060535?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. Zhen, Lu & Gao, Jiajing & Tan, Zheyi & Laporte, Gilbert & Baldacci, Roberto, 2023. "Territorial design for customers with demand frequency," European Journal of Operational Research, Elsevier, vol. 309(1), pages 82-101.
    2. Deng, Menghua & Li, Yuanbo & Ding, Jianpeng & Zhou, Yanlin & Zhang, Lianming, 2024. "Stochastic and robust truck-and-drone routing problems with deadlines: A Benders decomposition approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 190(C).
    3. Jeanette Schmidt & Christian Tilk & Stefan Irnich, 2023. "Exact Solution of the Vehicle Routing Problem With Drones," Working Papers 2311, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    4. 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.
    5. Yin, Yunqiang & Yang, Yongjian & Yu, Yugang & Wang, Dujuan & Cheng, T.C.E., 2023. "Robust vehicle routing with drones under uncertain demands and truck travel times in humanitarian logistics," Transportation Research Part B: Methodological, Elsevier, vol. 174(C).
    6. Meng, Shanshan & Chen, Yanru & Li, Dong, 2024. "The multi-visit drone-assisted pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 314(2), pages 685-702.

    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:uiiexx:v:55:y:2023:i:3:p:271-287. 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/uiie .

    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.