Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Tabu algorithm for set partitioning: optimisation of football leagues

Tabu algorithm for set partitioning: optimisation of football leagues Set partitioning problems are known to be NP-hard, thus it requires massive amounts of times and efforts to solve them using linear programming and traditional algorithms. This study proposes to use a tabu algorithm for such problems. The proposed algorithm is applied to the 3rd level football leagues in Turkey. 54 teams competing in the league are divided into three categories randomly by the Turkish Football Federation. The proposed algorithm in this study aims to set up these categories with the goal of minimising the total amount of travelling, thus cost and time throughout the league. Experimental results show that the proposed algorithm reduces the total travelling by a significant amount of 50%. The possible scenarios for alignment of the teams are suggested at the end of the study as a way of implementing the findings of this research. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Business and Systems Research Inderscience Publishers

Tabu algorithm for set partitioning: optimisation of football leagues

Download PDF
10 pages

Loading next page...
 
/lp/inderscience-publishers/tabu-algorithm-for-set-partitioning-optimisation-of-football-leagues-QH6SR82MH2
Publisher
Inderscience Publishers
Copyright
Copyright © Inderscience Enterprises Ltd. All rights reserved
ISSN
1751-200X
eISSN
1751-2018
DOI
10.1504/IJBSR.2013.050619
Publisher site
See Article on Publisher Site

Abstract

Set partitioning problems are known to be NP-hard, thus it requires massive amounts of times and efforts to solve them using linear programming and traditional algorithms. This study proposes to use a tabu algorithm for such problems. The proposed algorithm is applied to the 3rd level football leagues in Turkey. 54 teams competing in the league are divided into three categories randomly by the Turkish Football Federation. The proposed algorithm in this study aims to set up these categories with the goal of minimising the total amount of travelling, thus cost and time throughout the league. Experimental results show that the proposed algorithm reduces the total travelling by a significant amount of 50%. The possible scenarios for alignment of the teams are suggested at the end of the study as a way of implementing the findings of this research.

Journal

International Journal of Business and Systems Research – Inderscience Publishers

Published: Jan 1, 2013

There are no references for this article.