Yazar "Gungor, Imral" seçeneğine göre listele

Listeleniyor 1 - 2 / 2
  • [ X ]
    Öğe
    An Application of Tree Seed Algorithm for Optimization of 50 and 100 Dimensional Numerical Functions
    (Institute of Electrical and Electronics Engineers Inc., 2021) Gungor, Imral; Emiroglu, Bulent Gursel; Uymaz, Sait Ali; Kiran, Mustafa Servet
    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.
  • Küçük Resim
    Öğe
    Integration search strategies in tree seed algorithm for high dimensional function optimization
    (SPRINGER HEIDELBERG, 2020) Gungor, Imral; Emiroglu, Bulent Gursel; Cinar, Ahmet Cevahir; Kiran, Mustafa Servet
    The 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.