RESEARCH ON CENVERGENCE OF ANT ALGORITHM
暂无分享,去创建一个
A basic ant algorithm based on elite strategy to resolve the shortest path problem is given, In terms of stochastic processes and functional analysis methods; the abstract description of the basic ant algorithm is established. By using the basic ant algorithm, the iteration feature of problem-solving is studied, the conclusion can be drawn that the solution sequence is asymptotic convergence.
[1] Walter J. Gutjahr,et al. A Graph-based Ant System and its convergence , 2000, Future Gener. Comput. Syst..
[2] H. Piaggio. Mathematical Analysis , 1955, Nature.
[3] Marco Dorigo,et al. Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.