A genetic algorithm for the Dubins Traveling Salesman Problem
Xin Ye Yu, John Y. Hung · 2012
In this paper the authors study the Traveling Salesman Problem for the Dubins vehicle (DTSP). A genetic algorithm is designed to find the shortest path for DTSP and the performance is evaluated in numerical study. The proposed algorithm can perform better than the well-known Alternating Algorithm and Random Headings Algorithm, in both low waypoint density and high waypoint density situations.