CiteWeb id: 19960000017

CiteWeb score: 11068

DOI: 10.1109/3477.484436

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 to stochastic combinatorial optimization. The main characteristics of this model are positive feedback, distributed computation, and the use of a constructive greedy heuristic. Positive feedback accounts for rapid discovery of good solutions, distributed computation avoids premature convergence, and the greedy heuristic helps find acceptable solutions in the early stages of the search process. We apply the proposed methodology to the classical traveling salesman problem (TSP), and report simulation results. We also discuss parameter selection and the early setups of the model, and compare it with tabu search and simulated annealing using TSP. To demonstrate the robustness of the approach, we show how the ant system (AS) can be applied to other optimization problems like the asymmetric traveling salesman, the quadratic assignment and the job-shop scheduling. Finally we discuss the salient characteristics-global data structure revision, distributed communication and probabilistic transitions of the AS.

The publication "Ant system: optimization by a colony of cooperating agents" is placed in the Top 1000 of the best publications in CiteWeb. Also in the category Computer Science it is included to the Top 100. Additionally, the publicaiton "Ant system: optimization by a colony of cooperating agents" is placed in the Top 100 among other scientific works published in 1996.
Links to full text of the publication: