A Polymorphic Ant-Based Algorithm for Graph Clustering
In this thesis, I introduce two new algorithms: Ant Brood Clustering-Intelligent Ants (ABC-INTE) and Ant Brood Clustering-Polymorphic Ants (ABC-POLY) for the graph clustering problem. ABC-INTE uses techniques such as hopping ants, relaxed drop function, ants with memories, stagnation control, and ad...
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
2016
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1993/31202 |