Scheduling Sport Leagues using Branch-and-Price

A single round robin tournament can be described as a league of a set T of n teams (n even) to be scheduled such that each team plays exactly once against each other team and such that each team plays exactly once per period resulting in a set P of n — 1 periods. Matches are carried out at one of both opponents' stadiums. A team playing twice at home or twice away in two consecutive periods is said to have a break in the latter of both periods. There is a vast field of requests arising in real world problems. For example, the number of breaks is to be minimized due to fairness reasons. It is well known that at least n — 2 breaks must occur. We focus on schedules having the minimum number of breaks. Costs corresponding to each possible match are given and the objective is to minimize the sum of arranged matches' cost. Then, sports league scheduling can be seen as a hard combinatorial optimization problem. We develop a branch & price approach in order to find optimal solutions.

[1]  Jack Edmonds,et al.  Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[2]  George L. Nemhauser,et al.  Solving binary cutting stock problems by column generation and branch-and-bound , 1994, Comput. Optim. Appl..

[3]  D. Werra.  Scheduling in Sports , 1981 .

[4]  Frits C. R. Spieksma,et al.  Round robin tournaments and three index assignment , 2005 .

[5]  Andreas Drexl,et al.  Scheduling the professional soccer leagues of Austria and Germany , 2006, Comput. Oper. Res..

[6]  Bruce T. Lowerre,et al.  The HARPY speech recognition system , 1976 .

[7]  Michael A. Trick.  Integer and Constraint Programming Approaches for Round-Robin Tournament Scheduling , 2002, PATAT.

[8]  William J. Cook,et al.  Computing Minimum-Weight Perfect Matchings , 1999, INFORMS J. Comput..

[9]  Dirk Briskorn,et al.  Branching Based on Home-Away-Pattern Sets , 2006, OR.

[10]  Jan A. M. Schreuder,et al.  Combinatorial aspects of construction of competition Dutch Professional Football Leagues , 1992, Discret. Appl. Math..

[11]  Michael A. Trick,et al.  A Column Generation Approach for Graph Coloring , 1996, INFORMS J. Comput..

[12]  Peter Brucker,et al.  Complex Scheduling , 2006 .

[13]  J. A. M. Schreuder,et al.  Constructing timetables for sport competitions , 1980 .

[14]  Steven Michael Rubin,et al.  The argos image understanding system. , 1978 .

[15]  Dominique de Werra,et al.  Geography, games and graphs , 1980, Discret. Appl. Math..

[16]  Leon S. Lasdon,et al.  Optimization Theory of Large Systems , 1970 .

[17]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[18]  Sigrid Knust,et al.  Sports league scheduling: Graph- and resource-based models , 2007 .

[19]  Dominique de Werra,et al.  Minimizing irregularities in sports schedules using graph theory , 1973, Discret. Appl. Math..

[20]  Dominique de Werra,et al.  Some models of graphs for scheduling sports competitions , 1988, Discret. Appl. Math..

[21]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

[22]  Prince Camille de Polignac.  On a Problem in Combinations , 1866 .

[23]  Dominique de Werra,et al.  On the multiplication of divisions: The use of graphs for sports scheduling , 1985, Networks.

[24]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[25]  Dominique de Werra,et al.  Construction of sports schedules with multiple venues , 2006, Discret. Appl. Math..

[26]  Tomomi Matsui,et al.  Characterizing Feasible Pattern Sets with a Minimum Number of Breaks , 2002, PATAT.