On the convergence of ant colony optimization with stench pheromone

Z. Cong, B. De Schutter, and R. Babuska, "On the convergence of ant colony optimization with stench pheromone," 2013 IEEE Congress on Evolutionary Computation, Cancún, Mexico, pp. 1876-1883, June 2013.

Ant Colony Optimization (ACO) has proved to be a powerful metaheuristic for combinatorial optimization problems. From a theoretical point of view, the convergence of the ACO algorithm is an important issue. In this paper, we analyze the convergence properties of a recently introduced ACO algorithm, called ACO with stench pheromone (SACO), which can be used to solve dynamic traffic routing problems through finding the minimum cost routes in a traffic network. This new algorithm has two different types of pheromone: the regular pheromone that is used to attract artificial ants to the arc in the network with the lowest cost, and the stench pheromone that is used to push ants away when too many ants converge to that arc. As a first step of a convergence proof for SACO, we consider a network with two arcs. We show that the process of pheromone update will transit among different modes, and finally stay in a stable mode, thus proving convergence for this given case.

 * Corresponding technical report: pdf file (137 KB)
      Note: More information on the pdf file format mentioned above can be found here.

Bibtex entry:

        author={Z. Cong and B. {D}e Schutter and R. Babu{\v{s}}ka},
        title={On the convergence of ant colony optimization with stench pheromone},
        booktitle={2013 IEEE Congress on Evolutionary Computation},
        address={Canc\'un, Mexico},

Go to the publications overview page.

This page is maintained by Bart De Schutter. Last update: November 17, 2016.