Author(s)

Sevnaz Nourollahi, Kourosh Eshghi, Hooshmand Shokri Razaghi

Department of Computer Engineering, Sharif University of Technology, Tehran, Iran.
Department of Industrial Engineering, Sharif University of Technology, Tehran, Iran.
Faculty of department of Industrial Engineering, Sharif University of Technology, Tehran, Iran.

Scheduling sports leagues has drawn significant attention to itself in recent years, as it involves considerable revenue as well as challenging combinatorial optimization problems. A particular class of these problems is the Traveling Tournament Problem (TTP) which focuses on minimizing the total traveling distance for teams. In this paper, an efficient simulated annealing approach is presented for TTP which applies two simultaneous and disparate models for the problem in order to search the solutions space more effectively. Also, a computationally efficient modified greedy scheme is proposed for constructing a favorable initial solution for the simulated annealing algorithm. Our computational experiments, carried out on standard instances, demonstrate that this approach competes with previous offered methods in quality of found solutions and their computational time.

Travelling Tournament Problem; Simulated Annealing; Graph Coloring; Combinatorial Optimization

S. Nourollahi, K. Eshghi and H. Razaghi, "An Efficient Simulated Annealing Approach to the Travelling Tournament Problem," American Journal of Operations Research, Vol. 2 No. 3, 2012, pp. 391-398. doi: 10.4236/ajor.2012.23047.