An Efficient Simulated Annealing Approach to the Travelling Tournament Problem
An Efficient Simulated Annealing Approach to the Travelling Tournament Problem作者机构：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
出 版 物：《American Journal of Operations Research》 (美国运筹学期刊（英文）)
年 卷 期：2012年第2卷第3期
页 面：391-398页
学科分类：081203[工学-计算机应用技术] 08[工学] 0835[工学-软件工程] 0812[工学-计算机科学与技术（可授工学、理学学位）]
主 题：Travelling Tournament Problem Simulated Annealing Graph Coloring Combinatorial Optimization
摘 要：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.
维普期刊数据库