Improved Robustness through Population Variance in Ant Colony Optimization

  • Authors:

  • David C. Matthews;Andrew M. Sutton;Doug Hains;L. Darrell Whitley

  • Affiliations:

  • Department of Computer Science, Colorado State University, Fort Collins;Department of Computer Science, Colorado State University, Fort Collins;Department of Computer Science, Colorado State University, Fort Collins;Department of Computer Science, Colorado State University, Fort Collins

  • Venue:
  • SLS '09 Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Ant Colony Optimization algorithms are population-based Stochastic Local Search algorithms that mimic the behavior of ants, simulating pheromone trails to search for solutions to combinatorial optimization problems. This paper introduces Population Variance, a novel approach to ACO algorithms that allows parameters to vary across the population over time, leading to solution construction differences that are not strictly stochastic. The increased exploration appears to help the search escape from local optima, significantly improving the robustness of the algorithm with respect to suboptimal parameter settings.