Simulated annealing-based dynamic step shuffled frog leaping algorithm: Optimal performance design and feature selection

被引:85
作者
Liu, Yun [1 ]
Heidari, Ali Asghar [1 ]
Cai, Zhennao [1 ]
Liang, Guoxi [2 ]
Chen, Huiling [1 ]
Pan, Zhifang [3 ]
Alsufyani, Abdulmajeed [4 ]
Bourouis, Sami [5 ]
机构
[1] Wenzhou Univ, Dept Comp Sci & Artificial Intelligence, Wenzhou 325035, Peoples R China
[2] Wenzhou Polytech, Dept Informat Technol, Wenzhou 325035, Peoples R China
[3] Wenzhou Med Univ, Affiliated Hosp 1, Wenzhou 325000, Peoples R China
[4] Taif Univ, Coll Comp & Informat Technol, Dept Comp Sci, Taif 21944, Saudi Arabia
[5] Taif Univ, Coll Comp & Informat Technol, Dept Informat Technol, POB 11099, Taif 21944, Saudi Arabia
基金
中国国家自然科学基金;
关键词
Shuffled frog leaping algorithm; Specular reflection learning mechanism; Simulated annealing algorithm; Feature selection; PARTICLE SWARM OPTIMIZATION; OBJECTIVE DEPLOYMENT OPTIMIZATION; NEURAL-NETWORK; GLOBAL OPTIMIZATION; GENETIC ALGORITHM; INTELLIGENCE; STRATEGY; EVOLUTION; MODELS;
D O I
10.1016/j.neucom.2022.06.075
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The shuffled frog leaping algorithm is a new optimization algorithm proposed to solve the combinatorial optimization problem, which effectively combines the memetic algorithm based on a memetic algorithm and the particle swarm algorithm based on population behavior. The algorithm is widely used because it is easy to implement and requires few parameters to be adjusted. However, there are still some characteristics of this method that need to be improved because it is easy to fall into local optimization or poor search ability. To alleviate this limitation, a new version of the improved SFLA is proposed in this paper, which incorporates a dynamic step size adjustment strategy based on historical information, a specular reflection learning mechanism, and a simulated annealing mechanism based on chaotic mapping and levy flight. Firstly, the dynamic step size adjustment strategy based on historical information effectively helps to balance local exploration and global exploitation and alleviates the problem of falling into local optimum. Second, the specular reflection learning mechanism increases the possibility of searching for valid solutions in feasible domains and enhances the search ability of individuals in the population. Finally, an improved simulated annealing strategy is executed for each memetic, which improves the efficiency of local exploitation. In order to test the performance of the proposed algorithm, 31 test functions were selected from IEEE CEC2014 and 23 essential benchmark functions, and comparative experiments were carried out from the two dimensions of 30 and 100. Furthermore, a series of competing algorithms are selected, which involve nine classical standard algorithms, including PSO, BA, SSA, FA, SCA, WOA, GWO, MFO, and SFLA, as well as, six well-known improved algorithms, including LSFLA, DDSFLA, GOTLBO, ALCPSO, BLPSO, CLPSO. Furthermore, Wilcoxon signed-rank test and Friedman test are used as testing tools to illustrate the scalability of the proposed algorithm. From the analysis of the results, it can be seen that this proposed method has been effectively improved concerning stability and the quality of the optimal solution obtained from the search, both in low and high dimensions, and the ability to jump out of the local optimum has also been enhanced. In addition, to prove that this method has a reliable performance in discrete problems and continuous problems, DSSRLFLA is mapped into a discrete space, and 24 UCI data sets are also selected to evaluate the performance of the new feature selection method. The experimental results illustrate that this improved method can obtain fewer features and higher classification accuracy than some well-known feature selection methods. (C) 2022 Elsevier B.V. All rights reserved.
引用
收藏
页码:325 / 362
页数:38
相关论文
共 150 条
[1]   Parameter estimation of solar cells diode models by an improved opposition-based whale optimization algorithm [J].
Abd Elaziz, Mohamed ;
Oliva, Diego .
ENERGY CONVERSION AND MANAGEMENT, 2018, 171 :1843-1859
[2]   Text feature selection using ant colony optimization [J].
Aghdam, Mehdi Hosseinzadeh ;
Ghasem-Aghaee, Nasser ;
Basiri, Mohammad Ehsan .
EXPERT SYSTEMS WITH APPLICATIONS, 2009, 36 (03) :6843-6853
[3]   Opposition-based learning in shuffled frog leaping: An application for parameter identification [J].
Ahandani, Morteza Alinia ;
Alavi-Rad, Hosein .
INFORMATION SCIENCES, 2015, 291 :19-42
[4]   A diversified shuffled frog leaping: An application for parameter identification [J].
Ahandani, Morteza Alinia .
APPLIED MATHEMATICS AND COMPUTATION, 2014, 239 :1-16
[5]   INFO: An efficient optimization algorithm based on weighted mean of vectors [J].
Ahmadianfar, Iman ;
Heidari, Ali Asghar ;
Noshadian, Saeed ;
Chen, Huiling ;
Gandomi, Amir H. .
EXPERT SYSTEMS WITH APPLICATIONS, 2022, 195
[6]   RUN beyond the metaphor: An efficient optimization algorithm based on Runge Kutta method [J].
Ahmadianfar, Iman ;
Heidari, Ali Asghar ;
Gandomi, Amir H. ;
Chu, Xuefeng ;
Chen, Huiling .
EXPERT SYSTEMS WITH APPLICATIONS, 2021, 181
[7]   RNA sequencing and swarm intelligence-enhanced classification algorithm development for blood-based disease diagnostics using spliced blood platelet RNA [J].
Best, Myron G. ;
In't Veld, Sjors G. J. G. ;
Sol, Nik ;
Wurdinger, Thomas .
NATURE PROTOCOLS, 2019, 14 (04) :1206-1234
[8]   Shuffled frog leaping algorithm and its application to 0/1 knapsack problem Kaushik Kumar [J].
Bhattacharjee, Kaushik Kumar ;
Sarmah, S. P. .
APPLIED SOFT COMPUTING, 2014, 19 :252-263
[9]   A Hybrid Database Intrusion Detection Algorithm Using Swarm Intelligence and Radial Basis Function Network [J].
Brahma, Anitarani ;
Panigrahi, Suvasini ;
Mahapatra, Jayasmita .
HELIX, 2019, 9 (03) :5031-5035
[10]   State quantized sampled-data control design for complex-valued memristive neural networks [J].
Cai, Li ;
Xiong, Lianglin ;
Cao, Jinde ;
Zhang, Haiyang ;
Alsaadi, Fawaz E. .
JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 2022, 359 (09) :4019-4053