1 329

Cited 6 times in

Mathematical modeling and tabu search heuristic for the traveling tournament problem

Authors
 Jin Ho Lee  ;  Young Hoon Lee  ;  Yun Ho Lee 
Citation
 Lecture Notes in Computer Science, Vol.3982 : 875-884, 2006 
Journal Title
Lecture Notes in Computer Science
ISSN
 0302-9743 
Issue Date
2006
Keywords
Integer Programming ; Tabu Search ; Tabu Search Algorithm ; National Basketball Association ; Tabu Search Heuristic
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.
Full Text
http://link.springer.com/chapter/10.1007/11751595_92#
DOI
10.1007/11751595_92
Appears in Collections:
1. College of Medicine (의과대학) > Dept. of Neurosurgery (신경외과학교실) > 1. Journal Papers
Yonsei Authors
Lee, Yun Ho(이윤호)
URI
https://ir.ymlib.yonsei.ac.kr/handle/22282913/110825
사서에게 알리기
  feedback

qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse

Links