Clustering search approach for the traveling tournament problem

Authors:
Fabrìcio Lacerda Biajoli;Luiz Antonio Nogueira Lorena
Affiliations:
Instituto Nacional de Pesquisas Espaciais, Laboratório Associado de Computação e Matemática Aplicada, São José dos Campos, SP, Brasil;Instituto Nacional de Pesquisas Espaciais, Laboratório Associado de Computação e Matemática Aplicada, São José dos Campos, SP, Brasil
Venue:
MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
Year:
2007

Citing 7
Cited 0

Variable neighborhood search

Computers and Operations Research
Solving the Sports League Scheduling Problem with Tabu Search

ECAI '00 Proceedings of the Workshop on Local Search for Planning and Scheduling-Revised Papers
The Traveling Tournament Problem Description and Benchmarks

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Scheduling a Major College Basketball Conference

Operations Research
Mirrored traveling tournament problem: an evolutionary approach

IBERAMIA-SBIA'06 Proceedings of the 2nd international joint conference, and Proceedings of the 10th Ibero-American Conference on AI 18th Brazilian conference on Advances in Artificial Intelligence
Pattern sequencing problems by clustering search

IBERAMIA-SBIA'06 Proceedings of the 2nd international joint conference, and Proceedings of the 10th Ibero-American Conference on AI 18th Brazilian conference on Advances in Artificial Intelligence
Traveling tournament scheduling: a systematic evaluation of simulated annealling

CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Traveling Tournament Problem (TTP) is an optimization problem that represents some types of sports timetabling, where the objective is to minimize the total distance traveled by the teams. This work proposes the use of a hybrid heuristic to solve the mirrored TTP (mTTP), called Clustering Search (*CS), that consists in detecting supposed promising search areas based on clustering. The validation of the results will be done in benchmark problems available in literature and real benchmark problems, e.g. Brazilian Soccer Championship.