Revisiting the big valley search space structure in the TSP
暂无分享,去创建一个
[1] Forschungsinstitut für Diskrete. Chained Lin-Kernighan for Large Traveling Salesman Problems , 2003 .
[2] David S. Johnson,et al. The Traveling Salesman Problem: A Case Study in Local Optimization , 2008 .
[3] Bernd Freisleben,et al. A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.
[4] Andrew B. Kahng,et al. A new adaptive multi-start technique for combinatorial global optimizations , 1994, Oper. Res. Lett..
[5] Keld Helsgaun,et al. An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..
[6] William J. Cook,et al. The Traveling Salesman Problem: A Computational Study , 2007 .
[7] Weixiong Zhang,et al. A Novel Local Search Algorithm for the Traveling Salesman Problem that Exploits Backbones , 2005, IJCAI.
[8] Doug Hains,et al. A Hybrid Genetic Algorithm for the Traveling Salesman Problem Using Generalized Partition Crossover , 2010, PPSN.
[9] David S. Johnson,et al. Local Optimization and the Traveling Salesman Problem , 1990, ICALP.
[10] Doug Hains,et al. Tunneling between optima: partition crossover for the traveling salesman problem , 2009, GECCO.
[11] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..
[12] J. Doye,et al. THE DOUBLE-FUNNEL ENERGY LANDSCAPE OF THE 38-ATOM LENNARD-JONES CLUSTER , 1998, cond-mat/9808265.