Modified edge recombination operators of genetic algorithms for the traveling salesman problem

This paper describes improvements or edge recombination operators,for solving the traveling salesman problem using a genetic algorithm. The proposed operators were embedded to the GENITOR program to compare with other crossovers. The method was evaluated on a number of well-known benchmarks, e.g. gr96.tsp, d198.tsp, and pcb442.tsp in the TSPLIB. Experimental results show that the modified edge recombination operators have lower,failure rates arid are superior to the conventional edge recombination operators, especially in larger problems. Moreover, they outperform other conventional crossovers in all tested problems