Improved single candidate optimization algorithm for clustering problems
2024
0 görüntülenme
0 i̇ndirme
Danışman: Prof. Dr. Uğur Yüzgeç
Özet (EN)
In order to effectively address optimization problems, the development of efficient optimization algorithms is of great importance. This thesis focuses on the Single Candidate Optimization (SCO) algorithm introduced in the literature by Shami et al. in 2022 (Shami, Grace, Burr, & Mitchell, 2022). The SCO algorithm discussed in this study is a simple and comprehensible algorithm, and its main distinction from other population-based heuristic algorithms is its attempt to find the solution to the optimization problem more quickly using a single candidate solution. However, it also faces fundamental issues such as getting stuck in local optima, similar to other heuristics. Initially, the problem of boundary violation (the candidate solution exceeding the search space) has been addressed within the SCO structure, and an accelerated opposition learning-based mechanism has been integrated into the algorithm's structure to improve search performance. Thus, in this study, a new optimization algorithm named Accelerated Opposition Learning based Single Candidate Optimization (AccOppSCO) has been proposed by incorporating the accelerated opposition learning mechanism into the SCO algorithm. To evaluate the performance of the proposed AccOppSCO algorithm, various optimization problems from the literature have been selected. The evaluation indicates that the AccOppSCO algorithm is capable of producing more accurate solutions compared to the original SCO algorithm. The performance of the proposed AccOppSCO algorithm is also evaluated on a clustering problem. In the clustering problem, the proposed AccOppSCO algorithm demonstrates superior convergence compared to the original SCO algorithm. Finally, the proposed AccOppSCO algorithm is compared with classical heuristic optimization algorithms such as Genetic Algorithm (GA), Differential Evolution (DE) and Particle Swarm Optimization (PSO). According to the results, the AccOppSCO algorithm performs better than the original SCO algorithm in terms of convergence and solution quality.
Yazar
Dr. Cihat Doğan
Kurum
Bu Yayına Nasıl Atıf Yapılır
Cihat Doğan (Master Thesis). Improved single candidate optimization algorithm for clustering problems, 2024, Bilecik Şeyh Edebali Üniversity.
Anahtar Kelimeler
Lisans
Tüm Hakları Saklıdır
Bu eser belirtilen lisans koşulları altında paylaşılmaktadır.
Bilecik Şeyh Edebali Üniversity tezlerinden daha fazlası
- The criminality of intentional contamination of the environment(2016)
- Evaluation of aflatoxin risk profile in tomato and pepper paste produced by traditional methods(2021)
- Analysis of Electronic Declaration System with SWOT, AHP and MARCOS methods: The example of Bilecik province(2022)
- Globalization of terrorism and eu transition on the policy of fighting against terrorism(2010)
- The social effects of the migrations from the East and Southeast Anatolia to the west(2010)
- Conciliation in Criminal Procedure Law(2010)
