Loading...

A Hybrid PSO-SA algorithm for the traveling tournament problem

Tajbakhsh, A ; Sharif University of Technology

528 Viewed
  1. Type of Document: Article
  2. Abstract:
  3. Sports scheduling has become an important area of applied operationsresearch in recent years, since satisfying the fans and teams' requests andrevenues of a sports league and TV networks may be affected by the quality ofthe league schedule. While this type of scheduling problem can be solvedtheoretically by mathematical methods, it computationally leads to hardproblems. The Traveling Tournament Problem (TTP) is defined as minimizing totaltraveling distance for all teams in the league. In this study, a newmathematical model for the TTP with no-repeater constraint is presented. Inaddition, a very fast hybrid metaheuristic algorithm is proposed, which combinesParticle Swarm Optimization (PSO) and Simulated Annealing (SA). Ourcomputational experiments on standard instances show that the hybrid approachresults in comparable to or even better than current best known solutions,specifically in computational time. © 2009 IEEE
  4. Keywords:
  5. Particleswarm optimization ; Computational time ; Hybrid PSO ; Mathematical method ; Meta heuristic algorithm ; SA algorithm ; Scheduling problem ; Sports scheduling ; Swarm optimization ; Traveling tournament problem ; Annealing ; Industrial engineering ; Particle swarm optimization (PSO) ; Simulated annealing
  6. Source: 2009 International Conference on Computers and Industrial Engineering, CIE 2009, 6 July 2009 through 9 July 2009, Troyes ; 2009 , Pages 512-518 ; 9781424441365 (ISBN)
  7. URL: http://ieeexplore.ieee.org/document/5223865