A simplified and efficient particle swarm optimization algorithm considering particle diversity

In this paper, a dynamic self-adapting and simple particle swarm optimization algorithm with the disturbed extremum and crossover is proposed in order to improve the problem of particle swarm optimization in dealing with high-dimensional multi-extremum problem which is easy to fall into the local extremum and the accuracy of search and speed of the rapid decline problem in the late evolution. The dynamic self-adapting inertia weight and simplified speed equation strategy reduce the computational difficulty of the algorithm and improve the problem of slow convergence and low precision of the evolutionary algorithm due to the particle divergence caused by the velocity term; Extreme value perturbation and hybridization strategies are used to adjust the global extremes and individual positions of the particles to ensure the diversity and vigor of the particles in the late evolutionary period, and improve the ability of the particles to get rid of the local extremes. Three sets of computational experiments are carried out to compare and evaluate the search speed, convergence accuracy and population diversity of the improved algorithm, the results show that the improved algorithm has obtained a very good optimization effect and improved the practicability of the particle swarm optimization algorithm. It shows that the improved algorithm has improved the search speed, precision and population diversity of the optimization algorithm which improves the practicability of the particle swarm algorithm and achieves the expected effect.