Tabu algorithm for set partitioning: optimisation of football leagues
by Lutfu Sagbansua
International Journal of Business and Systems Research (IJBSR), Vol. 7, No. 1, 2013

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.

Online publication date: Thu, 28-Nov-2013

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Business and Systems Research (IJBSR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com