An Improved Neighbourhood for the Traveling Tournament Problem

Details An Improved Neighbourhood for the Traveling Tournament Problem An Improved Neighbourhood for the Traveling Tournament Problem

2010-07-03

arxiv.org/abs/1007.0501v1

Computer Science

Data Structures and Algorithms

Scientific paper

The Traveling Tournament Problem (TTP) is a challenging combinatorial optimization problem that has attracted the interest of researchers around the world. This paper proposes an improved search neighbourhood for the TTP that has been tested in a simulated annealing context. The neighbourhood encompasses both feasible and infeasible schedules, and can be generated efficiently. For the largest TTP challenge problems with up to 40 teams, solutions found using this neighbourhood are the best currently known, and for smaller problems with 10 teams, three solutions found were subsequently proven optimal.

Affiliated with

Also associated with

No associations

Rating

An Improved Neighbourhood for the Traveling Tournament Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Improved Neighbourhood for the Traveling Tournament Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Improved Neighbourhood for the Traveling Tournament Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-402650