๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Runtime Analysis of a Simple Ant Colony Optimization Algorithm

โœ Scribed by Frank Neumann; Carsten Witt


Publisher
Springer
Year
2007
Tongue
English
Weight
349 KB
Volume
54
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Ant colony optimization of clustering mo
โœ Thomas A. Runkler ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 319 KB

The original ant system algorithm is simplified leading to a generalized ant colony optimization algorithm that can be used to solve a wide variety of discrete optimization problems. It is shown how objective function based clustering models such as hard and fuzzy c-means can be optimized using part