In order to improve the global and local fine search capabilities of the particle swarm algorithm and accelerate the convergence speed
hybrid particle swarm optimization algorithm based on intuitive fuzzy entropy is proposed. The algorithm constructs an adaptive function of intuitive fuzzy entropy by using the information of the historical optimal solution of particles
and uses the entropy value as a disturbance factor to dynamically adjust the inertia weight. At the same time
it establishes an adaptive global optimal particle learning strategy to train the disturbed particles
chooses learning objects based on maintaining the diversity of propagation
enables the particles to explore more new areas
and realizes the cooperation and parallel evolution among populations. Through simulation experiments
the algorithm is compared with two derivation algorithms and other improved particle swarm optimization algorithms on 11 test functions. The results show that the algorithm performs better in solving accuracy
convergence speed and optimization efficiency.
关键词
Keywords
references
Kennedy J , Eberhart R . Particle swarm optimization [A]. Proceedings of ICNN' 95 - International Conference on Neural Networks [C]. Piscataway : IEEE , 1995 . 1942 - 1948 .
Wang Z , Cai J J . The path-planning in radioactive environment of nuclear facilities using an improved particle swarm optimization algorithm [J]. Nuclear Engineering and Design , 2018 , 326 ( 10 ) : 79 - 86 .
Li M , Chen H , Wang X D , et al . An improved particle swarm optimization algorithm with adaptive inertia weights [J]. International Journal of Information Technology & Decision Making , 2019 , 18 ( 3 ): 833 - 866 .
Wang Y K , Chen X B . Hybrid quantum particle swarm optimization algorithm and its application [J]. Science China (Information Sciences) , 2020 , 63 ( 5 ): 203 - 205 .
Wang F , Zhang H , Li K S , et al . A hybrid particle swarm optimization algorithm using adaptive learning strategy [J]. Information Sciences , 2018 , 436 ( 4 ): 162 - 177 .
Cao L L , Xu L H , Goodman E D . A neighbor-based learning particle swarm optimizer with short-term and long-term memory for dynamic optimization problems [J]. Information Sciences , 2018 , 453 ( 2 ): 463 - 485 .
Wei G , Su Y H . Dynamic multi-objective optimization of chemical process based on bare bones particle swarm optimization [J]. Chemical Engineering Transactions , 2018 , 71 ( 9 ): 811 - 816 .
Ouyang H B , Gao L Q , Li S , et al . Improved global-best-guided particle swarm optimization with learning operation for global optimization problems [J]. Applied Soft Computing , 2017 , 52 ( 3 ): 987 - 1008 .
Krawczak M , Szkatuła G . On matching of intuitionistic fuzzy sets [J]. Information Sciences , 2020 , 517 ( 3 ): 254 - 274 .
Su D W , Zhou C M , Wang Y . Multi objective particle swarm optimization based on intuitionistic fuzzy entropy [J]. Computer Science , 2016 , 43 ( 8 ): 262 - 266 . (in Chinse)
Dokmanic I , Parhizkar R , Ranieri J , et al . Euclidean distance matrices: essential theory, algorithms, and applications [J]. IEEE Signal Processing Magazine , 2015 , 32 ( 6 ): 12 - 30 .
Wang Y , Lei Y J . A technique for constructing intuitionistic fuzzy entropy [J]. Control and Decision , 2007 , 22 ( 12 ): 1390 - 1394 . (in Chinse)
Liang J J , Qu B Y , Suganthan P N , et al . Problem Definitions and Evaluation Criteria for the CEC 2013 Special Session on Real-Parameter Optimization [R]. Zhengzhou,China : Computational Intelligence Laboratory, Zhengzhou University , 2013 .
Zhou L Y , Ding L X , Peng H , et al . Neighborhood centroid opposition-based particle swarm optimization [J]. Acta Electronica Sinica , 2017 , 45 ( 11 ): 2815 - 2824 . (in Chinse)
Sun H , Deng Z C , Zhao J , et al . Hybrid mean center opposition based learning particle swarm optimization [J]. Acta Electronica Sinica , 2019 , 47 ( 9 ): 1809 - 1818 . (in Chinse)
Sun Q , Gao L , Liu T , et al . Particle swarm optimization algorithm based on entropy model [J]. Journal of Southeast University (Natural Science Edition) , 2019 , 49 ( 6 ): 1088 - 1093 .