1 |
S.Lin and B.W. Kernighan, 'An Effective Heuristic Algorithm for the Traveling Salesman Problem,' Bell Telephone Laboratiories, Incorporated, Murray Hill, N.J.-1971
|
2 |
MICHALEWICZ, '유전자 알고리즘', 공성곤 외 4인공역, 그린출판사
|
3 |
기타로 히고아키, '유전자 알고리즘', 조성배 역, 대청출판사
|
4 |
R.Beckers, J.L. Deneubourg, and S. Goss, 'Trails and U-turns in the selection of the shortest path by the ant Lasius Niger,' Journal of Theoretical Biology, vol. 159, pp. 397-415, 1992
DOI
|
5 |
L.M. Gambardella and M.Dorigo, 'Ant Colony System : A Coopertive Learning Approach to the Traveling Salesman Problem,' IEEE Transactions on Evolutionary Computation, Vol. 1, No. 1, 1997
DOI
|
6 |
A.Colorni, M.Dorgio, and V.Maniezzo, 'Distributed optimization by ant colonies,' Proceedings of ECAL91-European Conference on Artificial Life Paris, France, F.Varela and P.Borgine(Eds.), Elsevier Publishing, pp.134-142, 1991
|
7 |
V.J Rayward-smith, C.R. Reeves, G.D. Smith, 'Modern Heuristic Search Methods,' John Wiley& Sons Ltd., 1996
|
8 |
V.Maniezzo, A.Colorni, and M.Doriogo, 'The ant system applied to the quadratic assignment problem,' Rep. IPIDIA 94-28, Universite Libre de Bruxelles, Belgium., 1994
|
9 |
B. Freisleben and P. Merz, 'Genetic Local serch algorithm for solving symmetric and asymmetric traveling salesman problems,' Proceedings of IEEE International Conference of Evolutionary Computation, IEEE-EC96, IEEE Press, pp.616-621, 1996
DOI
|