 Tabu algorithm for set partitioning: optimisation of football leaguesLutfu Sagbansua International Journal of Business and Systems Research, 2013, vol. 7, issue 1, 51-60 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. Keywords: set partitioning; vehicle routing; tabu search; operations systems; heuristics; sport; league optimisation; football leagues; NP-hard; non-deterministic hard; polynomial-time hard; linear programming; traditional algorithms; Turkey; football teams; Turkish Football Federation; travel minimisation; travelling costs; travelling times; business; systems research. (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:ids:ijbsre:v:7:y:2013:i:1:p:51-60 Access Statistics for this article More articles in International Journal of Business and Systems Research from Inderscience Enterprises Ltd |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.