By Topic

An experiment to study wandering salesman applicability on solving the travelling salesman problem based on 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

1 Author(s)
Jafarian, J. ; Dept. of Electr. & Electron. Eng., Univ. of Manchester, Manchester, UK

The Travelling Salesman Problem (TSP) is one of the top problems, which has been addressed extensively by mathematicians and computer scientists. In this paper, we propose two algorithms namely `A' and `B' based on `Wandering Salesman' as an approach trying to find the shortest path from initial steps without taking any restrictions into account. The two proposed algorithms are based on genetic algorithm idea employing the mutation and elitism procedures. Subsequently, we show the performance of the two proposed algorithms in finding the shortest path by depicting the effective parameters. The results indicate that the algorithm `B' which is based on just 0's and 1's probabilities has outstanding performance comparing to the algorithm `A'.

Published in:

Educational and Information Technology (ICEIT), 2010 International Conference on  (Volume:1 )

Date of Conference:

17-19 Sept. 2010