A modification of tree-seed algorithm using Deb's rules for constrained optimization

Basit Öğe Kaydı
dc.contributor.authorBabalik, Ahmet
dc.contributor.authorCinar, Ahmet Cevahir
dc.contributor.authorKiran, Mustafa Servet
dc.date.accessioned2020-03-26T19:52:41Z
dc.date.available2020-03-26T19:52:41Z
dc.date.issued2018
dc.departmentSelçuk Üniversitesien_US
dc.description.abstractThis study focuses on the modification of Tree-Seed Algorithm (TSA) to solve constrained optimization problem. TSA, which is one of the population-based iterative search algorithms, has been developed by inspiration of the relations between trees and seeds grown on a land, and the basic version of TSA has been first used to solve unconstrained optimization problems. In this study, the basic algorithmic process of TSA is modified by using Deb's rules to solve constrained optimization problems. Deb's rules are based on the objective function and violation of constraints and it is used to select the trees and seeds that will survive in next iterations. The performance of the algorithm is analyzed under different conditions of control parameters of the proposed algorithm, CTSA for short, and well-known 13 constrained maximization or minimization standard benchmark functions and engineering design optimization problems are employed. The results obtained by the CTSA are compared with the results of particle swarm optimization (PSO), artificial bee colony algorithm (ABC), genetic algorithm (GA) and differential evolution (DE) algorithm on the standard benchmark problems. The results of state-of-art methods are also compared with the proposed algorithm on engineering design optimization problems. The experimental analysis and results show that the proposed method produces promising and comparable results for the constrained optimization benchmark set in terms of solution quality and robustness. (C) 2017 Elsevier B.V. All rights reserved.en_US
dc.identifier.doi10.1016/j.asoc.2017.10.013en_US
dc.identifier.endpage305en_US
dc.identifier.issn1568-4946en_US
dc.identifier.issn1872-9681en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.startpage289en_US
dc.identifier.urihttps://dx.doi.org/10.1016/j.asoc.2017.10.013
dc.identifier.urihttps://hdl.handle.net/20.500.12395/36247
dc.identifier.volume63en_US
dc.identifier.wosWOS:000418953500023en_US
dc.identifier.wosqualityQ1en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherELSEVIER SCIENCE BVen_US
dc.relation.ispartofAPPLIED SOFT COMPUTINGen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.selcuk20240510_oaigen_US
dc.subjectTree-seed algorithmen_US
dc.subjectConstrained optimizationen_US
dc.subjectDeb's rulesen_US
dc.subjectBenchmark functionen_US
dc.subjectEngineering design optimizationen_US
dc.titleA modification of tree-seed algorithm using Deb's rules for constrained optimizationen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu