论文信息 - An efficient hybrid genetic algorithm for the traveling salesman problem - 字舞流文

An efficient hybrid genetic algorithm for the traveling salesman problem

Kengo Katayama | Hiroyuki Narihisa | K. Katayama | H. Narihisa

[1] Bernd Freisleben,et al. New Genetic Local Search Operators for the Traveling Salesman Problem , 1996, PPSN.

[2] Zbigniew Michalewicz,et al. Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[3] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[4] Takeaki Uno,et al. Fast Algorithms to Enumerate All Common Intervals of Two Permutations , 1997, Algorithmica.

[5] Cecilia R. Aragon,et al. Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[6] John J. Grefenstette,et al. Genetic Algorithms for the Traveling Salesman Problem , 1985, ICGA.

[7] Emile H. L. Aarts,et al. Genetic Local Search Algorithms for the Travelling Salesman Problem , 1990, PPSN.

[8] Maurizio Rebaudengo,et al. Hybrid Genetic Algorithms for the Travelling Salesman Problem , 1993 .

[9] David S. Johnson,et al. Local Optimization and the Traveling Salesman Problem , 1990, ICALP.

[10] Donald E. Brown,et al. A Parallel Genetic Heuristic for the Quadratic Assignment Problem , 1989, ICGA.

[11] R. Brady. Optimization strategies gleaned from biological evolution , 1985, Nature.

[12] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .