An ant colony optimization approach to the traveling tournament problem

Authors:
David C. Uthus;Patricia J. Riddle;Hans W. Guesgen
Affiliations:
University of Auckland, Auckland, New Zealand;University of Auckland, Auckland, New Zealand;Massey University, Palmerston North, New Zealand
Venue:
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Year:
2009

Citing 11
Cited 1

MAX-MIN Ant system

Future Generation Computer Systems
Tabu Search

Tabu Search
The Traveling Tournament Problem Description and Benchmarks

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Constraint Processing

Constraint Processing
Ant Colony Optimization

Ant Colony Optimization
A simulated annealing approach to the traveling tournament problem

Journal of Scheduling
A composite-neighborhood tabu search approach to the traveling tournament problem

Journal of Heuristics
Population-based simulated annealing for traveling tournaments

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Solution-guided multi-point constructive search for job shop scheduling

Journal of Artificial Intelligence Research
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Solving the traveling tournament problem with iterative-deepening A*

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

The traveling tournament problem has proven to be a difficult problem for the ant colony optimization metaheuristic, with past approaches showing poor results. This is due to the unusual problem structure and feasibility constraints. We present a new ant colony optimization approach to this problem, hybridizing it with a forward checking and conflict-directed backjumping algorithm while using pattern matching and other constraint satisfaction strategies. The approach improves on the performance of past ant colony optimization approaches, finding better quality solutions in shorter time, and exhibits results comparable to other state-of-the-art approaches.