  The Traveling Tournament Problem(TTP) is a combinatorial optimization problem
where we have to give a scheduling algorithm which minimizes the total distance
traveled by all the participating teams of a double round-robin tournament
maintaining given constraints. Most of the instances of this problem with more
than ten teams are still unsolved. By definition of the problem the number of
teams participating has to be even. There are different variants of this
problem depending on the constraints. In this problem, we consider the case
where number of teams is a multiple of four and a team can not play more than
two consecutive home or away matches. Our scheduling algorithm gives better
result than the existing best result for number of teams less or equal to 32.
