1Johnson DS,McGeoch LA.The Trav- eling Salesman Problem:A Case Study in Local Optimization.Local Search in Combinatorial Optimization. Chichester,New York: John Wiley and Sons, 1997:215-310.
2Keld Helsgaun."An Effective Imple- mentation of K-opt Moves for the Lin-Kernighan TSP Heuristic". Writ- ings on Computer Science. Roskilde University, 2007, Vol. 109 : 225 - 226.
3Gregory Gutin,Daniel KaraDetyan. "Greedy Like Algo-rithms for the Traveling Salesman and Multidimen- sional As-signment Problem".Witold Bednorz(editor). InTech, 2008 : 2.
4Tan K C,Lee T H,Ou K,et al.A messy genetic algorithm for the vehicle routing problem with time window constraints[C]//Proceedings of the 2001 Congress on Evolutionary Computation,2001,1: 679-686.
5Duponcheele G,Tilley D G.Topological optimization of a bumper beam via the messy genetic algorithm[C]//Proceedings of the Institution of Mechanical Engineers,Part D:Journal of Automobile En- gineering, 1998,212(2): 133-144.
