Performance Evaluation of an Adaptive Ant Colony Optimization Applied to Single Machine Scheduling

  • Authors:
  • Davide Anghinolfi;Antonio Boccalatte;Massimo Paolucci;Christian Vecchiola

  • Affiliations:
  • Department of Communication, Computer and Systems Sciences, University of Genova, Genova, Italy 16145;Department of Communication, Computer and Systems Sciences, University of Genova, Genova, Italy 16145;Department of Communication, Computer and Systems Sciences, University of Genova, Genova, Italy 16145;Department of Computer Science and Software Engineering, The University of Melbourne, Carlton, Australia 3053

  • Venue:
  • SEAL '08 Proceedings of the 7th International Conference on Simulated Evolution and Learning
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose a self-adaptive Ant Colony Optimization (AD-ACO) approach that exploits a parameter adaptation mechanism to reduce the requirement of a preliminary parameter tuning. The proposed AD-ACO is based on an ACO algorithm adopting a pheromone model with a new global pheromone update mechanism. We applied this algorithm to the single machine total weighted tardiness scheduling problem with sequence-dependent setup times and we executed an experimental campaign on a benchmark available in literature. Results, compared with the ones produced by the ACO algorithm without adaptation mechanism and with those obtained by recently proposed metaheuristic algorithms for the same problem, highlight the quality of the proposed approach.