Modeling the Dynamics of Ant Colony Optimization

@article{Merkle2002ModelingTD,
  title={Modeling the Dynamics of Ant Colony Optimization},
  author={Daniel Merkle and Martin Middendorf},
  journal={Evolutionary Computation},
  year={2002},
  volume={10},
  pages={235-262}
}
The dynamics of Ant Colony Optimization (ACO) algorithms is studied using a deterministic model that assumes an average expected behavior of the algorithms. The ACO optimization metaheuristic is an iterative approach, where in every iteration, artificial ants construct solutions randomly but guided by pheromone information stemming from former ants that found good solutions. The behavior of ACO algorithms and the ACO model are analyzed for certain types of permutation problems. It is shown… CONTINUE READING
Highly Cited
This paper has 90 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 55 extracted citations

90 Citations

01020'02'05'09'13'17
Citations per Year
Semantic Scholar estimates that this publication has 90 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 19 references

Optimization, Learning and Natural Algorithms (in Italian)

  • M. Dorigo
  • Ph.D. thesis, Dipartimento di Elettronica…
  • 1992
Highly Influential
5 Excerpts

Royal Road Functions

  • M. Mitchell, S. Forrest
  • Bäck, T., Fogel, D., and Michalewicz, Z., editors…
  • 1997
Highly Influential
3 Excerpts

A new Ant Colony Algorithm for the Job Shop Scheduling Problem

  • T Teich
  • Proceedings of the Genetic and Evolutionary…
  • 2001

Modelling GA Dynamics

  • A. Prügel-Bennett, A. Rogers
  • Kallel, L., Naudts, B., and Rogers, A., editors…
  • 2001
1 Excerpt

Similar Papers

Loading similar papers…