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