Brazilian Soccer Championship

 

Problem constraints
Problem data
Solutions
Publications
This Site is dedicated to the research of techniques for solving the First Division of Brazilian Soccer Championship.

The Brazilian Soccer Schedule Problem (BSSP) is a double round robin tournament for n teams, composed by two halves schedules, each one consisting of n-1 rounds where every team plays against all others once. The double round robin schedule will be mirrored from the first half to the second. If A plays at B in the first half of the schedule, then B plays at A in the corresponding slot in the second half.

The main objective is to minimize the total distance traveled, plus the difference between that one who travels the most and the one who travels the least (teams begin in their home city and must return there after the championship ending)

 

 

_____________________________

Main page

____________________________