期刊名称：International Journal of Computer Science & Technology
印刷版ISSN：2229-4333
电子版ISSN：0976-8491
出版年度：2011
卷号：2
期号：3(Version 2)
出版社：Ayushmaan Technologies
摘要：The ant colony optimization is a very powerful technique to find out solutions to combinatorial optimization problems. Ant Colony Optimization is a paradigm for designing net heuristic algorithms for combinatorial optimization problems. The first algorithm which can be classified within this framework was presented in 1991 and, since then, many diverse variants of the basic principle have been reported. The essential trait of ACO algorithms is the combination of a priori information about the structure of a promising solution with a posteriori information about the structure of previously obtained good solutions. The final section of the work presents a 3-d proposition gradually maturing from 2-d and its implementation.a
关键词：Max-Min; Pheromone; edge; pixel; local intensity value;optimization MATLAB; etc.r
