A Powerful Genetic Algorithm Using Edge Assembly Crossover for the Traveling Salesman Problem

References

• Applegate D, Cook W, Rohe A. Chained Lin-Kernighan for large traveling salesman problems. INFORMS J. Comput. (2003) 15(1):82–92Link, Google Scholar
• Bixby RE, Cook W, Espinoza DG, Groycoolea M, Helsgaun K. Certification of an optimal TSP tour through 85,900 cities. Oper. Res. Lett. (2009) 37(1):11–15Crossref, Google Scholar
• Boese KD, Kahng AB, Muddu S. A new adaptive multi-start technique for combinatorial global optimizations. Oper. Res. Lett. (1994) 16(2):101–113Crossref, Google Scholar
• Cook W, Seymour P. Tour merging via branch-decomposition. INFORMS J. Comput. (2003) 15(3):233–248Link, Google Scholar
• Dong C, Jäger G, Richter D, Molitor P. Effective tour searching for TSP by contraction of pseudo backbone edges. Proc. 5th Internat. Conf. Algorithmic Aspects Inform. Management (2009) (Springer, Berlin, Heidelberg) 175–187Lecture Notes in Computer Science, Vol. 5564Crossref, Google Scholar
• Fredman M, Johnson D, McGeoch L, Ostheimer G. Data structures for traveling salesman. J. Algorithms (2005) 18(3):432–479Crossref, Google Scholar
• Freisleben B, Merz P. New genetic local search operators for the traveling salesman problem. Proc. 6th Internat. Conf. Parallel Problem Solving from Nature (1996) (Springer, Berlin, Heidelberg) 890–899Lecture Notes in Computer Science, Vol. 1141Crossref, Google Scholar
• Goldberg D, Lingle R. Allels, loci and the traveling salesman problem. Proc. 1st Internat. Conf. Genetic Algorithms (1985) (Lawrence Erlbaum, Pittsburgh) 154–159Google Scholar
• Grefenstette JJ, Gopal R, Rosmaita BJ, Gucht DV. Genetic algorithms for the traveling salesman problem. Proc. 1st Internat. Conf. Genetic Algorithms (1985) (Lawrence Erlbaum, Pittsburgh) 160–168Google Scholar
• Helsgaun K. An effective implementation of the Lin-Kernighan traveling salesman heuristic. Eur. J. Oper. Res. (2000) 126(1):106–130Crossref, Google Scholar
• Helsgaun K. An effective implementation of k-opt moves for the Lin-Kernighan TSP heuristic. Datalogiske Skrifter (Writings on Computer Science) (2006) 109(Roskilde University, Roskilde, Denmark) Google Scholar
• Helsgaun K. General k-opt submoves for the Lin–Kernighan TSP heuristic. Math. Programming Comput. (2009) 1(2):119–163Crossref, Google Scholar
• Johnson DS, McGeoch LA, Aarts EHL, Lenstra JK. The traveling salesman problem: A case study in local optimization. Local Search in Combinatorial Optimization (1997) (John Wiley and Sons, London) 215–310Google Scholar
• Lin S, Kernighan BW. An effective heuristic algorithm for the traveling salesman problem. Oper. Res. (1973) 21(2):498–516Link, Google Scholar
• Maekawa K, Mori N, Tamaki H, Kita H, Nishikawa Y. A genetic solution for the traveling salesman problem by means of a thermodynamical selection rule. Proc. 1996 IEEE Conf. Evolutionary Comput. (ICEC '96) (1996) 529–534Crossref, Google Scholar
• Martin O, Otto SW, Felten EW. Large-step Markov chains for the traveling salesman problem. Complex Systems (1991) 5(3):299–326Google Scholar
• Mathias K, Whitley D. Genetic operators, the fitness landscape and the traveling salesman problem. Proc. 2nd Internat. Conf. Parallel Problem Solving from Nature (1992) (Springer, Berlin, Heidelberg) 219–228Lecture Notes in Computer Science, Vol. 866Google Scholar
• Merz P, Freisleben B. Genetic local search for the TSP: New results. Proc. 1997 IEEE Internat. Conf. Evolutionary Comput. (ICEC '97) (1997) 159–164Crossref, Google Scholar
• Nagata Y. Fast EAX algorithm considering population diversity for traveling salesman problems. Proc. 6th Internat. Conf. Evolutionary Comput. Combinatorial Optim. (2006a) (Springer, Berlin, Heidelberg) 171–182Lecture Notes in Computer Science, Vol. 3906Crossref, Google Scholar
• Nagata Y. New EAX crossover for large TSP instances. Proc. 9th Internat. Conf. Parallel Problem Solving from Nature (2006b) (Springer, Berlin, Heidelberg) 372–381Lecture Notes in Computer Science, Vol. 4193Crossref, Google Scholar
• Nagata Y, Kobayashi S. Edge assembly crossover: A high-power genetic algorithm for the traveling salesman problem. Proc. 7th Internat. Conf. Genetic Algorithms (1997) (Morgan Kaufmann, San Francisco) 450–457Google Scholar
• Nguyen HD, Yoshihara I, Yamamori K, Yasunaga M. Implementation of an effective hybrid GA for large-scale traveling salesman problems. IEEE Trans. Systems, Man, and Cybernetics, Part B (2007) 37(1):92–99Crossref, Google Scholar
• Tsai HK, Yang JM, Tsai YF, Kao CY. An evolutionary algorithm for large traveling salesman problems. IEEE Trans. Systems, Man, Cybernetics, Part B (2004) 34(4):1718–1729Crossref, Google Scholar
• Ulder N, Aarts E, Bandelt HJ, van Laarhoven P, Pesch E. Genetic local search algorithms for the traveling salesman problem. Proc. 1st Internat. Conf. Parallel Problem Solving from Nature (1991) (Springer, Berlin, Heidelberg) 109–116Lecture Notes in Computer Science, Vol. 496Crossref, Google Scholar
• Walshaw C. A multilevel approach to the travelling salesman problem. Oper. Res. (2002) 50(5):862–877Link, Google Scholar
• Whitley D, Hains D, Howe A. A hybrid genetic algorithm for the traveling salesman problem using generalized partition crossover. Proc. 11th Internat. Conf. Parallel Problem Solving from Nature (2010) (Springer, Berlin, Heidelberg) 566–575Lecture Notes in Computer Science, Vol. 6323Crossref, Google Scholar
• Whitley D, Starkweather T, Fuquay D. Scheduling problems and traveling salesman: The genetic edge recombination. Proc. 3rd Internat. Conf. Genetic Algorithms (1989) (Morgan Kaufmann, San Francisco) 133–140Google Scholar
• Yamamura M, Ono I, Kobayashi S. Emergent search on double circle TSPs using subtour exchange crossover. Proc. 1996 IEEE Internat. Conf. Evolutionary Comput. (ICEC '96) (1996) 535–540Crossref, Google Scholar