New Variations of Order Crossover for Travelling Salesman Problem

Davis presented the order crossover operator for solving the travelling salesman problem (TSP) using genetic algorithm and has described two basic variants of this order crossover operator. In order to improve the efficiency and validity of these variants, in this paper three new variations of the order crossover operator are presented. These are programmed in C++ and implemented on a set of benchmark test problems taken from TSPLIB.The analysis of results based on the numerical and graphical analysis indicated that the new variations of the order crossover proposed in this paper have a definite supremacy over the existing variants for TSP with number of cities less than or equal to 100 as well as greater than 100 for some instances.