Advertisement

Constructing Sailing Match Race Schedules: Round-Robin Pairing Lists

  • Craig Macdonald
  • Ciaran McCreesh
  • Alice Miller
  • Patrick ProsserEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9255)

Abstract

We present a constraint programming solution to the problem of generating round-robin schedules for sailing match races. Our schedules satisfy the criteria published by the International Sailing Federation (ISAF) governing body for match race pairing lists. We show that some published ISAF schedules are in fact illegal, and present corresponding legal instances and schedules that have not previously been published. Our schedules can be downloaded as blanks, then populated with actual competitors and used in match racing competitions.

Keywords

Time Slot Constraint Model Port Side Perfect Balance Pairing List 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Henz, M., Müller, T., Thiel, S.: Global constraints for round robin tournament scheduling. European Journal of Operational Research 153(1), 92–101 (2004)zbMATHMathSciNetCrossRefGoogle Scholar
  2. 2.
    International Sailing Federation. ISAF International Umpires’ and Match Racing Manual (2012)Google Scholar
  3. 3.
    Lombardi, M., Milano, M.: Optimal methods for resource allocation and scheduling: a cross-disciplinary survey. Constraints 17(1), 51–85 (2012)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Pesant, G.: A regular language membership constraint for finite sequences of variables. In: Proceedings of the 10th International Conference on Principles and Practice of Constraint Programming, CP 2004, Toronto, Canada, September 27-October 1, pp. 482–495 (2004)Google Scholar
  5. 5.
    Quimper, C.-G., van Beek, P., López-Ortiz, A., Golynski, A., Sadjad, S.B.S.: An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 600–614. Springer, Heidelberg (2003) CrossRefGoogle Scholar
  6. 6.
    Rasmussen, R.V., Trick, M.A.: Round robin scheduling - a survey. European Journal of Operational Research 188(3), 617–636 (2008)zbMATHMathSciNetCrossRefGoogle Scholar
  7. 7.
    Trick, M.A.: Integer and Constraint Programming Approaches for Round-Robin Tournament Scheduling. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 63–77. Springer, Heidelberg (2003) CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Craig Macdonald
    • 1
  • Ciaran McCreesh
    • 1
  • Alice Miller
    • 1
  • Patrick Prosser
    • 1
    Email author
  1. 1.University of GlasgowGlasgowScotland

Personalised recommendations