Brando, F. and Pedroso, J. (2013). A complete search method for the relaxed traveling tournament problem. EURO Journal on Computational Optimization.

Preprint (PDF) (the final publication is available at SpringerLink)

Abstract

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.

BibTeX

@article{RTTPSolver,
    author={Brand\~ao, Filipe and Pedroso, J. P.},
    title={A complete search method for the relaxed traveling tournament problem},
    year={2013},
    issn={2192-4406},
    journal={EURO Journal on Computational Optimization},
    doi={10.1007/s13675-013-0010-3},
    url={http://dx.doi.org/10.1007/s13675-013-0010-3},
    publisher={Springer-Verlag},
    keywords={Traveling tournament problem; Branch-and-bound; Metaheuristics; Dynamic programming; 90-08 Computational methods; 90-XX Operations research; mathematical programming},
    pages={1-10},
    language={English}
}