Title :
Professional sporting scheduling Optimization system based on the shortest traveling cost
Author :
Hung, Jason C. ; Yen, Neil Y. ; Chien, Kuo-Hsin
Author_Institution :
Dept. of Inf. Manage., Overseas Chinese Univ., Taiwan
Abstract :
The arrangement of the professional sports schedules is a hard work and takes much time to a sports schedule planner because we must considered many and complicated factors. In this study, gene algorithm is used to solve the Constraint Satisfaction Problem (CSP) of sports schedules and we analysis the battle combination constraints of the NBA and NHL. Then, we summarized these constraints and develop a scheduling system to make the sports schedules automatically by setting parameters. Because the constraints were parameterized, therefore the system could serve more than one professional sports league. Finally, this study simulates the NBA schedules in 2009 and compared it with official one to proof this study is effective and superior to official.
Keywords :
constraint theory; genetic algorithms; operations research; scheduling; sport; travelling salesman problems; NBA; NHL; battle combination constraints; constraint satisfaction problem; gene algorithm; professional sporting scheduling optimization system; shortest traveling cost; Algorithm design and analysis; Computer science; Cost function; Heuristic algorithms; Information analysis; Information management; Processor scheduling; Scheduling algorithm; Statistics; System testing;
Conference_Titel :
Ubi-media Computing (U-Media), 2010 3rd IEEE International Conference on
Conference_Location :
Jinhua
Print_ISBN :
978-1-4244-6708-2
DOI :
10.1109/UMEDIA.2010.5544461
