A proof of convergence for Ant algorithms

Authors:
Amr Badr;Ahmed Fahmy
Affiliations:
Department of Computer Science, Faculty of Computers and Information, Cairo University, Cairo, Egypt;Department of Computer Engineering, Faculty of Engineering and Technology, Arab Academy for Science and Technology and Maritime Transport, Egypt
Venue:
Information Sciences—Informatics and Computer Science: An International Journal
Year:
2004

Citing 3
Cited 15

The ant colony optimization meta-heuristic

New ideas in optimization
Theory, Volume 1, Queueing Systems

Theory, Volume 1, Queueing Systems
Ant system: optimization by a colony of cooperating agents

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

GSA: A Gravitational Search Algorithm

Information Sciences: an International Journal
A pheromone-rate-based analysis on the convergence time of ACO algorithm

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on cybernetics and cognitive informatics
Reliability evaluation and optimal design in heterogeneous multi-state series-parallel systems

Information Sciences: an International Journal
Ant colony optimisation to identify genetic variant association with type 2 diabetes

Information Sciences: an International Journal
Honey bees mating optimization algorithm for the Euclidean traveling salesman problem

Information Sciences: an International Journal
The application of artificial intelligence hybrid in traffic flow

HAIS'11 Proceedings of the 6th international conference on Hybrid artificial intelligent systems - Volume Part I
Golden ratio (sectiona aurea) in markovian ants AI hybrid

ICAIS'11 Proceedings of the Second international conference on Adaptive and intelligent systems
Ant colony algorithm for traffic signal timing optimization

Advances in Engineering Software
A time complexity analysis of ACO for linear functions

SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
A novel ACO algorithm with adaptive parameter

ICIC'06 Proceedings of the 2006 international conference on Computational Intelligence and Bioinformatics - Volume Part III
Research on a novel ant colony optimization algorithm

ISNN'10 Proceedings of the 7th international conference on Advances in Neural Networks - Volume Part I
Markovian ants in a queuing system

HAIS'10 Proceedings of the 5th international conference on Hybrid Artificial Intelligence Systems - Volume Part I
Chaotic secure communication based on a gravitational search algorithm filter

Engineering Applications of Artificial Intelligence
A parallel ant colony algorithm on massively parallel processors and its convergence analysis for the travelling salesman problem

Information Sciences: an International Journal
A chaotic digital secure communication based on a modified gravitational search algorithm filter

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

A proof of convergence for Ant algorithms is developed. Ant algorithms were modeled as branching random processes: the branching random walk and branching Wiener process to derive rates of birth and death of ant paths. Substitution is then carried out in birth-death processes which proves that a stable distribution is surely reached. This indicates that Ant algorithms converge with probability one. This analogy models Ant algorithms complexity parameters such as the number of cycles, the degrees of freedom of problem and the number of ants.