Scheduling the Finnish Major Ice Hockey League Using the PEAST Algorithm

  • Kimmo Nurmi
  • Jari Kyngäs
  • Dries Goossens
  • Nico Kyngäs
Chapter

Abstract

Good schedules have many benefits for the league, such as higher incomes, lower costs and more interesting and fairer seasons. Generating a schedule for a professional sports league is an extremely demanding task and requires computational intelligence to generate an acceptable schedule. There are a multitude of stakeholders with varying requests (and often requests vary significantly year on year). This paper presents the format played in the Finnish major ice hockey league in the 2013–2014 season. The paper describes the PEAST algorithm which have been used to schedule the league since the 2008–2009 season. We report our computational results especially for the 2013–2014 season.

Keywords

Local search Metaheuristics PEAST algorithm Real-world scheduling Round robin tournament Sports scheduling 

References

  1. 1.
    K. Nurmi, D. Goossens, T. Bartsch, F. Bonomo, D. Briskorn, G. Duran, J. Kyngäs, J. Marenco, C.C. Ribeiro, F.C.R. Spieksma, S. Urrutia, R. Wolf-Yadlin, A Framework for Scheduling Professional Sports Leagues, in IAENG Transactions on Engineering Technologies, vol. 5, ed. by S.I. Ao (Springer, USA, 2010)Google Scholar
  2. 2.
    P. Rasmussen, M. Trick, Round robin scheduling—a survey. Eur. J. Oper. Res. 188, 617–636 (2008)CrossRefMATHMathSciNetGoogle Scholar
  3. 3.
    G. Kendall, S. Knust, C.C. Ribeiro, S. Urrutia, Scheduling in sports: an annotated bibliography. Comput. Oper. Res. 37, 1–19 (2010)CrossRefMATHMathSciNetGoogle Scholar
  4. 4.
    D. de Werra, Scheduling in Sports, in Studies on Graphs and Discrete Programming, ed. by P. Hansen (Elsevier, Amsterdam, 1981), pp. 381–395CrossRefGoogle Scholar
  5. 5.
    K. Easton, G. Nemhauser, M. Trick, The traveling tournament problem: description and benchmarks, in Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming, Paphos, pp. 580–584 (2001)Google Scholar
  6. 6.
    C. Thielen, S. Westphal, Complexity of the traveling tournament problem. Theoret. Comput. Sci. 412(4–5), 345–351 (2011)CrossRefMATHMathSciNetGoogle Scholar
  7. 7.
    K. Nurmi et al., Sports Scheduling Problem [Online]. Available http://www.samk.fi/ssp. Last update 7 Mar 2013
  8. 8.
    N. Kyngäs, K. Nurmi, J. Kyngäs, Solving the person-based multitask shift generation problem with breaks, in Proceedings of the 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO), Hammamet, Tunis (2013)Google Scholar
  9. 9.
    N. Kyngäs, K. Nurmi, E.I. Ásgeirsson, J. Kyngäs, Using the PEAST algorithm to Roster nurses in an intensive-care unit in a Finnish hospital, in Proceedings of the 9th Conference on the Practice and Theory of Automated Timetabling, Son, Norway (2012)Google Scholar
  10. 10.
    N. Kyngäs, K. Nurmi, J. Kyngäs, Optimizing large-scale staff rostering instances, in Proceedings of the International MultiConference of Engineers and Computer Scientists 2012, IMECS 2012, Hong Kong, 14–16 Mar 2012. Lecture Notes in Engineering and Computer Science, pp. 1524–1531Google Scholar
  11. 11.
    K. Nurmi, J. Kyngäs, A conversion scheme for turning a curriculum-based timetabling problem into a school timetabling problem, in Proceedings of the 7th Conference on the Practice and Theory of Automated Timetabling (PATAT), Montreal, Canada (2008)Google Scholar
  12. 12.
    N. Kyngäs, K. Nurmi, J. Kyngäs, Crucial components of the PEAST algorithm in solving real-world scheduling problems, in Proceedings of the 2nd International Conference on Software and Computer Applications, Paris, France (2013)Google Scholar
  13. 13.
    S. Lin, B.W. Kernighan, An effective heuristic for the traveling salesman problem. Oper. Res. 21, 498–516 (1973)CrossRefMATHMathSciNetGoogle Scholar
  14. 14.
    F. Glover, New ejection chain and alternating path methods for traveling salesman problems, in Computer Science and Operations Research: New Developments in their Interfaces, ed. by R. Sharda, O. Balci, S.A. Zenios (Elsevier, Amsterdam, 1992), pp. 449–509Google Scholar
  15. 15.
    P. Cowling, G. Kendall, E. Soubeiga, A hyperheuristic approach to scheduling a sales summit, in Proceedings of the 3rd International Conference on the Practice and Theory of Automated Timetabling (PATAT), pp. 176–190 (2000)Google Scholar
  16. 16.
    K. Nurmi, Genetic Algorithms for Timetabling and Traveling Salesman Problems, Ph.D. Dissertation, Department of Applied Mathematics, University of Turku, Finland, 1998. Available http://www.bit.spt.fi/cimmo.nurmi/
  17. 17.
    K. Nurmi, J. Kyngäs, D. Goossens, N. Kyngäs, Scheduling a professional sports league using the PEAST algorithm, in Proceedings of the International MultiConference of Engineers and Computer Scientists 2014, IMECS 2014, Hong Kong, 12–14 Mar 2014. Lecture Notes in Engineering and Computer Science, pp. 1176–1182Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2015

Authors and Affiliations

  • Kimmo Nurmi
    • 1
  • Jari Kyngäs
    • 1
  • Dries Goossens
    • 2
  • Nico Kyngäs
    • 1
  1. 1.Satakunta University of Applied SciencesPoriFinland
  2. 2.Faculty of Economics and Business AdministrationGhent UniversityGhentBelgium

Personalised recommendations