Pointwise convergence of discrete ant system algorithm

Authors:
Paweł Rembelski;Witold Kosiński
Affiliations:
Faculty of Computer Science, Polish-Japanese Institute of Information Technology, Warsaw, Poland;Faculty of Computer Science, Polish-Japanese Institute of Information Technology, Warsaw, Poland
Venue:
SIDE'12 Proceedings of the 2012 international conference on Swarm and Evolutionary Computation
Year:
2012

Citing 4
Cited 0

Ant colony optimization

IEEE Computational Intelligence Magazine
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation
A short convergence proof for a class of ant colony optimizationalgorithms

IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Discrete Ant System (DAS) algorithm, a modification of classical Ant System algorithm formulated by M. Dorigo, is presented. Definition of optimization problem and a detailed description of component rules of DAS method are given. Then a probabilistic algebraic model of DAS heuristic describing its evolution in terms of Markov chains is presented. The final result in the form of a pointwise convergence of Discrete Ant System algorithm is established.