Genetic Algorithm to Traveling Salesman Problem

Afshan butt, Vanita Ben Dhagat, Bhanu Pratap Tripathi


In this paper, we apply a genetic algorithm to TSP. Since in TSP, a tour must pass through edges in E' ( E) at least once, it is necessary to involve E' and the information of direction in the chromosome. However, if we use the existing chromosome structure, the length of the chromosome becomes 2 jE0j and the size of the solution space becomes 2jE0j jE0j!. In the previous study, since the chromosome uses two kinds of information (E' and the direction), the results and the time to find a near-optimal solution vary according to the method of applying genetic operators. To resolve these defects, this paper proposes a new structure of chromosome for TSP.

Full Text: PDF
Download the IISTE publication guideline!

To list your conference here. Please contact the administrator of this platform.

Paper submission email:

ISSN (Paper)2224-610X ISSN (Online)2225-0603

Please add our address "" into your email contact list.

This journal follows ISO 9001 management standard and licensed under a Creative Commons Attribution 3.0 License.

Copyright ©