@inproceedings{7ff9793ce17f4271b27c8ee1a056c58f,
title = "Mathematical modeling and tabu search heuristic for the traveling tournament problem",
abstract = "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.",
author = "Lee, {Jin Ho} and Lee, {Young Hoon} and Lee, {Yun Ho}",
year = "2006",
doi = "10.1007/11751595_92",
language = "English",
isbn = "3540340750",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "875--884",
booktitle = "Computational Science and Its Applications - ICCSA 2006",
address = "Germany",
note = "ICCSA 2006: International Conference on Computational Science and Its Applications ; Conference date: 08-05-2006 Through 11-05-2006",
}