A complete search method for the relaxed traveling tournament problem

• Tipo: Artigo em Revista Científica Internacional
• Data: 2014

Autores

Filipe Brandão (Autor) Outra; João Pedro Pedroso (Autor) FCUP

Revista

Título: EURO Journal on Computational Optimization

Vol. 2

Páginas: 77-86

ISSN: 2192-4406

Editora: Elsevier

Indexação

Scopus - 6 Citações

Outras Informações

ID Authenticus: P-00K-044

DOI: 10.1007/s13675-013-0010-3

Abstract (EN): The traveling tournament problem is a sports scheduling problem that includes two major issues in creating timetables: home/away pattern feasibility and travel distance. In this problem, the schedule must be compact: every team plays in every time slot. However, there are some sports leagues that have both home/away pattern restrictions and distance limits, but do not require a compact schedule. In such schedules, one or more teams can have a bye in any time slot. This leads us to a variant of the problem: the relaxed traveling tournament problem. We present a complete search method to solve this problem based on branch-and-bound, metaheuristics and dynamic programming. © 2013, Springer-Verlag Berlin Heidelberg and EURO - The Association of European Operational Research Societies.

Idioma: Inglês

Tipo (Avaliação Docente): Científica