论文信息 - A simulated annealing approach to the travelling tournament problem

A simulated annealing approach to the travelling tournament problem

Automating the scheduling of sport leagues has received considerable attention in recent years. This paper considers the traveling tournament problem (TTP) proposed in [8; 4] to abstract the salient features of major league baseball (MLB) in the United States. It proposes a simulated annealing algorithm (TTSA) for the TTP that produces significant improvements over previous approaches.

Aris Anagnostopoulos | Yannis Vergados | P. Van Hentenryck | Laurent Michel

[1] Fred Glover,et al. TSP Ejection Chains , 1997, Discret. Appl. Math..

[2] David Connolly,et al. General Purpose Simulated Annealing , 1992 .

[3] Juan A. Díaz,et al. A Tabu search heuristic for the generalized assignment problem , 2001, Eur. J. Oper. Res..

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

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

[6] J. P. Kelly,et al. Tabu search for the multilevel generalized assignment problem , 1995 .