Is there a computational advantage to representing evaporation rate in ant colony optimization as a gaussian random variable?

  • Authors:
  • Ashraf M. Abdelbar

  • Affiliations:
  • American University in Cairo, Cairo, Egypt

  • Venue:
  • Proceedings of the 14th annual conference on Genetic and evolutionary computation
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose an ACO (Ant Colony Optimization) variation in which the evaporation rate, instead of being constant as is common in standard ACO algorithms, is a Gaussian random variable with non-negligible variance. In experimental results in the context of MAX-MIN Ant System (MMAS) and the Traveling Salesman Problem (TSP), we find that our variation performs considerably better than MMAS when the number of iterations is small, and that its performance is slightly better than MMAS when the number of iterations is large.