TY  - JOUR
T1  - Solving the Traveling Tournament Problem Based on the Simulated Annealing and
Tabu Search Algorithm
AU - Jeong, Sukjae AU - Kim, Jihyun AU - Han, Jaehyun 
JO  - Journal of Engineering and Applied Sciences
VL  - 13
IS  - 21
SP  - 9204
EP  - 9212
PY  - 2018
DA  - 2001/08/19
SN  - 1816-949x
DO  - jeasci.2018.9204.9212
UR  - https://makhillpublications.co/view-article.php?doi=jeasci.2018.9204.9212
KW  - Combinatorial optimization problem
KW  -double round-Robin tournament
KW  -integer programming
KW  -simulated annealing
KW  -Tabu search
KW  -traveling tournament problem
AB  - The professional sports league has been one of the biggest business industries. And both each team
manager and league manager have interested in good game schedule for the benefit. Sports League Scheduling
Problem (SLSP) study had started in operation research and many researchers have been worked over the last
two decades. The traveling tournament problem is recently proposed by Goerigk and Westphal which is a
well-known combinatorial optimization problem aimed at developing optimal schedules for sport leagues. The
TTP is considered a difficult problem in that its constraints appear to be simple but are difficult to satisfy and
the objective of minimizing the total travel distance is difficult to achieve. Thus, it has been considered a
challengeable combinatorial optimization problem for both theoretical and practical reasons. In this study, we
present a hybrid heuristic algorithm using the Tabu search and simulated annealing procedures for solving the
traveling tournament problem. Computational experiments using a hybrid approach on benchmark sets give
results comparable to or better than current best known solutions.
ER  -