A Benders approach for computing lower bounds for the mirrored traveling tournament problem

A Benders approach for computing lower bounds for the mirrored Traveling Tournament Problem is proposed. The method obtained improved lower bounds for a number of benchmark instances at the Challenge Traveling Tournament Problems homepage http://mat.gsia.cmu.edu/TOURN/.

[1]  Tomomi Matsui,et al.  Constructive Algorithms for the Constant Distance Traveling Tournament Problem , 2006, PATAT.

[2]  J. Hooker,et al.  Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction , 2000 .

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

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

[5]  Aleteia P. F. Araujo,et al.  Exploring Grid Implementations of Parallel Cooperative Metaheuristics , 2007, Metaheuristics.

[6]  Pascal Van Hentenryck,et al.  Traveling Tournament Scheduling: A Systematic Evaluation of Simulated Annealling , 2006, CPAIOR.

[7]  Celso C. Ribeiro,et al.  A New Lower Bound to the Traveling Tournament Problem , 2007, 2007 IEEE Symposium on Computational Intelligence in Scheduling.

[8]  Kevin K. H. Cheung.  Solving mirrored traveling tournament problem benchmark instances with eight teams , 2008, Discret. Optim..

[9]  John W. Chinneck,et al.  Feasibility and Infeasibility in Optimization:: Algorithms and Computational Methods , 2007 .

[10]  Celso C. Ribeiro,et al.  Heuristics for the mirrored traveling tournament problem , 2007, Eur. J. Oper. Res..

[11]  John W. Chinneck,et al.  Locating Minimal Infeasible Constraint Sets in Linear Programs , 1991, INFORMS J. Comput..

[12]  T. Benoist,et al.  Lagrange Relaxation and Constraint Programming Collaborative schemes for Traveling Tournament Problems , 2001 .

[13]  Celso C. Ribeiro,et al.  Maximizing breaks and bounding solutions to the mirrored traveling tournament problem , 2006, Discret. Appl. Math..

[14]  Pascal Van Hentenryck,et al.  Principles and practice of constraint programming: The Newport papers , 1996, Computers & Mathematics with Applications.

[15]  Michael A. Trick,et al.  Round robin scheduling - a survey , 2008, Eur. J. Oper. Res..

[16]  Michael A. Trick,et al.  A Benders approach for the constrained minimum break problem , 2007, Eur. J. Oper. Res..

[17]  J. Hooker,et al.  Logic-based Benders decomposition , 2003 .

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

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

[20]  Matteo Fischetti,et al.  Combinatorial Benders' Cuts for Mixed-Integer Linear Programming , 2006, Oper. Res..