A new iterated local search algorithm using genetic crossover for the traveling salesman problem
暂无分享,去创建一个
[1] David S. Johnson,et al. Local Optimization and the Traveling Salesman Problem , 1990, ICALP.
[2] Andrew B. Kahng,et al. Improved Large-Step Markov Chain Variants for the Symmetric TSP , 1997, J. Heuristics.
[3] Bernd Freisleben,et al. New Genetic Local Search Operators for the Traveling Salesman Problem , 1996, PPSN.
[4] Kengo Katayama,et al. Performance Analysis of a New Genetic Crossover for the Traveling Salesman Problem(Special Section on Discrete Mathematics and Its Applications) , 1998 .
[5] Kwong-Sak Leung,et al. A Modified Edge Recombination Operator for the Travelling Salesman Problem , 1994, PPSN.
[6] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..
[7] Andrew B. Kahng,et al. A new adaptive multi-start technique for combinatorial global optimizations , 1994, Oper. Res. Lett..
[8] 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 .
[9] Edward W. Felten,et al. Large-step markov chains for the TSP incorporating local search heuristics , 1992, Oper. Res. Lett..
[10] Emile H. L. Aarts,et al. Genetic Local Search Algorithms for the Travelling Salesman Problem , 1990, PPSN.