We investigate an inventory-routing problem (IRP) with collaborative truck-and-drone delivery. The goal is to design a collaborative delivery schedule involving both trucks and drones to optimize transportation and holding costs. The problem is formulated as a mixed integer program which is solved via branch-and-cut. A novel heuristic is proposed based on the solution of the droneless IRP, which is easier to solve. Computational experiments demonstrate the performance of the branch-and-cut algorithm as well as the heuristic. Lien vers l'article
NAJY, W., ARCHETTI, C. and DIABAT, A. (2023). Collaborative Truck-and-Drone Delivery for Inventory-Routing Problems. Transportation Research Part C: Emerging Technologies, 146, pp. 103791.