Improving Lin-Kernighan-Helsgaun with Crossover on Clustered Instances of the TSP
暂无分享,去创建一个
[1] David S. Johnson,et al. The Traveling Salesman Problem: A Case Study in Local Optimization , 2008 .
[2] A. Mobius,et al. COMBINATORIAL OPTIMIZATION BY ITERATIVE PARTIAL TRANSCRIPTION , 1999, cond-mat/9902034.
[3] Helena Ramalhinho Dias Lourenço,et al. Iterated Local Search , 2001, Handbook of Metaheuristics.
[4] Doug Hains,et al. A Hybrid Genetic Algorithm for the Traveling Salesman Problem Using Generalized Partition Crossover , 2010, PPSN.
[5] J. K. Lenstra,et al. Local Search in Combinatorial Optimisation. , 1997 .
[6] Robert Schaefer. Parallel Problem Solving from Nature - PPSN XI, 11th International Conference, Kraków, Poland, September 11-15, 2010. Proceedings, Part II , 2010, PPSN.
[7] Doug Hains,et al. Tunneling between optima: partition crossover for the traveling salesman problem , 2009, GECCO.
[8] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..
[9] D. Corneil,et al. Efficient cluster compensation for lin-kernighan heuristics , 1999 .
[10] Keld Helsgaun,et al. General k-opt submoves for the Lin–Kernighan TSP heuristic , 2009, Math. Program. Comput..
[11] William J. Cook,et al. Chained Lin-Kernighan for Large Traveling Salesman Problems , 2003, INFORMS Journal on Computing.
[12] Christos H. Papadimitriou,et al. The Complexity of the Lin-Kernighan Heuristic for the Traveling Salesman Problem , 1992, SIAM J. Comput..