Solving the Traveling Salesman Problem Using the Enhanced Genetic Algorithm
暂无分享,去创建一个
[1] Christos H. Papadimitriou,et al. The Complexity of the Lin-Kernighan Heuristic for the Traveling Salesman Problem , 1992, SIAM J. Comput..
[2] Larry J. Eshelman,et al. The CHC Adaptive Search Algorithm: How to Have Safe Search When Engaging in Nontraditional Genetic Recombination , 1990, FOGA.
[3] Lawrence Davis,et al. Applying Adaptive Algorithms to Epistatic Domains , 1985, IJCAI.
[4] Emile H. L. Aarts,et al. Genetic Local Search Algorithms for the Travelling Salesman Problem , 1990, PPSN.
[5] David E. Goldberg,et al. AllelesLociand the Traveling Salesman Problem , 1985, ICGA.
[6] Dirk Van Gucht,et al. The effects of population size, heuristic crossover and local improvement on a genetic algorithm for the traveling salesman problem , 1989 .
[7] John J. Grefenstette,et al. Genetic Algorithms for the Traveling Salesman Problem , 1985, ICGA.
[8] D. J. Smith,et al. A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.
[9] David E. Goldberg,et al. Alleles, loci and the traveling salesman problem , 1985 .
[10] Howard J. Karloff,et al. New results on the old k-opt algorithm for the TSP , 1994, SODA '94.
[11] Dirk Thierens,et al. Elitist recombination: an integrated selection recombination GA , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.
[12] L. Darrell Whitley,et al. Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator , 1989, International Conference on Genetic Algorithms.
[13] Scott D. Goodwin,et al. Keep-best reproduction: a selection strategy for genetic algorithms , 1998, SAC '98.
[14] L. Darrell Whitley,et al. Genetic Operators, the Fitness Landscape and the Traveling Salesman Problem , 1992, PPSN.