A hybrid local search approach in solving the mirrored Traveling Tournament Problem

W. Wei, Shigeru Fujimura, X. Wei, C. H. Ding

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

2 Citations (Scopus)

Abstract

Scheduling for modern professional sports leagues has drawn considerable attention in recent years in that their practical applications involve significant revenues and generate challenging combinatorial optimization problems. The Traveling Tournament Problem is a sports scheduling problem that abstracts the important issues in creating time tables: feasibility and team travel, where the objective is to minimize the total distance traveled by the teams. In this paper, we tackle the mirrored version of this problem. First, an effective and comprehensive constructive algorithm is applied which quickly obtains initial solution at a very high quality. Then a hybrid local search approach was proposed based on the combination of Tabu Search and Variable Neighborhood Descent meta-heuristic, together with Greedy Randomized Adaptive Search Procedure, which explores large neighborhood with various and effective moves. Very competitive solutions are obtained for benchmark instances within a reasonable amount of time compared with previous results in the literature.

Original languageEnglish
Title of host publicationProceedings - 2010 IEEE 17th International Conference on Industrial Engineering and Engineering Management, IE and EM2010
Pages620-624
Number of pages5
DOIs
Publication statusPublished - 2010
Event17th International Conference on Industrial Engineering and Engineering Management, IE and EM2010 - Xiamen
Duration: 2010 Oct 292010 Oct 31

Other

Other17th International Conference on Industrial Engineering and Engineering Management, IE and EM2010
CityXiamen
Period10/10/2910/10/31

Fingerprint

Sports
Scheduling
Tabu search
Combinatorial optimization

Keywords

  • Hybrid local search
  • Meta-heuristic
  • Sports scheduling
  • Tabu search
  • Traveling Tournament Problem

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering

Cite this

Wei, W., Fujimura, S., Wei, X., & Ding, C. H. (2010). A hybrid local search approach in solving the mirrored Traveling Tournament Problem. In Proceedings - 2010 IEEE 17th International Conference on Industrial Engineering and Engineering Management, IE and EM2010 (pp. 620-624). [5646539] https://doi.org/10.1109/ICIEEM.2010.5646539

A hybrid local search approach in solving the mirrored Traveling Tournament Problem. / Wei, W.; Fujimura, Shigeru; Wei, X.; Ding, C. H.

Proceedings - 2010 IEEE 17th International Conference on Industrial Engineering and Engineering Management, IE and EM2010. 2010. p. 620-624 5646539.

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

Wei, W, Fujimura, S, Wei, X & Ding, CH 2010, A hybrid local search approach in solving the mirrored Traveling Tournament Problem. in Proceedings - 2010 IEEE 17th International Conference on Industrial Engineering and Engineering Management, IE and EM2010., 5646539, pp. 620-624, 17th International Conference on Industrial Engineering and Engineering Management, IE and EM2010, Xiamen, 10/10/29. https://doi.org/10.1109/ICIEEM.2010.5646539
Wei W, Fujimura S, Wei X, Ding CH. A hybrid local search approach in solving the mirrored Traveling Tournament Problem. In Proceedings - 2010 IEEE 17th International Conference on Industrial Engineering and Engineering Management, IE and EM2010. 2010. p. 620-624. 5646539 https://doi.org/10.1109/ICIEEM.2010.5646539
Wei, W. ; Fujimura, Shigeru ; Wei, X. ; Ding, C. H. / A hybrid local search approach in solving the mirrored Traveling Tournament Problem. Proceedings - 2010 IEEE 17th International Conference on Industrial Engineering and Engineering Management, IE and EM2010. 2010. pp. 620-624
@inproceedings{6f9ba5209d90445dbc92ad0b3cb19532,
title = "A hybrid local search approach in solving the mirrored Traveling Tournament Problem",
abstract = "Scheduling for modern professional sports leagues has drawn considerable attention in recent years in that their practical applications involve significant revenues and generate challenging combinatorial optimization problems. The Traveling Tournament Problem is a sports scheduling problem that abstracts the important issues in creating time tables: feasibility and team travel, where the objective is to minimize the total distance traveled by the teams. In this paper, we tackle the mirrored version of this problem. First, an effective and comprehensive constructive algorithm is applied which quickly obtains initial solution at a very high quality. Then a hybrid local search approach was proposed based on the combination of Tabu Search and Variable Neighborhood Descent meta-heuristic, together with Greedy Randomized Adaptive Search Procedure, which explores large neighborhood with various and effective moves. Very competitive solutions are obtained for benchmark instances within a reasonable amount of time compared with previous results in the literature.",
keywords = "Hybrid local search, Meta-heuristic, Sports scheduling, Tabu search, Traveling Tournament Problem",
author = "W. Wei and Shigeru Fujimura and X. Wei and Ding, {C. H.}",
year = "2010",
doi = "10.1109/ICIEEM.2010.5646539",
language = "English",
isbn = "9781424464814",
pages = "620--624",
booktitle = "Proceedings - 2010 IEEE 17th International Conference on Industrial Engineering and Engineering Management, IE and EM2010",

}

TY - GEN

T1 - A hybrid local search approach in solving the mirrored Traveling Tournament Problem

AU - Wei, W.

AU - Fujimura, Shigeru

AU - Wei, X.

AU - Ding, C. H.

PY - 2010

Y1 - 2010

N2 - Scheduling for modern professional sports leagues has drawn considerable attention in recent years in that their practical applications involve significant revenues and generate challenging combinatorial optimization problems. The Traveling Tournament Problem is a sports scheduling problem that abstracts the important issues in creating time tables: feasibility and team travel, where the objective is to minimize the total distance traveled by the teams. In this paper, we tackle the mirrored version of this problem. First, an effective and comprehensive constructive algorithm is applied which quickly obtains initial solution at a very high quality. Then a hybrid local search approach was proposed based on the combination of Tabu Search and Variable Neighborhood Descent meta-heuristic, together with Greedy Randomized Adaptive Search Procedure, which explores large neighborhood with various and effective moves. Very competitive solutions are obtained for benchmark instances within a reasonable amount of time compared with previous results in the literature.

AB - Scheduling for modern professional sports leagues has drawn considerable attention in recent years in that their practical applications involve significant revenues and generate challenging combinatorial optimization problems. The Traveling Tournament Problem is a sports scheduling problem that abstracts the important issues in creating time tables: feasibility and team travel, where the objective is to minimize the total distance traveled by the teams. In this paper, we tackle the mirrored version of this problem. First, an effective and comprehensive constructive algorithm is applied which quickly obtains initial solution at a very high quality. Then a hybrid local search approach was proposed based on the combination of Tabu Search and Variable Neighborhood Descent meta-heuristic, together with Greedy Randomized Adaptive Search Procedure, which explores large neighborhood with various and effective moves. Very competitive solutions are obtained for benchmark instances within a reasonable amount of time compared with previous results in the literature.

KW - Hybrid local search

KW - Meta-heuristic

KW - Sports scheduling

KW - Tabu search

KW - Traveling Tournament Problem

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

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

U2 - 10.1109/ICIEEM.2010.5646539

DO - 10.1109/ICIEEM.2010.5646539

M3 - Conference contribution

SN - 9781424464814

SP - 620

EP - 624

BT - Proceedings - 2010 IEEE 17th International Conference on Industrial Engineering and Engineering Management, IE and EM2010

ER -