Ant Algorithms: Theory and Applications

  • Authors:
  • S. D. Shtovba

  • Affiliations:
  • Vinnitsa State Technical University, Vinnitsa, Ukraine 21021

  • Venue:
  • Programming and Computing Software
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper reviews the theory and applications of ant algorithms, new methods of discrete optimization based on the simulation of self-organized colony of biologic ants. The colony can be regarded as a multi-agent system where each agent is functioning independently by simple rules. Unlike the nearly primitive behavior of the agents, the behavior of the whole system happens to be amazingly reasonable. The ant algorithms have been extensively studied by European researchers from the mid-1990s. These algorithms have successfully been applied to solving many complex combinatorial optimization problems, such as the traveling salesman problem, the vehicle routing problem, the problem of graph coloring, the quadratic assignment problem, the problem of network-traffic optimization, the job-shop scheduling problem, etc. The ant algorithms are especially efficient for online optimization of processes in distributed nonstationary systems (for example, telecommunication network routing).