An Implementation of Tree-Seed Algorithm (TSA) for Constrained Optimization

dc.contributor.authorKiran, Mustafa Servet
dc.date.accessioned2020-03-26T19:23:03Z
dc.date.available2020-03-26T19:23:03Z
dc.date.issued2016
dc.departmentSelçuk Üniversitesien_US
dc.description19th Asia Pacific Symposium on Intelligent and Evolutionary Systems (IES) -- NOV 22-25, 2015 -- King Mongkuts Univ Technol Thonburi, Sch Informat Technol, Bangkok, THAILANDen_US
dc.description.abstractOne of the recent proposed population-based heuristic search algorithms is tree-seed optimization algorithm, TSA for short. TSA simulates the growing over on a land of trees and seeds and it has been proposed for solving unconstrained continuous optimization problems. The trees and their seeds on the D-dimensional solution space correspond to the possible solution for the optimization problem. At the beginning of the search, the trees are sowed to the land, and a number of seeds for each tree are produced during the iterations. The tree is removed from the stand and its best seed is added to the stand if the fitness of the best seed is better than the fitness of this tree. In the present study, a constraint optimization problem, the well-known pressure vessel design-PVD problem, is solved by using TSA. To overcome the constraints of the problem, a penalty function is used and the problem is considered as a single objective optimization problem. The experimental results obtained by the TSA are compared with the results of state-of-art methods such as artificial bee colony (ABC) and particle swarm optimization (PSO). Based on the solution quality and robustness, the promising and comparable results are obtained by the proposed approach.en_US
dc.description.sponsorshipInt Neural Network Soc, Thailand Reg Chapter, VeriGuideen_US
dc.identifier.doi10.1007/978-3-319-27000-5_15en_US
dc.identifier.endpage197en_US
dc.identifier.isbn978-3-319-27000-5; 978-3-319-26999-3
dc.identifier.issn2363-6084en_US
dc.identifier.startpage189en_US
dc.identifier.urihttps://dx.doi.org/10.1007/978-3-319-27000-5_15
dc.identifier.urihttps://hdl.handle.net/20.500.12395/33244
dc.identifier.volume5en_US
dc.identifier.wosWOS:000381747000015en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.language.isoenen_US
dc.publisherSPRINGER INTERNATIONAL PUBLISHING AGen_US
dc.relation.ispartofINTELLIGENT AND EVOLUTIONARY SYSTEMS, IES 2015en_US
dc.relation.ispartofseriesProceedings in Adaptation Learning and Optimization
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.selcuk20240510_oaigen_US
dc.subjectHeuristic searchen_US
dc.subjectPopulation-based searchen_US
dc.subjectTree-seeden_US
dc.subjectConstrained optimizationen_US
dc.titleAn Implementation of Tree-Seed Algorithm (TSA) for Constrained Optimizationen_US
dc.typeConference Objecten_US

Dosyalar