Keywords
ANTRandom walkBranching processAlgorithmBranching (polymer chemistry)Convergence (economics)Ant colonyAnalogyComputer scienceBirth–death processMathematicsAnt colony optimization algorithmsCombinatoricsStatisticsPopulation
Affiliated Institutions
Related Publications
Ant colony optimization algorithm and its application to Neuro-Fuzzy controller design
An adaptive ant colony algorithm is proposed based on dynamically adjusting the strategy of updating trail information. The algorithm can keep good balance between accelerating ...
Reducing the Time Complexity of the Derandomized Evolution Strategy with Covariance Matrix Adaptation (CMA-ES)
This paper presents a novel evolutionary optimization strategy based on the derandomized evolution strategy with covariance matrix adaptation (CMA-ES). This new approach is inte...
Fast Random Walk Graph Kernel
Previous chapter Next chapter Full AccessProceedings Proceedings of the 2012 SIAM International Conference on Data Mining (SDM)Fast Random Walk Graph KernelU Kang, Hanghang Tong...
Combining Convergence and Diversity in Evolutionary Multiobjective Optimization
Over the past few years, the research on evolutionary algorithms has demonstrated their niche in solving multiobjective optimization problems, where the goal is to find a number...
Ant system: optimization by a colony of cooperating agents
An analogy with the way ant colonies function has suggested the definition of a new computational paradigm, which we call ant system (AS). We propose it as a viable new approach...
Publication Info
- Year
- 2003
- Type
- article
- Volume
- 160
- Issue
- 1-4
- Pages
- 267-279
- Citations
- 74
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
74
OpenAlex
Cite This
Amr Badr,
Ahmed Fahmy
(2003).
A proof of convergence for Ant algorithms.
Information Sciences
, 160
(1-4)
, 267-279.
https://doi.org/10.1016/j.ins.2003.08.018
Identifiers
- DOI
- 10.1016/j.ins.2003.08.018