TY - GEN
T1 - A hybrid local search approach in solving the mirrored Traveling Tournament Problem
AU - Wei, W.
AU - Fujimura, S.
AU - Wei, X.
AU - Ding, C. H.
PY - 2010/12/31
Y1 - 2010/12/31
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
AN - SCOPUS:78650599962
SN - 9781424464814
T3 - Proceedings - 2010 IEEE 17th International Conference on Industrial Engineering and Engineering Management, IE and EM2010
SP - 620
EP - 624
BT - Proceedings - 2010 IEEE 17th International Conference on Industrial Engineering and Engineering Management, IE and EM2010
T2 - 17th International Conference on Industrial Engineering and Engineering Management, IE and EM2010
Y2 - 29 October 2010 through 31 October 2010
ER -