The traveling tournament problem with predefined venues

Melo, Rafael A.; Urrutia, Sebastián; Ribeiro, Celso C.

doi:10.1007/s10951-008-0097-1

Cited by 23 publications

(20 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The same 40 instances considered by Melo et al (2009) were used in the computational experiments: 20 instances with 18 teams and 20 instances with 20 teams. Distances are the same as in instances circ18 and circ20 of the TTP, both of them available from Trick (2009).…”

Section: Resultsmentioning

confidence: 99%

“…For each instance size (i.e., the number n of teams), 20 distinct home-away assignments were created: ten out of the 20 assignments are balanced (i.e., each team plays at least n/2 − 1 home games and at least n/2 − 1 away games), while the remaining ten assignments are unbalanced. Two instances of each size were shown to be infeasible by Melo et al (2009). In the first experiment, we compare the performance of the heuristic when using the canonical edge coloring and an edge coloring produced by the general Vizing method to build the initial solution.…”

Section: Resultsmentioning

confidence: 99%

“…In the following, we consider that the HAA is fixed and known beforehand. Melo et al (2009) introduced the Traveling Tournament Problem with Predefined Venues (TTPPV). This variant of the TTP considers a single round robin tournament, in which the venues where the games take place are known beforehand.…”

mentioning

confidence: 99%

“…Instances of the TTPPV with up to eight teams were solved to optimality by the integer programming formulations presented in Melo et al (2009). Since feasible solutions have not been found by a commercial solver (CPLEX 10.0) in two hours of running time for instances with 18 or more teams, four heuristics based on the integer programming formulations were also developed in Melo et al (2009).…”

mentioning

confidence: 99%

“…Since feasible solutions have not been found by a commercial solver (CPLEX 10.0) in two hours of running time for instances with 18 or more teams, four heuristics based on the integer programming formulations were also developed in Melo et al (2009).…”

mentioning

confidence: 99%

See 4 more Smart Citations

An ILS heuristic for the traveling tournament problem with predefined venues

2010

Self Cite

View full text Add to dashboard Cite

The Traveling Tournament Problem with Predefined Venues (TTPPV) is a single round robin variant of the Traveling Tournament Problem, in which the venue of each game to be played is known beforehand. We propose an Iterated Local Search (ILS) heuristic for solving real-size instances of the TTPPV, based on two types of moves. Initial solutions are derived from an edge coloring algorithm applied to complete graphs. We showed that canonical edge colorings should not be used as initial solutions in some situations. Instead, the use of Vizing's edge coloring method lead to considerably better results. We also establish that the solution space defined by some commonly used neighborhoods in the sport scheduling literature is not connected in the case of single round robin tournaments, which explains the hardness of finding high quality solutions to some problem instances. Computational results show that the new ILS heuristic performs much better than heuristics based on integer programming and that it improves the best known solutions for benchmark instances.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Resultsmentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

See 3 more Smart Citations