Improvement of evolution process of dandelion algorithm with extreme learning machine for global optimization problems

被引:13
作者
Han, Shoufei [1 ,2 ]
Zhu, Kun [1 ,2 ]
Wang, Ran [1 ,2 ]
机构
[1] Nanjing Univ Aeronaut & Astronaut, Coll Comp Sci & Technol, Nanjing 211106, Peoples R China
[2] Collaborat Innovat Ctr Novel Software Technol & I, Nanjing 211106, Peoples R China
关键词
Dandelion algorithm; Extreme learning machine; Excellent seeds; Poor seeds; Training set; Training model; SWARM OPTIMIZATION; CLASSIFICATION; SET;
D O I
10.1016/j.eswa.2020.113803
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Dandelion Algorithm (DA) is a novel swarm intelligent optimization algorithm. In evolutionary process of DA, the quality of the seeds generated by dandelions is uneven, and the excellent seeds are expected to be retained and evaluated, while the poor seeds should be discarded without evaluation. In order to determine whether a seed is excellent or not, an improvement of evolution process of dandelion algorithm with extreme learning machine (ELMDA) is proposed in this paper. In ELMDA, firstly, the dandelion population can be partitioned into excellent dandelions and poor dandelions based on fitness values. Then, the excellent dandelions and poor dandelions are assigned corresponding labels (i.e. +1 if excellent or -1 if poor), which can be regarded as a training set, and the training model is built based on ELM. Finally, the model is applied to classify the seeds as excellent or poor, and the excellent seeds are chosen to participate in evolution process. Meanwhile, the robustness of the proposed algorithm is analyzed in this paper. Experimental results performed on test functions show that the proposed algorithm is competitive to its peers. Moreover, the proposed algorithm is demonstrated on three engineering designed problems, and the results indicate that the proposed algorithm has better performance in solving them.
引用
收藏
页数:19
相关论文
共 57 条
[1]  
Awad N., 2016, Problem definitions and evaluation criteria for the cec 2017 special session and competition on single objective real-parameter numerical optimization
[2]   Self-Adaptive Evolutionary Extreme Learning Machine [J].
Cao, Jiuwen ;
Lin, Zhiping ;
Huang, Guang-Bin .
NEURAL PROCESSING LETTERS, 2012, 36 (03) :285-305
[3]   A powerful variant of symbiotic organisms search algorithm for global optimization [J].
Celik, Emre .
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2020, 87
[4]   Spectral-Spatial Classification of Hyperspectral Image Based on Kernel Extreme Learning Machine [J].
Chen, Chen ;
Li, Wei ;
Su, Hongjun ;
Liu, Kui .
REMOTE SENSING, 2014, 6 (06) :5795-5814
[5]   A balanced whale optimization algorithm for constrained engineering design problems [J].
Chen, Huiling ;
Xu, Yueting ;
Wang, Mingjing ;
Zhao, Xuehua .
APPLIED MATHEMATICAL MODELLING, 2019, 71 :45-59
[6]   A robust ant colony optimization for continuous functions [J].
Chen, Zhiming ;
Zhou, Shaorui ;
Luo, Jieting .
EXPERT SYSTEMS WITH APPLICATIONS, 2017, 81 :309-320
[7]   Improving Extreme Learning Machine by Competitive Swarm Optimization and its application for medical diagnosis problems [J].
Eshtay, Mohammed ;
Faris, Hossam ;
Obeid, Nadim .
EXPERT SYSTEMS WITH APPLICATIONS, 2018, 104 :134-152
[8]   A locally-biased form of the DIRECT algorithm [J].
Gablonsky, JM ;
Kelley, CT .
JOURNAL OF GLOBAL OPTIMIZATION, 2001, 21 (01) :27-37
[9]   Cultural firework algorithm and its application for digital filters design [J].
Gao, Hongyuan ;
Diao, Ming .
INTERNATIONAL JOURNAL OF MODELLING IDENTIFICATION AND CONTROL, 2011, 14 (04) :324-331
[10]   Lipschitz optimization methods for fitting a sum of damped sinusoids to a series of observations [J].
Gillard, J. W. ;
Kvasov, D. E. .
STATISTICS AND ITS INTERFACE, 2017, 10 (01) :59-70