최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기한국해양정보통신학회논문지 = The journal of the Korea Institute of Maritime Information & Communication Sciences, v.12 no.12, 2008년, pp.2343 - 2348
Ant algorithm is new meta heuristic for hard combinatorial optimization problem. It is a population based approach that uses exploitation of positive feedback as well as greedy search. It was first proposed for tackling the well known Traveling Salesman Problem. In this paper, we propose the improve...
* AI 자동 식별 결과로 적합하지 않은 문장이 있을 수 있으니, 이용에 유의하시기 바랍니다.
B. Freisleben and P. Merz, "Genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems," Proceedings of IEEE International Conference of Evolutionary Computation, IEEE-EC 96, IEEE Press, pp. 616-621, 1996
B. Bullnheimer, R. F. Hartl, and C. Strauss. "A new rank-based version of the Ant System: A computational study," Central European Journal for Operations Research and Economics, 7(1): pp.25-38, 1999
C. Blum, "Ant colony optimization: Introduction and recent trends", Physics of Life Reviews, 2(4), pp.353-373, 2005
L.M. Gambardella and M. Dorigo,"Ant Colony System: A Cooperative Learning approach to the Traveling Salesman Problem" IEEE Transactions on Evolutionary Computation, vol. 1, No. 1, 1997
M. Dorigo, M. Birattari, T. Stutzle, "Ant Colony Optimization -- Artificial Ants as a Computational Intelligence Technique", IEEE Computational Intelligence Magazine, 2006
M. Dorigo & T. Stutzle, "The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances", Handbook of Metaheuristics, 2002
M. Dorigo & K. Socha, "An Introduction to Ant Colony Optimization", Approximation Algorithms and Metaheuristics, CRC Press, 2007
M. Drigo, V.Maniezzo, and A.Colorni, "The ant system: optimization by a colony of cooperation agents," IEEE Transactions of Systems, Man, and Cybernetics-Part B, vol. 26, No. 2, pp. 29-41, 1996
M. Dorigo & L.M. Gambardella. "Ant Colonies for the Traveling Salesman Problem". BioSystems, 43:73-81, 1997
S. Lin and B.W. Kernighan, "An Effective Heuristic algorithm for the Traveling Salesman Problem," Bell Telephone Laboratories, Incorporated, Murray Hill, N.J. 1997
http://elib.zib.de/pub/Packages/mp-testdata/tsp/tsplib /tsplib.html
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.