MEDAL Report 2006008
Cunning Ant System: An Extension of Edge Histogram Sampling Algorithms to ACO
Shigeyoshi Tsutsui and Martin Pelikan  (2006)

Abstract. In this paper, we propose a variant of an ACO algorithm called the cunning Ant System (cAS). In cAS, each ant generates a solution by borrowing a part of a solution which was generated in previous iterations, instead of generating the solution entirely from pheromone density. Thus we named it, cunning ant. This cunning action reduces premature stagnation and exhibits good performance in the search. The experimental results showed cAS worked very well on the TSP and it may be one of the most promising ACO algorithms.

Download PDF

Go back

Missouri Estimation of Distribution Algorithms Laboratory
Department of Mathematics and Computer Science
University of Missouri-St. Louis, St. Louis, MO


            Web design by Martin Pelikan