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
Volume3982 LNCS
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

Tabu search
Tabu Search
Tournament
Sports
Mathematical Modeling
Heuristics
Integer programming
Sports Scheduling
Computational efficiency
Neighborhood Search
Alternation
Scheduling
Mathematical models
Integer Programming
Computational Efficiency
Scheduling Problem
Mathematical Model
Industry
Evaluate
Experiments

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 (Vol. 3982 LNCS, 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
Lee, Jin Ho ; Lee, Young Hoon ; Lee, Yun Ho. / Mathematical modeling and tabu search heuristic for the traveling tournament problem. Computational Science and Its Applications - ICCSA 2006: International Conference, Proceedings - Part III. Vol. 3982 LNCS Springer Verlag, 2006. pp. 875-884 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@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",
month = "1",
day = "1",
doi = "10.1007/11751595_92",
language = "English",
isbn = "3540340750",
volume = "3982 LNCS",
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",

}

Lee, JH, Lee, YH & Lee, YH 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. vol. 3982 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3982 LNCS, Springer Verlag, pp. 875-884, ICCSA 2006: International Conference on Computational Science and Its Applications, Glasgow, United Kingdom, 06/5/8. https://doi.org/10.1007/11751595_92

Mathematical modeling and tabu search heuristic for the traveling tournament problem. / Lee, Jin Ho; Lee, Young Hoon; Lee, Yun Ho.

Computational Science and Its Applications - ICCSA 2006: International Conference, Proceedings - Part III. Vol. 3982 LNCS Springer Verlag, 2006. p. 875-884 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3982 LNCS).

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

TY - GEN

T1 - Mathematical modeling and tabu search heuristic for the traveling tournament problem

AU - Lee, Jin Ho

AU - Lee, Young Hoon

AU - Lee, Yun Ho

PY - 2006/1/1

Y1 - 2006/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33745899917&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33745899917&partnerID=8YFLogxK

U2 - 10.1007/11751595_92

DO - 10.1007/11751595_92

M3 - Conference contribution

SN - 3540340750

SN - 9783540340751

VL - 3982 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 875

EP - 884

BT - Computational Science and Its Applications - ICCSA 2006

PB - Springer Verlag

ER -

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