A proof of convergence for ant algorithms
Joint Authors
Source
International Journal of Intelligent Computing and Information Sciences
Issue
Vol. 3, Issue 1 (31 Jan. 2003), pp.22-32, 11 p.
Publisher
Ain Shams University Faculty of Computer and Information Sciences
Publication Date
2003-01-31
Country of Publication
Egypt
No. of Pages
11
Main Subjects
Abstract EN
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.
American Psychological Association (APA)
Badr, A.& Fahmi, A.. 2003. A proof of convergence for ant algorithms. International Journal of Intelligent Computing and Information Sciences،Vol. 3, no. 1, pp.22-32.
https://search.emarefa.net/detail/BIM-296340
Modern Language Association (MLA)
Badr, A.& Fahmi, A.. A proof of convergence for ant algorithms. International Journal of Intelligent Computing and Information Sciences Vol. 3, no. 1 (Jan. 2003), pp.22-32.
https://search.emarefa.net/detail/BIM-296340
American Medical Association (AMA)
Badr, A.& Fahmi, A.. A proof of convergence for ant algorithms. International Journal of Intelligent Computing and Information Sciences. 2003. Vol. 3, no. 1, pp.22-32.
https://search.emarefa.net/detail/BIM-296340
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references : p. 31-32
Record ID
BIM-296340
