A new approach for solving large traveling salesman problem using evolutionary ant rules
暂无分享,去创建一个
[1] Marco Dorigo,et al. The ant colony optimization meta-heuristic , 1999 .
[2] Marco Dorigo,et al. Optimization, Learning and Natural Algorithms , 1992 .
[3] Licheng Jiao,et al. The immune genetic algorithm and its convergence , 1998, ICSP '98. 1998 Fourth International Conference on Signal Processing (Cat. No.98TH8344).
[4] Luca Maria Gambardella,et al. HAS-SOP: Hybrid Ant System for the Sequential Ordering Problem , 1997 .
[5] Ching-Chi Hsu,et al. An annealing framework with learning memory , 1998, IEEE Trans. Syst. Man Cybern. Part A.
[6] Luca Maria Gambardella,et al. Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..
[7] Fred Glover,et al. Tabu Search - Part II , 1989, INFORMS J. Comput..
[8] T. Stützle,et al. MAX-MIN Ant System and local search for the traveling salesman problem , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).
[9] Michael Leyton,et al. Perceptual organization as nested control , 1984, Biological Cybernetics.
[10] M. M. Flood. The Traveling-Salesman Problem , 1956 .
[11] G. Di Caro,et al. Ant colony optimization: a new meta-heuristic , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).
[12] Marco Dorigo,et al. AntNet: Distributed Stigmergetic Control for Communications Networks , 1998, J. Artif. Intell. Res..
[13] Marco Dorigo,et al. Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.