By Topic

A New Method Based on Genetic Algorithms for Solving Traveling Salesman Problem

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
$33 $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)
Farshad Frahadnia ; IT Center, Univ. of Tabriz, Tabriz, Iran

This study examines combinations of different binary and unary operators to construct genetic algorithms for solving the traveling salesperson problem. Uniform order-based crossover, heuristic crossover, and edge recombination, are evaluated with inversion and reciprocal exchange mutations. Edge recombination was valuable in converging in the shortest number of generations, and order-based crossover the best performer in frequency of optimum solutions found. The inversion mutation method produced best averages for all populations, but reciprocal exchange performed well in frequency of optimum solutions. For TSP, inversion is actually the less invasive mutation, disrupting at maximum two edges, while reciprocal change can disrupt four edges. This paper explores application of genetic algorithms to TSP by examining combinations of different algorithms for the binary and unary operators used to generate better solutions and minimize the search space. Three binary and two unary operations were tested.

Published in:

2009 International Conference on Computational Intelligence, Modelling and Simulation

Date of Conference:

7-9 Sept. 2009