Enhanced Traveling Salesman Problem Solving using Genetic Algorithm Technique with modified Sequential Constructive Crossover Operator

摘要

This paper proposes Genetic Algorithm (GA) with a new crossover operator, Modified Sequential constructive crossover (MSCX), to solve the Traveling Salesman Problem (TSP). The proposed algorithm constructs an offspring from a pair of parents using better edges on the basis of their values that may be present in the parents' structure maintaining the sequence of nodes in the parent chromosomes. The results of the proposed algorithm (MSCX) are compared with others GA algorithms which use different crossover operations, MSCX achieve a better solution for TSP.