By Topic

A New Approach to Solve Traveling Salesman Problem Using Genetic Algorithm Based on Heuristic Crossover and Mutation Operator

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

4 Author(s)
Vahdati, G. ; Comput. Dept., Islamic Azad Univ., Mashhad, Iran ; Yaghoubi, M. ; Poostchi, M. ; Naghibi S, M.B.

This paper proposes a new solution for Traveling Salesman Problem (TSP), using genetic algorithm. A heuristic crossover and mutation operation have been proposed to prevent premature convergence. Presented operations try not only to solve this challenge by means of a heuristic function but also considerably accelerate the speed of convergence by reducing excessively the number of generations. By considering TSP's evaluation function, as a traveled route among all n cities, the probability of crossover and mutation have been adaptively and nonlinearly tuned. Experimental results demonstrate that proposed algorithm due to the heuristic performance is not easily getting stuck in local optima and has a reasonable convergent speed to reach the global optimal solution. Besides, implementation of the algorithm does not have any complexities.

Published in:

Soft Computing and Pattern Recognition, 2009. SOCPAR '09. International Conference of

Date of Conference:

4-7 Dec. 2009