Solution of travelling tournament problem with League Championship Algorithm
2016
0 görüntülenme
0 i̇ndirme
Danışman: Doç. Dr. Bilal Alataş
Özet (EN)
Solution of Travelling Tournament Problem with League Championship Algorithm Classical optimization algorithms are insufficient in large scale combinatorial problems and in nonlinear problems. Hence, heuristic optimization algorithms have been proposed. General purpose heuristic methods are evaluated in nine different groups: biology-based, physics-based, social-based, music-based, chemical-based, sport-based, mathematics-based and hybrid methods which are combinations of these. Recently, a sports-based search and optimization algorithm entitled as League Championship Algorithm (LCA) has been proposed by Ali Husseinzadeh Kashan in 2009. LCA is a population-based, meta-heuristic optimization algorithm that simulates a Championship for a general optimization with artificial teams and artificial league for several weeks. In this algorithm, according to the league program, a number is given to the couple of teams that will match and the result of match is determined as loser or winner. Winning or losing the game is closely related to power of teams. Teams are intended to improve the formation of the current team throughout the season to win the game in the coming weeks. Chaotic maps have been used in many algorithms, to improve the convergence speed of optimization algorithms with high accuracy. Increasing global convergence speed and prevention of stuck on local solutions of LCA with chaos have been proposed for the first time in this thesis. In this thesis, LCA has been introduced and Chaotic LCAs have been proposed. Comparative performance has examined in benchmark functions. Furthermore, LCA has been firstly utilized in this thesis for travelling tournament problem which is one of the current sports problems and aids to minimize transportation and total movement of teams. Furthermore, this problem has been firstly solved by Optics Inspired Optimization (OIO) algorithm and obtained results have been firstly compared in this thesis. Keywords: Optimization, Metaheuristic Algorithms, League Championship Algorithm, Chaotic Map, Travelling Tournament Problem
Yazar
Harun Bingöl
Kurum
Bu Yayına Nasıl Atıf Yapılır
Harun Bingöl (Master Thesis). Solution of travelling tournament problem with League Championship Algorithm, 2016, Fırat University.
Anahtar Kelimeler
Lisans
Tüm Hakları Saklıdır
Bu eser belirtilen lisans koşulları altında paylaşılmaktadır.
Fırat University tezlerinden daha fazlası
- Using social media as an integrated marketing communication tool(2018)
- Foundation of Dutch East İndia Company and her rising in İndonesia in the 17th century(2013)
- Examination of stress state between Doğanyol (Malatya) and Çelikhan (Adıyaman) on the east Anatolian fault zone(2020)
- Color usage at Turkish Divan of Fuzûlî(2013)
- Yavuzeli (Gaziantep) surrounding volcanic outcropping of rocks petrographic and geochemical features(2014)
- Hizbu?t-Tahrir and the religions and political thoughts of Ercumend Özkan(2008)
