DocumentCode :
3210447
Title :
A perspective view on Travelling Salesman Problem using genetic algorithm
Author :
Geetha, R.R. ; Bouvanasilan, Nishaa ; Seenuvasan, Vasumathy
Author_Institution :
Dept. of Inf. Technol., Pondicherry Univ., Pondicherry, India
fYear :
2009
fDate :
9-11 Dec. 2009
Firstpage :
356
Lastpage :
361
Abstract :
The travelling salesman problem (TSP) is one of the extensively studied optimization problem. The numerous direct applications of the TSP bring life to the research area and help to direct future work. To solve this problem many techniques have been developed. Genetic algorithm is one among those which solves this problem by using the processes observed in natural evolution to solve various optimizations and search problems. This paper presents a complete survey on genetic algorithm techniques proposed by researchers for solving travelling salesman problem.
Keywords :
genetic algorithms; travelling salesman problems; genetic algorithm; natural evolution; optimization problem; travelling salesman problem; Biological cells; Cities and towns; Educational institutions; Encoding; Genetic algorithms; Genetic mutations; Information technology; Linear programming; Search problems; Traveling salesman problems; Genetic Algorithm; Travelling Salesman Problem;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Nature & Biologically Inspired Computing, 2009. NaBIC 2009. World Congress on
Conference_Location :
Coimbatore
Print_ISBN :
978-1-4244-5053-4
Type :
conf
DOI :
10.1109/NABIC.2009.5393321
Filename :
5393321
Link To Document :
بازگشت