Mirrored Traveling Tournament Problem: An Evolutionary Approach

Abstract

Abstract. The Mirrored Traveling Tournament Problem (mTTP) is an optimization problem that represents certain types of sports timetabling, where the objective is to minimize the total distance traveled by the teams. This work proposes the use of hybrid heuristic to solve the mTTP, using an evolutionary algorithm in association with the metaheuristic Simulated Annealing. It suggests the use of Genetic Algorithm with a compact genetic codification in conjunction with an algorithm to expand the code. The validation of the results will be done in benchmark problems available in literature and real benchmark problems, e.g. Brazilian Soccer Championship.

A Sport Tournament Scheduling by Genetic Algorithm with Swapping Method

“…Many educators were interested in scheduling problem and aimed to study the Traveling Tournament Problem differently (e.g. Zakir H. (2010); Biajoli and Lorena (2006); Falkenauer (1998); Ribeiro and Urrutia (2007); Chartrand and Zhang (2005)). They focused on improving method for solving Traveling Tournament Problem such that their results in scheduling were better approximation than preceding methods such as integer programming, canonical schedules found by Hamiltonian cycles, etc.…”

Clustering Search Approach for the Traveling Tournament Problem

“…Several works in different contexts (see e.g. [2], [3], [5], [9], [13], [16], [17], [18]) tackled the problem of tournament scheduling in different leagues and sports, which contains many interesting discussion on sport scheduling. Basically, the schedule of MLB is a conflict between minimizing travel distances and feasibility constraints on the home/away patterns.…”