Journal
JOURNAL OF HEURISTICS
Volume 26, Issue 2, Pages 219-247Publisher
SPRINGER
DOI: 10.1007/s10732-019-09431-y
Keywords
Traveling salesman problem with drone; Metaheuristic; Genetic algorithm; Hybrid approach
Funding
- Vietnam National Foundation for Science and Technology Development (NAFOSTED) [102.99-2016.21]
Ask authors/readers for more resources
This paper addresses the traveling salesman problem with drone (TSP-D), in which a truck and drone are used to deliver parcels to customers. The objective of this problem is to either minimize the total operational cost (min-cost TSP-D) or minimize the completion time for the truck and drone (min-time TSP-D). This problem has gained a lot of attention in the last few years reflecting the recent trends in a new delivery method among logistics companies. To solve the TSP-D, we propose a hybrid genetic search with dynamic population management and adaptive diversity control based on a split algorithm, problem-tailored crossover and local search operators, a new restore method to advance the convergence and an adaptive penalization mechanism to dynamically balance the search between feasible/infeasible solutions. The computational results show that the proposed algorithm outperforms two existing methods in terms of solution quality and improves many best known solutions found in the literature. Moreover, various analyses on the impacts of crossover choice and heuristic components have been conducted to investigate their sensitivity to the performance of our method.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available