Tabu algorithm for set partitioning: Optimisation of football leagues
Küçük Resim Yok
Tarih
2013
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Inderscience Publishers
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
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. © 2013 Inderscience Enterprises Ltd. © 2020 Elsevier B.V., All rights reserved.
Açıklama
Anahtar Kelimeler
Heuristic, Operations systems, Set partitioning, SP, Sports leagues, Systems research, Tabu search, TS, Vehicle routing
Kaynak
International Journal of Business and Systems Research
WoS Q Değeri
Scopus Q Değeri
Q3
Cilt
7
Sayı
1
