Gungor, ImralEmiroglu, Bulent GurselCinar, Ahmet CevahirKiran, Mustafa Servet2021-01-142021-01-142020Bu makale açık erişimli değildir.1868-80711868-808Xhttps://doi.org/10.1007/s13042-019-00970-1https://hdl.handle.net/20.500.12587/12812Emiroglu, Bulent Gursel/0000-0002-1656-6450; CINAR, Ahmet Cevahir/0000-0001-5596-6767; Kiran, Mustafa Servet/0000-0002-5896-7180The tree-seed algorithm, TSA for short, is a new population-based intelligent optimization algorithm developed for solving continuous optimization problems by inspiring the relationship between trees and their seeds. The locations of trees and seeds correspond to the possible solutions of the optimization problem on the search space. By using this model, the continuous optimization problems with lower dimensions are solved effectively, but its performance dramatically decreases on solving higher dimensional optimization problems. In order to address this issue in the basic TSA, an integration of different solution update rules are proposed in this study for solving high dimensional continuous optimization problems. Based on the search tendency parameter, which is a peculiar control parameter of TSA, five update rules and a withering process are utilized for obtaining seeds for the trees. The performance of the proposed method is investigated on basic 30-dimensional twelve numerical benchmark functions and CEC (congress on evolutionary computation) 2015 test suite. The performance of the proposed approach is also compared with the artificial bee colony algorithm, particle swarm optimization algorithm, genetic algorithm, pure random search algorithm and differential evolution variants. Experimental comparisons show that the proposed method is better than the basic method in terms of solution quality, robustness and convergence characteristics.eninfo:eu-repo/semantics/closedAccessSwarm intelligenceMetaheuristic algorithmsWithering processNonlinear global optimizationArticle11224926710.1007/s13042-019-00970-12-s2.0-85067815829Q1WOS:000512019400002Q2