Host: The Japanese Society for Artificial Intelligence
Name : 34th Annual Conference, 2020
Number : 34
Location : Online
Date : June 09, 2020 - June 12, 2020
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.
