Genetic Algorithm For The Travelling Salesman Problem using Enhanced Sequential Constructive Crossover Operator

, and . International Journal of Computer Science and Security (IJCSS) 11 (3): 42-52 (June 2017)


Traveling Salesman Problem (TSP) is one of the most important combinatorial optimization problems. There are many researches to improve the genetic algorithm for solving TSP. The Sequential Constructive crossover (SCX) is one of the most efficient crossover operators for solving optimization problems. In this paper, we propose a new crossover operator, named Enhanced Sequential Constructive crossover operator (ESCX), which modifies and improves the criteria of SCX operator in construction of offspring. ESCX considers, in addition to the real cost of the traversed cities, an estimation cost of the remaining tour, and it selects the next node to build the offspring based on that evaluation. The experimental results comparing the proposed crossover operator to the SCX operator on some benchmark TSPLIB instances show the effectiveness of our proposed operator.

Links and resources

BibTeX key:
search on:

Comments and Reviews  

There is no review or comment yet. You can write one!


Cite this publication