A Hybrid PSO-SA Algorithm For The Traveling Tournament Problem

被引:1
作者
Tajbakhsh, Alireza [1 ]
Eshghi, Kourosh [1 ]
Shamsi, Azam [1 ]
机构
[1] Sharif Univ Technol, Fac Ind Engn, Tehran, Iran
来源
CIE: 2009 INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3 | 2009年
关键词
Sports Scheduling; Traveling Tournament Problem; Simulated Annealing; Particle Swarm Optimization; OPTIMIZATION;
D O I
10.1109/ICCIE.2009.5223865
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Sports scheduling has become an important area of applied operations research in recent years, since satisfying the fans and teams' requests and revenues of a sports league and TV networks may be affected by the quality of the league schedule. While this type of scheduling problem can be solved theoretically by mathematical methods, it computationally leads to hard problems. The Traveling Tournament Problem (TTP) is defined as minimizing total traveling distance for all teams in the league. In this study, a new mathematical model for the TTP with no-repeater constraint is presented. In addition, a very fast hybrid metaheuristic algorithm is proposed, which combines Particle Swarm Optimization (PSO) and Simulated Annealing (SA). Our computational experiments on standard instances show that the hybrid approach results in comparable to or even better than current best known solutions, specifically in computational time.
引用
收藏
页码:512 / 518
页数:7
相关论文
共 28 条