[2N6-GS-1] Fundamental AI, theory: Constraint satisfaction and optimization

[2N6-GS-1-02] Break Minimization Problem for U12 Basketball League

Ryuta Inoue¹, 〇Tenda Okimoto¹, Katsutoshi Hirayama¹ (1. Kobe University)

Keywords:Sports Scheduling, Break Minimization Problem, U12 Basketball League

Break minimization problem is one of the representative problems in sport scheduling. The aim of this problem is to find a home-away assignment that minimizes the number of breaks, that is, the number of occurrences of consecutive games held either both at away or both at home for a team. In this paper, Break Minimization Problem of U12 basketball league games (BMPU12) is first introduced. In the experiments, we utilize the real data of U12 basketball league games played in Hyogo prefecture in 2018 and find the minimal number of breaks for it.