The EAX-GA algorithm of Yoki Youda

A record of traveling salesman problem (TSP) in a book [1] is actually obtained by genetic algorithm (GA): Yoki Youda (2006) [2] Eax-ga the best route known to the TSP for 100,000 nodes. This is in general think GA in complex large-scale practical problem effect is only "better than nothing" very different, Yong Tian Ga is in the end how to pick the crown of the king?

The introductory part of the article mentions that the most effective approximation methods are based on Lin-kernighan Local Search (LKLS), including the Chained LK algorithm and Helsgaun LKH algorithm. The authors consider that the effective crossover operator design is the key to the performance of evolutionary algorithms, and the previous related methods often combine lkls into the algorithm to improve efficiency, and the Edge Assembly crossover operator (EAX) efficiency proposed by the author is not lost to LKLS system algorithm.

Reference documents

[1] Cook. Wandering Traveler: A ubiquitous computer algorithm problem (Shun Chunning), People's post and Telecommunications press, 2013

[2] Yuichi Nagata (2006). New EAX Crossover for Large TSP Instances, Parallel problem solving from nature-ppsn IX, pp 372-381

The EAX-GA algorithm of Yoki Youda