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

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 an...

Full description

Saved in:
Bibliographic Details
Published inIIE transactions Vol. 55; no. 3; pp. 271 - 287
Main Authors Zhen, Lu, Gao, Jiajing, Tan, Zheyi, Wang, Shuaian, Baldacci, Roberto
Format Journal Article
LanguageEnglish
Published Abingdon Taylor & Francis 04.03.2023
Taylor & Francis Ltd
Subjects
Algorithms
branch-price-and-cut
Collaborative delivery
Drone vehicles
drones
Dynamic programming
Integer programming
Mathematical analysis
Mixed integer
route optimization
Route planning
Trucks
Vehicle routing
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2472-5854
2472-5862
DOI:10.1080/24725854.2022.2060535