------- Optline Integer and Combinatorial Optimization -------

Home

Problem Data

Best Solutions History

The Current Best Solution

Optline Integer and Combinatorial Optimization
Caixa Postal 37.846 - 22.640-970 - Rio de Janeiro - RJ - Brazil
Phone: 55-21-9379-5360
E-mail: optline@optline.com.br

CONSTRAINTS FOR BSSP

The BSSP is more constrained than the original TTP, and we must minimize a multi-objectiv function. They may be enumerated as follows:

Constraints

Each team will play once at each round
Two teams will play twice, but in different halves of the schedule, alternating the city that will host the game (if they are different)
There won't be more than two consecutive home or two consecutive road games for any team
The difference between home and road games must be equal to one, in each half of the schedule

More...

Each team will alternate playing one game at home and the other on the road, at the first two rounds of each half of the schedule
The two last rounds of each half of the schedule will have the inverse configuration of the two first rounds, related to home and on the road games
Two teams from the same State will not play against each other on the last round (46th) of the schedule.

Multi-Objective Function

The main objective is to minimize the total distance travelled, 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).