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. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Biajoli, F. L., & Lorena, L. A. N. (2006). Mirrored traveling tournament problem: An evolutionary approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4140 LNAI, pp. 208–217). Springer Verlag. https://doi.org/10.1007/11874850_25
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
