Traveling Baseball Players' Problem in Korea

摘要: We study the so-called traveling tournament problem (TTP), to find an optimal schedule. Differently from original TTP, in which total travel distance of all participants is objective function minimize, we instead seek maximize fairness round robin schedule Korean Baseball League. The standard deviation distances teams defined as energy function, and Metropolis Monte-Carlo method combined with simulated annealing technique applied ground state configuration. resulting found satisfy constraint rules set by Organization, but drastically increased distances.