The self organizing properties of ant colonies are employed to tackle the classical cominatorial optimization problem of graph partitioning. The graph is mapped onto an artificial environment in a manner that preserves the structural information. Ants from a number of colonies compete for resources. This leads to a restructuring of the global environment corresponding to a good partition. On the expample graphs, this is shown to outperform the current best algorithms which are based on recursive disection techniques.
展开▼
