A truck and drones model for last-mile delivery: A mathematical model and heuristic approach

Abstract We present a mathematical formulation and a heuristic solution approach for the optimal planning of delivery routes in a multi-modal system combining truck and Unmanned Aerial Vehicle (UAV) operations. In this system, truck and UAV operations are synchronized, i.e., one or more UAVs travel on a truck, which serves as a mobile depot. Deliveries can be made by both UAVs and the truck. While the truck follows a multi-stop route, each UAV delivers a single shipment per dispatch. The presented optimization model minimizes the waiting time of customers in the system. The model determines the optimal allocation of customers to truck and UAVs, the optimal route sequence of the truck, and the optimal launch and reconvene locations of the UAVs along the truck route. We formulate the problem as a Mixed-Integer Linear Programming (MILP) model and conduct a bound analysis to gauge the maximum potential of the proposed system to reduce customer waiting time compared to a traditional truck-only delivery system. To be able to solve real-world problem size instances, we propose an efficient Truck and Drone Routing Algorithm (TDRA). The solution quality and computational performance of the mathematical model and the TDRA are compared together and with the truck-only model based on a variety of problem instances. Further, we apply the TDRA to a real-world case study for e-commerce delivery in Sao Paulo, Brazil. Our numerical results suggest significant reductions in customer waiting time to be gained from the proposed multi-modal delivery model.

[1]  Yves Crama,et al.  Simulated annealing for complex portfolio selection problems , 2003, Eur. J. Oper. Res..

[2]  Ann Melissa Campbell,et al.  Routing for Relief Efforts , 2008, Transp. Sci..

[3]  Hiroshi Nagamochi,et al.  Routing of Carrier-vehicle Systems with Dedicated Last-stretch Delivery Vehicle and Fixed Carrier Route , 2017, J. Inf. Process..

[4]  Thibaut Vidal,et al.  A simple and effective metaheuristic for the Minimum Latency Problem , 2012, Eur. J. Oper. Res..

[5]  Mohammad Marufuzzaman,et al.  Drones for disaster response and relief operations: A continuous approximation model , 2017 .

[6]  Gilbert Laporte,et al.  Thirty years of heterogeneous vehicle routing , 2016, Eur. J. Oper. Res..

[7]  Nenad Bjelic,et al.  Variable neighborhood search algorithm for heterogeneous traveling repairmen problem with time windows , 2013, Expert Syst. Appl..

[8]  M. M. Flood The Traveling-Salesman Problem , 1956 .

[9]  Jon M. Kleinberg,et al.  An improved approximation ratio for the minimum latency problem , 1996, SODA '96.

[10]  Edward P. K. Tsang,et al.  Guided local search and its application to the traveling salesman problem , 1999, Eur. J. Oper. Res..

[11]  Juan Zhang,et al.  Strategic Design for Delivery with Trucks and Drones , 2017 .

[12]  Inge Norstad,et al.  Benchmark Suite for Industrial and Tramp Ship Routing and Scheduling Problems , 2014, INFOR Inf. Syst. Oper. Res..

[13]  Stefan Spinler,et al.  Enabling Urban Logistics Services at La Poste through Multi-Echelon Location-Routing , 2016, Transp. Sci..

[14]  Bruce L. Golden,et al.  Optimization approaches for civil applications of unmanned aerial vehicles (UAVs) or aerial drones: A survey , 2018, Networks.

[15]  H. C. Ozmutlu,et al.  A decomposition-based iterative optimization algorithm for traveling salesman problem with drone , 2018, Transportation Research Part C: Emerging Technologies.

[16]  W. Gander,et al.  Least-squares fitting of circles and ellipses , 1994 .

[17]  T. Crainic,et al.  ADVANCED FREIGHT TRANSPORTATION SYSTEMS FOR CONGESTED URBAN AREAS , 2004 .

[18]  Nenad Mladenovic,et al.  Variable neighborhood search for the travelling deliveryman problem , 2011, 4OR.

[19]  Christian Prins,et al.  An effective memetic algorithm for the cumulative capacitated vehicle routing problem , 2010, Comput. Oper. Res..

[20]  Marie Schmidt,et al.  Optimization Approaches for the Traveling Salesman Problem with Drone , 2016, Transp. Sci..

[21]  Nils Boysen,et al.  Drone delivery from trucks: Drone scheduling for given truck routes , 2018, Networks.

[22]  Hyun Jung Lee,et al.  Optimal delivery routing with wider drone-delivery areas along a shorter truck-route , 2018, Expert Syst. Appl..

[23]  Seokcheon Lee,et al.  The Latency Location-Routing Problem , 2016, Eur. J. Oper. Res..

[24]  Peter Goos,et al.  Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem , 2011, 4OR.

[25]  John N. Tsitsiklis,et al.  Special cases of traveling salesman and repairman problems with time windows , 1992, Networks.

[26]  Marc Goetschalckx,et al.  A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts , 2019 .

[27]  Stefan Spinler,et al.  Strategic Redesign of Urban Mail and Parcel Networks at La Poste , 2016, Interfaces.

[28]  John Gunnar Carlsson,et al.  Coordinated Logistics with a Truck and a Drone , 2018, Manag. Sci..

[29]  Gilbert Laporte,et al.  Two exact algorithms for the distance-constrained vehicle routing problem , 1984, Networks.

[30]  Yves Deville,et al.  On the Min-cost Traveling Salesman Problem with Drone , 2015, ArXiv.

[31]  Seokcheon Lee,et al.  The customer-centric, multi-commodity vehicle routing problem with split delivery , 2016, Expert Syst. Appl..

[32]  R. Goodman Whatever you call it, just don't think of last-mile logistics, last , 2005 .

[33]  Christian Prins,et al.  Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem , 2016, Eur. J. Oper. Res..

[34]  Bruce L. Golden,et al.  The vehicle routing problem with drones: several worst-case results , 2017, Optim. Lett..

[35]  Madjid Tavana,et al.  Drone shipping versus truck delivery in a cross-docking system with multiple fleets and products , 2017, Expert Syst. Appl..

[36]  Gerhard Reinelt,et al.  Traveling salesman problem , 2012 .

[37]  Francisco Ángel-Bello,et al.  Two improved formulations for the minimum latency problem , 2013 .

[38]  David Pisinger,et al.  An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..

[39]  Nicos Christofides,et al.  The vehicle routing problem , 1976, Revue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle.

[40]  George Papageorgiou,et al.  The Complexity of the Travelling Repairman Problem , 1986, RAIRO Theor. Informatics Appl..

[41]  Madhu Sudan,et al.  The minimum latency problem , 1994, STOC '94.

[42]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[43]  Murat Karakaya,et al.  Efficient route planning for an unmanned air vehicle deployed on a moving carrier , 2016, Soft Comput..

[44]  Andy M. Ham,et al.  Integrated scheduling of m-truck, m-drone, and m-depot constrained by time-window, drop-pickup, and m-visit using constraint programming , 2018, Transportation Research Part C: Emerging Technologies.

[45]  Marie Schmidt,et al.  Dynamic programming approaches for the traveling salesman problem with drone , 2017, Networks.

[46]  Mario Ventresca,et al.  Multiple traveling salesman problem with drones: Mathematical model and heuristic approach , 2019, Comput. Ind. Eng..

[47]  Chase C. Murray,et al.  The flying sidekick traveling salesman problem: Optimization of drone-assisted parcel delivery , 2015 .

[48]  Johanna C. Gerdessen,et al.  Vehicle routing problem with trailers , 1996 .