Loading...

Minimizing the Number of Breaks in Double Round Robin Tournaments with Different Permutation of Rounds in 2nd Half Season

Yektamaram, Ali Reza | 2012

605 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 42983 (01)
  4. University: Sharif University of Technology
  5. Department: Industrial Engineering
  6. Advisor(s): Salmasi, Nasser
  7. Abstract:
  8. Sports scheduling with its interesting theory and application has been the subject of many research recently. Different problems arise from different league structures with different objectives. Inspired by the structure of soccer leagues in Britain and Netherlands, we study structures in which a different permutation of first half-season rounds is played during second half-season. Some leagues like Premier league in addition to this structure have a special property in which two teams may do not play against each other in the first half-season and play twice in the second half-season. Therefore, we study both structures separately. We present a mathematical model to cover both structures. We considered break minimization as the objective function which is popular among small countries and maintains the balance of fan’s satisfaction level and consecutive travels of teams. In order to validate the mathematical model we propose an equivalent constraint programming model. We also develop two Graph theoretical models for these problems based on node coloring and maximum cut problems. Graph models form a basis for our decomposition based tabu-search algorithm. We also used these concepts to propose lower bounds for the number of breaks in both league structures. Finally, in order to solve the problem more efficiently in both cases, we propose a heuristic solution method for this problem which outperforms the meta-heuristic algorithm and evaluating the results with the developed lower bounds proves its efficiency.

  9. Keywords:
  10. Sequencing ; Mathematical Modeling ; Sports Scheduling ; Break Minimization ; Service Scheduling

 Digital Object List

 Bookmark

No TOC