A new hybrid algorithm for continuous optimization problem

被引:61
作者
Farnad, Behnam [1 ]
Jafarian, Ahmad [2 ]
Baleanu, Dumitru [3 ,4 ]
机构
[1] Islamic Azad Univ, Urmia Branch, Dept Comp Engn, Orumiyeh, Iran
[2] Islamic Azad Univ, Urmia Branch, Dept Math, Orumiyeh, Iran
[3] Cankaya Univ, Fac Art & Sci, Dept Math, TR-06530 Ankara, Turkey
[4] Inst Space Sci, Magurele, Romania
关键词
Genetic algorithms; Particle swarm optimization; Symbiotic organisms search; Global optimization; Hybrid algorithm; Data clustering; SYMBIOTIC ORGANISMS SEARCH; NUMERICAL FUNCTION OPTIMIZATION; PARTICLE SWARM; GLOBAL OPTIMIZATION; GENETIC ALGORITHM;
D O I
10.1016/j.apm.2017.10.001
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This paper applies a new hybrid method by a combination of three population base algorithms such as Genetic Algorithm (GA), Particle Swarm Optimization (PSO) and Symbiotic Organisms Search (SOS). The proposed method has been inspired from natural selection process and it completes this process in GA by using the PSO and SOS. It tends to minimize the execution time and in addition to reduce the complexity. Symbiotic organisms search is a robust and powerful metaheuristic algorithm which has attracted increasing attention in recent decades. There are three alternative phases in the proposed algorithm: GA, which develops and selects best population for the next phases, PSO, which gets experiences for each appropriate solution and updates them as well and SOS, which benefits from previous phases and performs symbiotic interaction update phases in the real-world population. The proposed algorithm was tested on the set of best known unimodal and multimodal benchmark functions in various dimensions. It has further been evaluated in, the experiment on the clustering of benchmark datasets. The obtained results from basic and non-parametric statistical tests confirmed that this hybrid method dominates in terms of convergence, execution time, success rate. It optimizes the high dimensional and complex functions Rosenbrock and Griewank up to 10(-330) accuracy in less than 3 s, outperforming other known algorithms. It had also applied clustering datasets with minimum intra-cluster distance and error rate. (C) 2017 Elsevier Inc. All rights reserved.
引用
收藏
页码:652 / 673
页数:22
相关论文
共 59 条
[1]   Metaheuristics in combinatorial optimization: Overview and conceptual comparison [J].
Blum, C ;
Roli, A .
ACM COMPUTING SURVEYS, 2003, 35 (03) :268-308
[2]  
Blum C, 2008, STUD COMPUT INTELL, V114, P1
[3]   A survey on optimization metaheuristics [J].
Boussaid, Ilhern ;
Lepagnot, Julien ;
Siarry, Patrick .
INFORMATION SCIENCES, 2013, 237 :82-117
[4]   Genetic and Nelder-Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions [J].
Chelouah, R ;
Siarry, P .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 148 (02) :335-348
[5]   A continuous genetic algorithm designed for the global optimization of multimodal functions [J].
Chelouah, R ;
Siarry, P .
JOURNAL OF HEURISTICS, 2000, 6 (02) :191-213
[6]  
Cheng M., 2016, J COMPUT CIVIL ENG, V30, P1943
[7]  
Cheng M.-Y., 2016, J CHIN I CIVIL HYDRA, V26, P293
[8]   Symbiotic Organisms Search: A new metaheuristic optimization algorithm [J].
Cheng, Min-Yuan ;
Prayogo, Doddy .
COMPUTERS & STRUCTURES, 2014, 139 :98-112
[9]   Hybrid Artificial Intelligence-Based PBA for Benchmark Functions and Facility Layout Design Optimization [J].
Cheng, Min-Yuan ;
Lien, Li-Chuan .
JOURNAL OF COMPUTING IN CIVIL ENGINEERING, 2012, 26 (05) :612-624
[10]   A new metaheuristic for numerical function optimization: Vortex Search algorithm [J].
Dogan, Berat ;
Olmez, Tamer .
INFORMATION SCIENCES, 2015, 293 :125-145