Article ID: | iaor1993155 |
Country: | United Kingdom |
Volume: | 43 |
Issue: | 3 |
Start Page Number: | 195 |
End Page Number: | 201 |
Publication Date: | Mar 1992 |
Journal: | Journal of the Operational Research Society |
Authors: | Wright M. |
Keywords: | heuristics, optimization: simulated annealing, scheduling |
Each team in the English County Cricket Championship plays against some other teams twice a year, and others only once. This paper describes a case study whose aim was to overcome this inherent unfairness by producing a four-year schedule of opponents which was as fair as possible, and could be easily seen to be fair, while still allowing for traditional rivalries. The schedule also needed to be satisfactory in regard to several other constraints and objectives. Various simple heuristics were used; these are described in some detail. Of particular interest is the effectiveness of a ‘local non-worsening’ approach when the objective is to find any feasible solution. This is equivalent to simulated annealing at a constant temperature of absolute zero.