2012/05/07 by Hyang Min Jeong, Sang-Woo Kim, Aaram J. Kim +3
Decision Sciences · Economics, Econometrics and Finance · Engineering · Physics and Astronomy · #Constraint (computer-aided design) #Schedule #Scheduling and Timetabling Solutions #Simulated annealing #Sports Analytics and Performance #Tournament #Tournament selection #Vehicle Routing Optimization Methods #physics.data-an #physics.soc-ph
paper · pdf · doi:10.3938/jkps.61.484
published as JKPS Volume 61, Number 3 (2012), 484-492 · 8 pages, 4 figures
arxiv created 2012/05/07 · crossref issued 2012/08/01 · crossref published 2012/08/01 · crossref published-print 2012/08/01 · openalex publication_date 2012/08/01 · crossref created 2012/08/09 · crossref published-online 2012/08/10 · arxiv updated 2012/08/13 · openalex created_date 2016/06/24 · crossref deposited 2025/04/06 · openalex updated_date 2026/08/05 · crossref indexed 2026/08/06
We study the so-called traveling tournament problem (TTP) to find an optimal tournament schedule. Differently from the original TTP, in which the total travel distance of all the participants is the objective function to minimize, we instead seek to maximize the fairness of the round robin tournament schedule of the Korean Baseball League. The standard deviation of the travel distances of teams is defined as the energy function, and the Metropolis Monte-Carlo method combined with the simulated annealing technique is applied to find the ground-state configuration. The resulting tournament schedule is found to satisfy all the constraint rules set by the Korean Baseball Organization, but with drastically increased fairness in traveling distances.