Unlike other NP-hard problems, the constraints on the traveling tournament problem are so
pressing that it's hardly possible to randomly generate a valid solution, for example, to use in …

Because it's impossible to generate an initial population of valid individuals. When one
million random instances are made, the number of constraint violations increases …

The traveling tournament problem is a well-known sports league scheduling problem
famous for its practical hardness. Given an even number of teams with symmetric distances …

The well-known traveling tournament problem is a hard optimization problem in which a
double round robin sports league schedule has to be constructed while minimizing the total …

This work presents an iterative-deepening A∗(IDA∗) based approach to the traveling
tournament problem (TTP). The TTP is a combinatorial optimization problem which abstracts …

This paper proposes an enhanced genetic algorithm (E-GA) with a new crossover operator
for the well-known NP-hard traveling tournament problem (TTP). TTP is the problem of …

The travelling tournament problem (TTP) is an important and well-known problem within the
collective sports research community. The problem is NP-hard which makes difficult finding …

The traveling tournament problem is a well-known and important problem within the
collective sports communities. This is a NP-hard problem which makes difficult finding …

Modern society pays more and more attention to leisure activities, and watching sports is
one of the most popular activities for people. In professional leagues, sports scheduling …

Abstract The Traveling Tournament Problem (TTP) is concerned with finding a double round-
robin tournament schedule that minimizes the total distances traveled by the teams. It has …