We present a complete search method to solve this problem based on branch-and-bound, metaheuristics and dynamic programming.
We present a complete search method to solve this problem based on branch-and-bound, metaheuristics and dynamic programming.
The Traveling Tournament Problem (TTP) is a sports schedul- ing problem that includes two major issues in creating timetables: home/away pattern feasibility�...
Abstract The Traveling Tournament Problem (TTP) is a sports scheduling problem that includes two major issues in creating timetables: home/away.
People also ask
What is the traveling tournament problem?
Abstract The Traveling Tournament Problem (TTP) is a sports scheduling problem that encapsulates two major aspects of some sports leagues: restrictions on�...
The Traveling Tournament Problem is a sports timetabling problem requiring production of a minimum,distance double round robin tournament,for a group of n teams�...
Several techniques have been applied to solve TTP in- stances, including local search techniques as well as in- teger and constraint programming. Solutions�...
by reducing the total distance traveled using a quick local search strategy. ... An evolutionary tabu search algorithm and the NHL scheduling problem. INFOR�...
Our solution methodology for the TTP is a branch-and-price (column gener- ation) algorithm in which individual team tours are the columns. In branch-and- price,�...
Brando, F. and Pedroso, J. (2013). A complete search method for the relaxed traveling tournament problem. EURO Journal on Computational Optimization.