[3J4-J-1] Fundamental AI, theory: search and application

[3J4-J-1-04] League Scheduling for U12 Basketball

〇Tenda Okimoto¹, Kazuki Nishimura¹, Katsutoshi Hirayama¹ (1. Kobe University)

Keywords:Sports Scheduling, Combinatorial Optimization Problem

Sports Scheduling is one of the widely investigated application problems in Artificial Intelligence and Operations Research. This problem can be represented as a combinatorial optimization problem, in which the date and the venue of each game must be determined, subject to a given set of constraints. In 2018, Japan Basketball Association (JBA) has started to implementing the league games in the prefectures. In this paper, a formal framework for U12 Basketball League Scheduling (BLSU12) problem is introduced. Furthermore, a novel solution criteria called egalitarian solution for BLSU12 is defined. In the experiments, we use the real data of U12 basketball league games played in Hyogo prefecture in 2018 and find an optimal league scheduling which can reduce the total travel distance of teams compared to that of actually used. An egalitarian solution for the total travel distance is also provided.