[1]APPLEGATE D L, BIXBY R E, CHVáTAL V, et al. The traveling salesman problem: A computational study (Princeton in applied mathematics) [M]. Princeton: Princeton University Press, 2007.
[2]MARTIN O C, OTTO S W, FELTEN E W. Large-step Markov chains for the traveling salesman problem [J]. Complex Systems, 1991, 5(3):299-326.
[3]HELSGAUN K. An effective implementation of the Lin-Kernighan traveling salesman heuristic [J]. European Journal Operation Research, 2000, 126(1):106-130.
[4]WALSHAW C. A multilevel Lin-Kernighan-Helsgaun algorithm for the travelling salesman problem, mathematics research report: 01/IM/80 [R]. London: University of Greenwich, Computing and Mathematical Sciences, 2001.
[5]邹鹏, 周智, 陈国良, 等. 求解TSP问题的多级归约算法[J]. 软件学报,2003,14(1):35-42.
[6]邹鹏,周智,江贺,等. 求解旅行商问题的循环局部搜索算法的运行时间和性能分布分析[J]. 计算机学报, 2006, 29(1):92-99.
[7]王东, 吴湘滨. 提高链式Lin-Kernighan算法性能的策略[J]. JOCA,2007,27(11):2826-2829.
[8]FISCHER T, MERZ P. Reducing the size of traveling salesman problem instances by fixing edges [C]// EvoCOP 07: Seventh European Conference on Evolutionary Computation in Combinatorial Optimisation, LNCS 4446. Berlin: Springer-Verlag, 2007: 72-83.
[9]林冬梅, 王东, 钟勇. 确定TSP全局最优解部分边的蒙特卡罗模型[J].小型微型计算机系统. 2010,31(4):747-751.
[10]BOESE D K. Cost versus distance in the traveling salesman problem, TR-950018 [R]. Los Angeles: University of California, Computer Science Department, 1995.
[11]University of Heidelberg. Traveling salesman problems library [EB/OL]. [2011-04-22]. http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/.
[12]DAVID A, ROBERT B, VASEK C. Concorde network optimization package [CP/OL]. [2011-04-15]. http://www.tsp.gatech.edu/concorde/downloads/codes/src/co031219.tgz. |