New models for the Mirrored Traveling Tournament Problem

Authors:
Marco Antonio Moreira De Carvalho;Luiz Antonio Nogueira Lorena
Affiliations:
Ouro Preto Federal University, Campus Morro do Cruzeiro, Ouro Preto 35400-000, MG, Brazil;National Institute for Space Research, São José dos Campos 12227-010, SP, Brazil
Venue:
Computers and Industrial Engineering
Year:
2012

Citing 6
Cited 0

The Traveling Tournament Problem Description and Benchmarks

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
A method for combining complementary techniques for document image segmentation

Pattern Recognition
Constructive algorithms for the constant distance traveling tournament problem

PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
Algorithms for the Bin Packing Problem with Conflicts

INFORMS Journal on Computing
A Benders approach for computing lower bounds for the mirrored traveling tournament problem

Discrete Optimization
Note: Solving mirrored traveling tournament problem benchmark instances with eight teams

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Mirrored Traveling Tournament Problem (mTTP) is a challenging combinatorial optimization problem which consists in generating a timetable for sports tournaments with two half series, what is equivalent to a double round-robin timetable problem. The distance traveled by the teams should be minimized in the final timetable, and a new objective is to minimize the longest distance traveled, named MinMaxTTP. It is proposed an integer programming formulation to the mTTP and two models with dynamic constraints to its solution. Both models are based on the detection of independent sets on conflict graphs, whose use has not been reported in the literature about the problem. Real data benchmarks from a baseball tournament are used in the experiments carried out.