An improved tree seed algorithm for optimization problems

Basit Öğe Kaydı
dc.contributor.authorAslan M.
dc.contributor.authorBeskirli M.
dc.contributor.authorKodaz H.
dc.contributor.authorKiran M.S.
dc.date.accessioned2020-03-26T20:11:43Z
dc.date.available2020-03-26T20:11:43Z
dc.date.issued2018
dc.departmentSelçuk Üniversitesien_US
dc.description.abstractVarious heuristic algorithms have been proposed in the literature for solving optimization problems. Tree-seed algorithm (TSA) is inspired from relation between trees and seeds that a population-based evolutionary algorithm. when create process of a seed occur in TSA, the position updating of each dimension of the seed is calculated separately. In scope this study, Some changes have been implemented to original TSA. A new operator was added to the position update equation of original TSA when create a seed from tree. This operator is calculated by dynamically according to the dimension of the problem. As the dimension of the problem increases, the value of the this operator decreases. In addition, we determined an upper and a lower bound for the update process of the seed. The Improved Tree Seed Algorithm (ITSA) proposed in this study and the TSA have been tested on some benchmark functions in the literature. As a result, when the experimental results are taken into consideration, it is understood that the proposed algorithm ITSA is obtained more effective results for benchmark functions than TSA. Moreover, it is observed that ITSA found quite successful results compared with TSA for large-scale benchmark problems. © 2018 International Association of Computer Science and Information Technology.en_US
dc.identifier.doi10.18178/ijmlc.2018.8.1.657en_US
dc.identifier.endpage25en_US
dc.identifier.issn2010-3700en_US
dc.identifier.issue1en_US
dc.identifier.scopusqualityN/Aen_US
dc.identifier.startpage20en_US
dc.identifier.urihttps://dx.doi.org/10.18178/ijmlc.2018.8.1.657
dc.identifier.urihttps://hdl.handle.net/20.500.12395/37170
dc.identifier.volume8en_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherInternational Association of Computer Science and Information Technologyen_US
dc.relation.ispartofInternational Journal of Machine Learning and Computingen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.selcuk20240510_oaigen_US
dc.subjectEvolutionary calculationen_US
dc.subjectHeuristic searchen_US
dc.subjectOptimization problemsen_US
dc.subjectTree seed algorithmen_US
dc.titleAn improved tree seed algorithm for optimization problemsen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

Scopus İndeksli Yayınlar Koleksiyonu