Applications of ACO algorithms to obtain better solutions for combinatorial optimization problems have become very popular in recent years. In ACO algorithms, group of agents repeatedly perform well defined actions and collaborate with other ants in order to accomplish the defined task. In this paper, we introduce new mechanisms for selecting the Elite ants dynamically based on simple statistical tools. We also investigate the performance of newly proposed mechanisms.
@article{arxiv.1203.0197,
title = {Statistical Approach for Selecting Elite Ants},
author = {G. S. Raghavendra and N. Prasanna Kumar},
journal= {arXiv preprint arXiv:1203.0197},
year = {2012}
}