Improving EAX with restricted 2-opt

Edge Assembly Crossover (EAX) is by far the most successful crossover operator in solving the traveling salesman problem (TSP) with Genetic Algorithms (GAs). Various improvements have been proposed for EAX in GA. However, some of the improvements have to make compromises between performance and solution quality. In this work, we have combined several improvements proposed in the past, including heterogeneous pair selection (HpS), iterative child generation (ICG), and 2-opt. We also incorporate 2-opt into EAX, and restricted the 2-opt local searches to sub-tours in the intermediates generated by EAX. Our proposed method can improve the performance of EAX with decreased number of generations, error rates, and computation time. The applications of conventional 2-opt and our restricted 2opt concurrently have additive effect on the performance gain, and this performance improvement is more obvious in larger problems. The proposed method also enhanced the solution quality of EAX. The signif...

• Type: Conference
• Year: 2005
• Where: GECCO
• Authors: Chen-hsiung Chan, Sheng-An Lee, Cheng-Yan Kao, Huai-Kuang Tsai
• Keywords: Edge Assembly Crossover, GECCO 2005, Genetic Algorithms, Traveling Salesman Problem