Chapter 57 An Adaptive Cultural Algorithm Based on Dynamic Particle Swarm Optimization

摘要

To avoid the local optimum problems and to improve convergent speed when particle swarm optimization algorithm in solving complex problems, an adaptive cultural algorithm based on dynamic particle swarm optimization algorithm was proposed. Particle swarm algorithm introduced evaluation premature convergence degree of index to judge the population space condition to determine the role of the influence function time. The inertia weight of the particle was adjusted adaptively based on the premature convergence degree of the swarm. The diversity of inertia weight makes a compromise between the global convergence and the speed of convergence. The proposed algorithm was tested with four well-known benchmark functions. The experimental results show that the new algorithm has great global search ability convergence accuracy and convergence velocity is also increased and avoid the premature convergence problem effectively.