Fast EAX Algorithm Considering Population Diversity for Traveling Salesman Problems

This paper proposes an evolutionary algorithm (EA) that is applied to the traveling salesman problem (TSP). Existing approximation methods to address the TSP known to be state-of-the-art heuristics almost exclusively utilize Lin-Kernighan local search (LKLS) and its variants. We propose an EA that does not use LKLS, and demonstrate that it is comparable with these heuristics even though it does not use them. The proposed EA uses edge assembly crossover (EAX) that is known to be an efficient and effective crossover for solving TSPs. We first propose a modified EAX algorithm that can be executed more efficiently than the original, which is 2

• Type: Conference
• Year: 2006
• Where: EVOW
• Authors: Yuichi Nagata
• Keywords: Artificial Intelligence, EAX Algorithm, EVOW 2006, Modified Eax Algorithm, Population Diversity