Data structures for traveling salesmen
SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
Genetic Algorithms for the Traveling Salesman Problem
Proceedings of the 1st International Conference on Genetic Algorithms
AllelesLociand the Traveling Salesman Problem
Proceedings of the 1st International Conference on Genetic Algorithms
Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator
Proceedings of the 3rd International Conference on Genetic Algorithms
Genetic Local Search Algorithms for the Travelling Salesman Problem
PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature
New Genetic Local Search Operators for the Traveling Salesman Problem
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
A Multilevel Approach to the Travelling Salesman Problem
Operations Research
Chained Lin-Kernighan for Large Traveling Salesman Problems
INFORMS Journal on Computing
Tour Merging via Branch-Decomposition
INFORMS Journal on Computing
Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
A hybrid genetic algorithm for the traveling salesman problem using generalized partition crossover
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
New EAX crossover for large TSP instances
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Fast EAX algorithm considering population diversity for traveling salesman problems
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
An evolutionary algorithm for large traveling salesman problems
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Implementation of an Effective Hybrid GA for Large-Scale Traveling Salesman Problems
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Certification of an optimal TSP tour through 85,900 cities
Operations Research Letters
A new adaptive multi-start technique for combinatorial global optimizations
Operations Research Letters
High-Order sequence entropies for measuring population diversity in the traveling salesman problem
EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
Hi-index | 0.00 |
This paper presents a genetic algorithm GA for solving the traveling salesman problem TSP. To construct a powerful GA, we use edge assembly crossover EAX and make substantial enhancements to it: i localization of EAX together with its efficient implementation and ii the use of a local search procedure in EAX to determine good combinations of building blocks of parent solutions for generating even better offspring solutions from very high-quality parent solutions. In addition, we develop iii an innovative selection model for maintaining population diversity at a negligible computational cost. Experimental results on well-studied TSP benchmarks demonstrate that the proposed GA outperforms state-of-the-art heuristic algorithms in finding very high-quality solutions on instances with up to 200,000 cities. In contrast to the state-of-the-art TSP heuristics, which are all based on the Lin--Kernighan LK algorithm, our GA achieves top performance without using an LK-based algorithm.