A decomposition-based iterative optimization algorithm for traveling salesman problem with drone

• Published in: Transportation research. Part C, Emerging technologies Vol. 91; pp. 249 - 262
• Main Authors: Es Yurek, Emine, Ozmutlu, H. Cenk
• Format: Journal Article
• Language: English
• Published: Elsevier Ltd 01.06.2018
• Subjects: Decomposition; Drone; Drone delivery; Iterative algorithm; MIP; TSP; TSP; Iterative algorithm; Decomposition; Drone; MIP; Drone delivery
• ISSN: 0968-090X; 1879-2359
• DOI: 10.1016/j.trc.2018.04.009

•An iterative algorithm is developed by decomposing the TSP-D into two stages.•We can solve the uniform instances with 12 customers within 15 min on average.•We propose an optimization based heuristic to solve the problems with 20 customers. This study investigates a new delivery problem that has emerged after the attempts of several e-commerce and logistics firms to deploy drones in their operations to increase efficiency and reduce delivery times. In this problem, a delivery truck that carries a drone on its roof serves customers in coordination with a drone. The drone is considered to complement the truck due to its cost-efficiency and ability to access difficult terrains and to travel without exposure to congestion. This study presents an iterative algorithm that is based on a decomposition approach to minimize delivery completion time. In the first stage of the proposed methodology, the truck route and the customers assigned to the drone are determined. In the second stage, a mixed-integer linear programming model is solved to optimize the drone route by fixing the routing and the assignment decisions that are made in the first stage. Beginning with the shortest truck route, the assignment and the routing decisions are iteratively improved. The solution times of our algorithm are compared with the solution times of the state-of-the-art formulations that are solved by CPLEX. The results demonstrate that our algorithm yields shorter solution times for the instances that we generated with the specified parameters. An optimization-based heuristic algorithm, which obtains solutions for medium-sized instances, is developed by reducing the feasible search area.