Journal of Engineering and Applied Sciences
ISSN: Online 1818-7803ISSN: Print 1816-949x
Abstract
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.
How to cite this article:
Jihyun Kim, Jaehyun Han and Sukjae Jeong. Solving the Traveling Tournament Problem Based on the Simulated Annealing and
Tabu Search Algorithm.
DOI: https://doi.org/10.36478/jeasci.2018.9204.9212
URL: https://www.makhillpublications.co/view-article/1816-949x/jeasci.2018.9204.9212