An ant colony optimization approach to the traveling tournament problem

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.

[1]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[2]  Graham Kendall,et al.  An Ant Based Hyper-heuristic for the Travelling Tournament Problem , 2007, 2007 IEEE Symposium on Computational Intelligence in Scheduling.

[3]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[4]  Pascal Van Hentenryck,et al.  Population-Based Simulated Annealing for Traveling Tournaments , 2007, AAAI.

[5]  Pascal Van Hentenryck,et al.  A simulated annealing approach to the traveling tournament problem , 2006, J. Sched..

[6]  Patrick Prosser,et al.  HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM , 1993, Comput. Intell..

[7]  Hans W. Guesgen,et al.  Ant Colony Optimization and the Single Round Robin Maximum Value Problem , 2008, ANTS Conference.

[8]  X. Zhang,et al.  A simulated annealing and hill-climbing algorithm for the traveling tournament problem , 2006, Eur. J. Oper. Res..

[9]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[10]  George L. Nemhauser,et al.  Solving the Travelling Tournament Problem: A Combined Integer Programming and Constraint Programming Approach , 2002, PATAT.

[11]  Andreas T. Ernst,et al.  Integrating ACO and Constraint Propagation , 2004, ANTS Workshop.

[12]  J. Christopher Beck.  Solution-Guided Multi-Point Constructive Search for Job Shop Scheduling , 2007, J. Artif. Intell. Res..

[13]  George L. Nemhauser,et al.  The Traveling Tournament Problem Description and Benchmarks , 2001, CP.

[14]  Luca Di Gaspero,et al.  A composite-neighborhood tabu search approach to the traveling tournament problem , 2007, J. Heuristics.

[15]  Roman Barták,et al.  Constraint Processing , 2009, Encyclopedia of Artificial Intelligence.

[16]  Manuel López-Ibáñez,et al.  Ant colony optimization , 2010, GECCO '10.