Hello,
I have to do some research on Round Robin Tournaments for school. The problem that I have to find a solution for is a Single Round Robin tournament with 52 teams. Here, it is the case that a team specifies pairs of rounds such that the team does not want to play BOTH corresponding matches home or away. For instance, suppose that a team does not want to play the matches in round 1 and round 7 both away or both at home. If a home-away pattern violates this wish, for instance A H H H A H A …, the team is said to incur a break. (Data in attachment)
I now have to find a schedule that minimizes the number of breaks.
I did some research on the internet, but the papers that I found always define a break as follows: "A break occurs whenever a teams plays
two consecutive home games or two consecutive away games"
This is different then in my assignment so I have adapt my solving method. Does anyone know if there are papers specifically about my problem or has an idea how to solve this problem? I have to find an algorithm to find a good solution (but not optimal) and also specify my problem mathematically to find an optimal solution.
Thank you very much in advance!