References
- ApplegateDBixbyRChvatalVCookWThe Traveling Salesman Problem: A Computational Study2006
- ApplegateDCookWRoheAChained Lin–Kernighan for large traveling salesman problemsINFORMS J Comput2003151829210.1287/ijoc.15.1.82.15157
- Boese KD, Kahng AB and Muddu S (1993). On the big valley and adaptive multi-start for discrete global optimizations. Technical report, UCLA CS Department, TR-930015.
- BoeseKDKahngABMudduSA new adaptive multi-start technique for combinatorial global optimizationsOpns Res Lett19941610111310.1016/0167-6377(94)90065-5
- DoyeJPKMillerMAWalesDJThe double-funnel energy landscape of the 38-atom Lennard-Jones clusterJ Chem Phys1999110689610.1063/1.478595
- Freisleben B and Merz P (1996). A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems. Proceedings of IEEE International Conference on Evolutionary Computation, pp 616–621, doi:10.1109/ICEC.1996.542671.
- HelsgaunKAn effective implementation of the Lin–Kernighan traveling salesman heuristicEur J Opl Res200012610613010.1016/S0377-2217(99)00284-2
- JohnsonDSLocal optimization and the traveling salesman problemLect Notes Comput Sc199044344646110.1007/BFb0032050
- Johnson DS and McGeoch LA (1997). The traveling salesman problem: A case study in local optimization. Local Search Comb Optim: 215–310.
- LinSKernighanBWAn effective heuristic algorithm for the traveling salesman problemOpns Res19732149851610.1287/opre.21.2.498
- Whitley D, Hains D and Howe A (2009). Tunneling between optima: Partition crossover for the traveling salesman problem. In: Raidl et al (eds) Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation, ACM: NY, pp 915–922.
- Whitley D, Hains D and Howe A (2010). A hybrid genetic algorithm for the traveling salesman problem using generalized partition crossover. In: Rudolph G et al (eds). Proceedings of 11th International Conference on Parallel Problem Solving From Nature (PPSN 2010), Springer: Berlin.
- ZhangWLooksMA novel local search algorithm for the traveling salesman problem that exploits backbonesInt Joint Conf Artif Int200519343