A multilevel k–way partitioning algorithm for finite element meshes using competing ant colonies
A. E. Langham, Philip W. Grant · 1999
The self{organizing properties of ant colonies are employed to tackle the classical combi-natorial optimization problem of graph par-titioning. Structural information from the graph is mapped onto an environment upon which a number of colonies compete for re-sources. Using Genetic Programming, a For-aging Strategy is evolved which when exe-cuted by the ants in each colony leads to a restructuring of the global environment cor-responding to a good partition. Multiple colonies allows for simultaneous k{way par-titioning which can provide better partitions than current algorithms which are based on recursive bisection. 1