As professional sports have become big businesses all over the world, many researches with respect to sports scheduling problem have been worked over the last two decades. The traveling tournament problem (TTP) is defined as minimizing total traveling distance for all teams in the league. In this study, a mathematical model for the TTP is presented. This model is formulated using an integer programming (IP). In order to solve practical problems with large size of teams, a tabu search heuristic is suggested. Also, the concepts of alternation and intimacy were introduced for effective neighborhood search. Experiments with several instances are tested to evaluate their performances. It was shown that the proposed heuristic shows good performances with computational efficiency. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Lee, J. H., Lee, Y. H., & Lee, Y. H. (2006). Mathematical modeling and tabu search heuristic for the traveling tournament problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3982 LNCS, pp. 875–884). Springer Verlag. https://doi.org/10.1007/11751595_92
Mendeley helps you to discover research relevant for your work.