The dynamics of collective sorting robot-like ants and ant-like robots
Proceedings of the first international conference on simulation of adaptive behavior on From animals to animats
Emergent colonization and graph partitioning
SAB94 Proceedings of the third international conference on Simulation of adaptive behavior : from animals to animats 3: from animals to animats 3
AntNet: distributed stigmergetic control for communications networks
Journal of Artificial Intelligence Research
A distributed multilevel ant-colony approach for finite element mesh decomposition
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part II
Cutting graphs using competing ant colonies and an edge clustering heuristic
EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
A distributed multilevel ant-colony algorithm for the multi-way graph partitioning
International Journal of Bio-Inspired Computation
Hierarchical image segmentation using ant colony and chemical computing approach
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part II
An effective refinement algorithm based on swarm intelligence for graph bipartitioning
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
| Hi-index | 0.00 |
The self organizing properties of ant colonies are employed to tackle the classical combinatorial 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 example graphs, this is shown to outperform the current best algorithms which are based on recursive bisection techniques.