Typical methods for solving the TSP are mainly exact algorithms, approximation algorithms and heuristics. The exact algorithms may be prohibitive for large instances and the approximation algorithms may suffer from weak optimal guarantees or empirical performance ([1]} [1]}). Heuristics are known to be the most efficient and effective approaches for solving the TSP. Two of the state-of-the-art heuristics are the Lin-Kernighan-Helsgaun (LKH) algorithm ([3]} [3]}) and the Edge Assembly Crossover genetic algorithm (EAX-GA) ([5]} [5]}). Both of them provide best-known solutions on many TSP benchmark instances.
