Traveling Tournament Scheduling: A Systematic Evaluation of Simulated Annealling
This paper considers all the variants of the traveling tournament problem (TTP) proposed in [17, 7] to abstract the salient features of major league baseball (MLB) in the United States. The variants include different distance metrics and both mirrored and non-mirrored schedules. The paper shows that, with appropriate enhancements, simulated annealing is robust across the distance metrics and mirroring. In particular, the algorithm matches or improves most best-known solutions and produces numerous new best solutions spread over all classes of problems. The main technical contribution underlying these results is a number of compositive neighborhood moves that aggregate sequences of existing moves; these novel moves preserve the mirroring or distance structure of the candidate schedule, while performing interesting transformations.
KeywordsSimulated Annealing Tabu Search Distance Metrics Major League Baseball Feasibility Constraint
Unable to display preview. Download preview PDF.
- 1.Anagnostopoulos, A., Michel, L., Van Hentenryck, P., Vergados, Y.: A Simulated Annealing Approach to the Traveling Tournament Problem. In: CP-AI-OR 2003, Montreal, Canada (May 2003)Google Scholar
- 2.Benoist, T., Laburthe, F., Rottembourg, B.: Lagrange Relaxation and Constraint Programming Collaborative Schemes for Travelling Tournament Problems. In: CP-AI-OR 2001, Wye College (Imperial College), Ashford, Kent UK (April 2001)Google Scholar
- 3.Connelly, D.T.: General Purpose Simulated Annealing. European Journal of Operations Research 43 (1992)Google Scholar
- 4.Davenport, A., Tsang, E.: Solving Constraint Satisfaction Sequencing Problems by Iterative Repair. In: Procceedings of the First International Conference on the Practical Applications of Constraint Technologies and Logic Programming (PACLP 1999), London, April 1999, pp. 345–357 (1999)Google Scholar
- 8.Di Gaspero, L., Schaerf, A.: A Tabu Search Approach to the Traveling Tournament Problem. In: Proceedings of RCRA 2005, Associazione Italiana per l’Intelligenza Artificiale (AI*IA), Ferrara, Italy, June 2005, pp. 23–27 (2005)Google Scholar
- 12.Lim, A., Rodrigues, B., Zhang, X.: Scheduling Sports Competitions at Multiple Venues Revisited. European Journal of Operational Research (2005) (accepted for publication)Google Scholar
- 15.Rasmussen, R., Trick, M.: A Benders Approach to the Constrained Minimum Break Problem. European Journal of Operational Research (2005) (accepted for publication)Google Scholar
- 16.Ribeiro, C.C., Urrutia, S.: Heuristics for the Mirrored Traveling Tournament Problem. In: Proceedings of the 5th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2004), pp. 323–342 (2004)Google Scholar
- 17.Trick, M.: http://mat.gsia.cmu.edu/TOURN/ (2002)
- 18.Van Hentenryck, P., Vergados, Y.: Minimizing Breaks in Sport Scheduling with Local Search. In: Proceedings of the 15th International Conference on Automated Planning and Scheduling, Monterey, CA (June 2005)Google Scholar