Improving Lin-Kernighan-Helsgaun with crossover on clustered instances of the TSP

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7492 LNCS, Issue PART 2, 2012, Pages 388-397

  Hains, Doug ^a   Whitley, Darrell ^a   Howe, Adele ^a  

^a Veterinary Dentistry and Oral Surgery   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCH-MARK PROBLEMS; CROSSOVER OPERATOR; LOCAL SEARCH HEURISTICS; NEW SOLUTIONS;

HEURISTIC ALGORITHMS;

TRAVELING SALESMAN PROBLEM;

EID: 84866406407     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-32964-7_39     Document Type: Conference Paper

References (10)

1. Applegate, D., Cook, W., Rohe, A.: Chained Lin-Kernighan for large traveling salesman problems. INFORMS Journal on Computing 15(1), 82-92 (2003)
2. Helsgaun, K.: General k-opt submoves for the Lin-Kernighan TSP heuristic. Mathematical Programming Computation 1(2), 119-163 (2009)
3. Johnson, D.S., Mcgeoch, L.A.: The traveling salesman problem: A case study in local optimization. In: Local Search in Combinatorial Optimization, pp. 215-310. John Wiley and Sons (1997)
4. Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling-salesman problem. Operations Research 21(2), 498-516 (1973), http://dx.doi.org/10.2307/169020
5. Lourenço, H., Martin, O., Stützle, T.: Iterated local search. In: Handbook of Metaheuristics, pp. 320-353 (2003)
6. Möbius, A., Freisleben, B., Merz, P., Schreiber, M.: Combinatorial optimization by iterative partial transcription. Physical Review E 59(4), 4667 (1999)
7. Neto, D.: Efficient cluster compensation for Lin-Kernighan heuristics. Ph.D. thesis, University of Toronto (1999)
8. Papadimitriou, C.: The complexity of the Lin-Kernighan heuristic for the traveling salesman problem. SIAM Journal on Computing 21, 450 (1992)
9. Whitley, D., Hains, D., Howe, A.: Tunneling between optima: partition crossover for the traveling salesman problem. In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation, pp. 915-922. ACM (2009)
10. Whitley, D., Hains, D., Howe, A.: A Hybrid Genetic Algorithm for the Traveling Salesman Problem Using Generalized Partition Crossover. In: Schaefer, R., Cotta, C., Kołodziej, J., Rudolph, G. (eds.) PPSN XI. LNCS, vol. 6238, pp. 566-575. Springer, Heidelberg (2010)