Autors:

CiteWeb id: 19990000223

CiteWeb score: 3273

DOI: 10.1162/106454699568728

This paper overviews recent work on ant algorithms, that is, algorithms for discrete optimization which took inspiration from the observation of ant colonies foraging behavior, and introduces the ant colony optimization (ACO) meta-heuristic. In the first part of the paper the basic biological findings on real ants are overviewed, and their artificial counterparts as well as the ACO meta-heuristic are defined. In the second part of the paper a number of applications to combinatorial optimization and routing in communications networks are described. We conclude with a discussion of related work and of some of the most important aspects of the ACO meta-heuristic.

The publication "Ant algorithms for discrete optimization" is placed in the Top 10000 of the best publications in CiteWeb. Also in the category Computer Science it is included to the Top 1000. Additionally, the publicaiton "Ant algorithms for discrete optimization" is placed in the Top 1000 among other scientific works published in 1999.
Links to full text of the publication: