Ant Colony Optimization and the Single Round Robin Maximum Value Problem

Authors:
David C. Uthus;Patricia J. Riddle;Hans W. Guesgen
Affiliations:
Department of Computer Science, University of Auckland, Auckland, New Zealand;Department of Computer Science, University of Auckland, Auckland, New Zealand;School of Engineering and Advanced Technology, Massey University, Palmerston North, New Zealand
Venue:
ANTS '08 Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence
Year:
2008

Citing 5
Cited 0

ACO algorithms for the quadratic assignment problem

New ideas in optimization
Artificial Intelligence: A Modern Approach

Artificial Intelligence: A Modern Approach
Ant Colony Optimization

Ant Colony Optimization
A composite-neighborhood tabu search approach to the traveling tournament problem

Journal of Heuristics
Ant algorithms for the university course timetabling problem with regard to the state-of-the-art

EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we apply the ant colony optimization metaheuristic to the Single Round Robin Maximum Value Problem, a problem from sports scheduling. This problem contains both feasibility constraints and an optimization goal. We approach this problem using a combination of the metaheuristic with backtracking search. We show how using constraint satisfaction techniques can improve the hybrid's performance. We also show that our approach performs comparably to integer programming and better than tabu search when applied to the Single Round Robin Maximum Value Problem.