Scheduling sports competitions at multiple venues – Revisited

In this work, we study scheduling sports competitions at multiple venues, a problem recently introduced by Urban and Russell. The distinguishing feature of the problem is that venues come into play when scheduling. We develop beam search and simulated annealing approaches to the problem and its extension. Computational experiments were conducted and algorithms compared and analyzed. We found that the simulated annealing algorithm with specialized neighborhood moves achieved superior solutions in significantly shorter times than the method of Urban and Russell.