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

W. Wei, S. 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 Dec 31
Event17th International Conference on Industrial Engineering and Engineering Management, IE and EM2010 - Xiamen, China
Duration: 2010 Oct 292010 Oct 31

Publication series

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

Conference

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

Keywords

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

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering

Fingerprint Dive into the research topics of 'A hybrid local search approach in solving the mirrored Traveling Tournament Problem'. Together they form a unique fingerprint.

  • 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] (Proceedings - 2010 IEEE 17th International Conference on Industrial Engineering and Engineering Management, IE and EM2010). https://doi.org/10.1109/ICIEEM.2010.5646539