Ant colonies and the mesh-partitioning problem
Authors
B. Robič, P. Korošec, J. Šilc
Publication
Chapman & Hall/CRC, 2006, 285-304
Abstract
An ant colony is a "distributed system" that has a highly structured social organization in spite of the simplicity of its individuals. Because of this organization, an ant colony is capable of accomplishing complex natural tasks that far exceed the individual capacity of a single ant. It is not surprising, therefore, that computer scientists have taken inspiration from ants and their behavior in order to design algorithms for solving computationally demanding problems. This chapter is concerned with applying these ideas to solve an important, but NP-hard, combinatorial optimization problem: the so-called mesh-partitioning problem.
BIBTEX copied to Clipboard