Clustering Search Approach for the Traveling Tournament Problem

Abstract

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.

A Variable Neighborhood Search Method for Solving the Traveling Tournaments Problem

“…The best results are in bold font. Clustering [3] the effectiveness of the proposed approach in solving the traveling tournament problem.…”

“…Anagnostopoulos et al provided a simulated algorithm that explores feasible and infeasible schedules using several structures of neighborhoods and complex movements [2]. Biajoli et al proposed a Clustering based approach for TTP [3]. Cceres and Riff proposed an Artificial Immune Algorithm to solve TTP (AIS) [14].…”

Clustering search

“…Biajoli & Lorena [10] apply the CS to a Traveling Tournament Problem (TTP). The 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.…”