TSA: Tree-seed algorithm for continuous optimization

被引:278
作者
Kiran, Mustafa Servet [1 ]
机构
[1] Selcuk Univ, Fac Engn, Dept Comp Engn, TR-42075 Konya, Turkey
关键词
Heuristic search; Tree and seed; Numeric optimization; Multilevel thresholding; SATELLITE IMAGE SEGMENTATION; PARTICLE SWARM OPTIMIZATION; SEARCH ALGORITHM; COLONY; ENTROPY; KAPURS;
D O I
10.1016/j.eswa.2015.04.055
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper presents a new intelligent optimizer based on the relation between trees and their seeds for continuous optimization. The new method is in the field of heuristic and population-based search. The location of trees and seeds on n-dimensional search space corresponds with the possible solution of an optimization problem. One or more seeds are produced from the trees and the better seed locations are replaced with the locations of trees. While the new locations for seeds are produced, either the best solution or another tree location is considered with the tree location. This consideration is performed by using a control parameter named as search tendency (ST), and this process is executed for a pre-defined number of iterations. These mechanisms provide to balance exploitation and exploration capabilities of the proposed approach. In the experimental studies, the effects of control parameters on the performance of the method are firstly examined on 5 well-known basic numeric functions. The performance of the proposed method is also investigated on the 24 benchmark functions with 2, 3, 4, 5 dimensions and multilevel thresholding problems. The obtained results are also compared with the results of state-of-art methods such as artificial bee colony (ABC) algorithm, particle swarm optimization (PSO), harmony search (HS) algorithm, firefly algorithm (FA) and the bat algorithm (BA). Experimental results show that the proposed method named as TSA is better than the state-of-art methods in most cases on numeric function optimization and is an alternative optimization method for solving multilevel thresholding problem. (C) 2015 Elsevier Ltd. All rights reserved.
引用
收藏
页码:6686 / 6698
页数:13
相关论文
共 29 条
[1]   A study on particle swarm optimization and artificial bee colony algorithms for multilevel thresholding [J].
Akay, Bahriye .
APPLIED SOFT COMPUTING, 2013, 13 (06) :3066-3091
[2]  
[Anonymous], FIREFLY ALGORITHM MA
[3]  
[Anonymous], 2005, PROBLEM DEFINITIONS
[4]   Modified artificial bee colony based computationally efficient multilevel thresholding for satellite image segmentation using Kapur's, Otsu and Tsallis functions [J].
Bhandari, A. K. ;
Kumar, A. ;
Singh, G. K. .
EXPERT SYSTEMS WITH APPLICATIONS, 2015, 42 (03) :1573-1601
[5]   Cuckoo search algorithm and wind driven optimization based study of satellite image segmentation for multilevel thresholding using Kapur's entropy [J].
Bhandari, Ashish Kumar ;
Singh, Vineet Kumar ;
Kumar, Anil ;
Singh, Girish Kumar .
EXPERT SYSTEMS WITH APPLICATIONS, 2014, 41 (07) :3538-3560
[6]   Ant system: Optimization by a colony of cooperating agents [J].
Dorigo, M ;
Maniezzo, V ;
Colorni, A .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 1996, 26 (01) :29-41
[7]   A new heuristic optimization algorithm: Harmony search [J].
Geem, ZW ;
Kim, JH ;
Loganathan, GV .
SIMULATION, 2001, 76 (02) :60-68
[8]  
Goldberg DE., 1989, GENETIC ALGORITHMS S, V13
[9]  
Holland I.H., 1975, ADAPTATION NATURAL A
[10]   Multilevel thresholding selection based on the artificial bee colony algorithm for image segmentation [J].
Horng, Ming-Huwi .
EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (11) :13785-13791