IDEAS home Printed from https://ideas.repec.org/a/ids/ijbsre/v7y2013i1p51-60.html
   My bibliography  Save this article

Tabu algorithm for set partitioning: optimisation of football leagues

Author

Listed:
  • Lutfu Sagbansua

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.

Suggested Citation

  • Lutfu Sagbansua, 2013. "Tabu algorithm for set partitioning: optimisation of football leagues," International Journal of Business and Systems Research, Inderscience Enterprises Ltd, vol. 7(1), pages 51-60.
    • Handle: RePEc:ids:ijbsre:v:7:y:2013:i:1:p:51-60
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=50619
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijbsre:v:7:y:2013:i:1:p:51-60. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=206 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.