Tunneling between optima: partition crossover for the traveling salesman problem
暂无分享,去创建一个
[1] M. Padberg,et al. Addendum: Optimization of a 532-city symmetric traveling salesman problem by branch and cut , 1990 .
[2] David E. Goldberg,et al. Alleles, loci and the traveling salesman problem , 1985 .
[3] Kenneth D. Boese,et al. Cost Versus Distance In the Traveling Salesman Problem , 1995 .
[4] Shigenobu Kobayashi,et al. Edge Assembly Crossover: A High-Power Genetic Algorithm for the Travelling Salesman Problem , 1997, ICGA.
[5] David S. Johnson,et al. The Traveling Salesman Problem: A Case Study in Local Optimization , 2008 .
[6] Patrick D. Surry,et al. Fitness Variance of Formae and Performance Prediction , 1994, FOGA.
[7] Eugene L. Lawler,et al. Traveling Salesman Problem , 2016 .
[8] R. K. Shyamasundar,et al. Introduction to algorithms , 1996 .
[9] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[10] David E. Goldberg,et al. AllelesLociand the Traveling Salesman Problem , 1985, ICGA.
[11] Heinz Mühlenbein,et al. Evolution in Time and Space - The Parallel Genetic Algorithm , 1990, FOGA.
[12] L. Darrell Whitley,et al. Genetic Operators, the Fitness Landscape and the Traveling Salesman Problem , 1992, PPSN.
[13] L. D. Whitley,et al. The Traveling Salesman and Sequence Scheduling : , 1990 .
[14] D. J. Smith,et al. A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.
[15] Nicholas J. Radcliffe,et al. The algebra of genetic algorithms , 1994, Annals of Mathematics and Artificial Intelligence.