On the application of graph colouring techniques in round-robin sports scheduling

  • Authors:

  • R. Lewis;J. Thompson

  • Affiliations:

  • Operational Research Group, Cardiff School of Mathematics, Prifysgol Caerdydd/Cardiff University, Cardiff CF24 4AG, Wales, UK;Operational Research Group, Cardiff School of Mathematics, Prifysgol Caerdydd/Cardiff University, Cardiff CF24 4AG, Wales, UK

  • Venue:
  • Computers and Operations Research
  • Year:
  • 2011

Quantified Score

Hi-index 0.01

Visualization

Abstract

The purpose of this paper is twofold. First, it explores the issue of producing valid, compact round-robin sports schedules by considering the problem as one of graph colouring. Using this model, which can also be extended to incorporate additional constraints, the difficulty of such problems is then gauged by considering the performance of a number of different graph colouring algorithms. Second, neighbourhood operators are then proposed that can be derived from the underlying graph colouring model and, in an example application, we show how these operators can be used in conjunction with multi-objective optimisation techniques to produce high-quality solutions to a real-world sports league scheduling problem encountered at the Welsh Rugby Union in Cardiff, Wales.