Mathematical modeling and tabu search heuristic for the traveling tournament problem

Jin Ho Lee, Young Hoon Lee, Yun Ho Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationComputational Science and Its Applications - ICCSA 2006
Subtitle of host publicationInternational Conference, Proceedings - Part III
PublisherSpringer Verlag
Pages875-884
Number of pages10
ISBN (Print)3540340750, 9783540340751
DOIs
Publication statusPublished - 2006 Jan 1
EventICCSA 2006: International Conference on Computational Science and Its Applications - Glasgow, United Kingdom
Duration: 2006 May 82006 May 11

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3982 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

OtherICCSA 2006: International Conference on Computational Science and Its Applications
CountryUnited Kingdom
CityGlasgow
Period06/5/806/5/11

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Lee, J. H., Lee, Y. H., & Lee, Y. H. (2006). Mathematical modeling and tabu search heuristic for the traveling tournament problem. In Computational Science and Its Applications - ICCSA 2006: International Conference, Proceedings - Part III (pp. 875-884). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3982 LNCS). Springer Verlag. https://doi.org/10.1007/11751595_92