DocumentCode
2586826
Title
A genetic algorithm for the Dubins Traveling Salesman Problem
Author
Yu, Xin ; Hung, John Y.
Author_Institution
Electr. & Comput. Eng., Auburn Univ., Auburn, AL, USA
fYear
2012
fDate
28-31 May 2012
Firstpage
1256
Lastpage
1261
Abstract
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.
Keywords
genetic algorithms; road vehicles; travelling salesman problems; DTSP; Dubins traveling salesman problem; Dubins vehicle; alternating algorithm; genetic algorithm; random heading algorithm; waypoint density; Algorithm design and analysis; Genetic algorithms; Robots; Traveling salesman problems; Turning; Vehicles; Wheels;
fLanguage
English
Publisher
ieee
Conference_Titel
Industrial Electronics (ISIE), 2012 IEEE International Symposium on
Conference_Location
Hangzhou
ISSN
2163-5137
Print_ISBN
978-1-4673-0159-6
Electronic_ISBN
2163-5137
Type
conf
DOI
10.1109/ISIE.2012.6237270
Filename
6237270
Link To Document