Please use this identifier to cite or link to this item:
Title: An Application of Tree Seed Algorithm for Optimization of 50 and 100 Dimensional Numerical Functions
Authors: Güngör, İmral
Emiroğlu, Bülent Gürsel
Uymaz, S.A.
Kıran, Mustafa Servet
Keywords: CEC2015)
function optimization
tree-seed algorithm
update mechanism
Issue Date: 2021
Publisher: Institute of Electrical and Electronics Engineers Inc.
Abstract: The Tree-Seed Algorithm is an optimization algorithm created by observing the process of growing and becoming a new tree, the seeds scattering around trees in natural life. In this study, TSA is applied to optimize high-dimensional functions. In previous studies, the performance of the tree seed algorithm applied for the optimization of low-dimensional functions has been proven. Thus, in addition to running the algorithm on 30-dimensional functions before, it has also been applied to solve 50-and 100-dimensional numerical functions. This improvement, called the tree seed algorithm, is based on the use of more solution update mechanisms instead of one mechanism. In the experiments, CEC2015 benchmarking functions are used and the developed tree seed algorithm is compared with the base state of TSA, artificial bee colony, particle swarm optimization and some variants of the differential evolution algorithm. Experimental results are obtained as mean, max, min solutions and standard deviation of 30 different runs. As a result, it is observed by the studies that the developed algorithm gives successful results. © 2021 IEEE.
Description: 3rd International Conference on Electrical, Communication and Computer Engineering, ICECCE 2021 -- 12 June 2021 through 13 June 2021 -- -- 171467
ISBN: 9781665438971
Appears in Collections:Mühendislik ve Doğa Bilimleri Fakültesi Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collections

Show full item record

CORE Recommender

Page view(s)

checked on Feb 26, 2024

Google ScholarTM



Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.