Study of adaptive chaos embedded particle swarm optimization algorithm based on Skew Tent map
Hua Rong
Abstract
Hua Rong
Abstract
The existing chaos optimization algorithms were almost based on Logistic map. However, the probability density function of chaotic sequences for Logistic map is a Chebyshev type function, which may affect the global searching capacity and computational efficiency of chaos optimization algorithm. In this paper, firstly, a new chaotic sequences with Skew Tent map (STM) is established, and is improved by its iterative optimization property. Then, the Skew Tent map (STM) is introduced to perform the chaotic search. An adaptive chaos embedded particle swarm optimization algorithm combined with STM (STMACPSO) is proposed subsequently. The convergence speed and global optimal value of the presented algorithm are thus improved. Finally, The experiments with complex and Multi-dimensional functions demonstrate that STMACPSO outperforms the original CPSO in the global searching ability and convergence rate.
OpenAlex reports 9 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The existing chaos optimization algorithms were almost based on Logistic map. However, the probability density function of chaotic sequences for Logistic map is a Chebyshev type function, which may affect the global searching capacity and computational efficiency of chaos optimization algorithm. In this paper, firstly, a new chaotic sequences with Skew Tent map (STM) is established, and is improved by its iterative optimization property. Then, the Skew Tent map (STM) is introduced to perform the chaotic search. An adaptive chaos embedded particle swarm optimization algorithm combined with STM (STMACPSO) is proposed subsequently. The convergence speed and global optimal value of the presented algorithm are thus improved. Finally, The experiments with complex and Multi-dimensional functions demonstrate that STMACPSO outperforms the original CPSO in the global searching ability and convergence rate.
Key concepts: Particle swarm optimization, Chaotic, Tent map, Convergence (economics), Logistic map, Mathematical optimization, Multi-swarm optimization, Skew