The Coupled EigenAnt algorithm for shortest path problems
Eugenius Kaszkurewicz, Amit Bhaya, Jayadeva, João Marcos Meirelles da Silva · 2014
This paper introduces an ACO model and associated algorithm, called Coupled EigenAnt, for the problem of finding the shortest of N paths between a source and a destination node. It is based on the recently introduced EigenAnt algorithm, the novelty being that it allows probabilistic path choice on both the forward and return journeys, as well as the fact that it introduces decay of pheromone deposition following a geometric progression. Equilibrium points of the model are calculated and the local stability of the two path synchronous version analyzed. Simulations illustrate the main features of the algorithm.