Traveling baseball players’ problem in Korea
- 172 Downloads
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.
KeywordsMonte-Carlo simulation Optimization Traveling salesman problem Traveling tournament problem Sports tournament Baseball league
Unable to display preview. Download preview PDF.
- M. Dorigo and T. Stüzle, Ant Colony Optimization (Bradford Books, 2004).Google Scholar
- P. Chen, G. Kendall and G. Berghe, in SCIS07 (IEEE, April 1–5, 2007), p. 19.Google Scholar
- M. Trick, Practice and Theory of Automated Timetabling III (Springer, 2001), p. 242.Google Scholar
- J. Rawls, A Theory of Justice (Oxford University Press, Oxford, 1999).Google Scholar
- R. Dworkin, Sovereign Virtue: The Theory and Practice of Equality (Harvard University Press, Cambridge, 2002).Google Scholar