Hierarchical Learning Water Cycle Algorithm

被引:16
作者
Chen, Caihua [1 ]
Wang, Peng [1 ]
Dong, Huachao [1 ]
Wang, Xinjing [1 ]
机构
[1] Northwestern Polytech Univ, Sch Marine Sci & Technol, Xian, Shaanxi, Peoples R China
基金
中国国家自然科学基金; 中国博士后科学基金;
关键词
Metaheuristic; Water cycle algorithm; Hierarchical learning; Active target choosing; OPTIMIZATION ALGORITHM; EVAPORATION RATE; EVOLUTION;
D O I
10.1016/j.asoc.2019.105935
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In order to improve the global searching ability of Water Cycle Algorithm (WCA), the hierarchical learning concept is introduced and the Hierarchical Learning WCA (HLWCA) is proposed in this paper. The underlying idea of HLWCA is to divide the solutions into collections and give these collections with hierarchy differences. One of the collections has a higher hierarchy than others and utilizes an exploration-inclined updating mechanism. The solutions in this high hierarchy collection are the exemplars of other collections. The other collections are sorted according to the exemplars' function value and the solutions in these collections actively choose whether to follow their own exemplar or not. Through different updating mechanisms of collections, the global searching ability is improved while the fast convergence and strong local search ability of WCA are retained. The proposed HLWCA is firstly experimented on IEEE CEC 2017 benchmark suite to testify its performance on complex numerical optimization tasks. Then, it is tested on four practical design benchmark problems to verify its ability of solving real-world problems. The experimental results illustrate the efficiency of the proposed algorithm. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页数:19
相关论文
共 41 条
[1]  
Agarwal P., 2014, International Journal of Computer Applications, V100, P14, DOI DOI 10.5120/17593-8331
[2]   The exploration/exploitation tradeoff in dynamic cellular genetic algorithms [J].
Alba, E ;
Dorronsoro, B .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2005, 9 (02) :126-142
[3]  
[Anonymous], J UNMERICAL METHODS
[4]  
[Anonymous], SOFT COMPUT
[5]  
[Anonymous], 2016 INT C COMM EL S
[6]  
[Anonymous], LECT NOTES COMPUTER
[7]  
[Anonymous], 2017, IEEE ACIS INT C COMP
[8]  
[Anonymous], 2019, ARTIF INTELL REV
[9]  
Arora J, 2004, Introduction to optimum design
[10]   A hybrid firefly and particle swarm optimization algorithm for computationally expensive numerical problems [J].
Aydilek, Ibrahim Berkan .
APPLIED SOFT COMPUTING, 2018, 66 :232-249