By Topic

A perspective view on Travelling Salesman Problem using genetic algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Geetha, R.R. ; Dept. of Inf. Technol., Pondicherry Univ., Pondicherry, India ; Bouvanasilan, N. ; Seenuvasan, V.

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.

Published in:

Nature & Biologically Inspired Computing, 2009. NaBIC 2009. World Congress on

Date of Conference:

9-11 Dec. 2009