원문정보
초록
영어
Particle swarm optimization (PSO) algorithm is a population-based search algorithm by simulating the social behavior of birds within a flock. It is a simple and efficient optimization algorithm. But it exists the low computational speed and easy falling into local optimal solution in solving the complex problem. So the quantum theory, adaptive inertia weight, disturbance factor and diversity mutation strategy are introduced into the PSO algorithm in order to propose an improved PSO(IWDMDQPSO) algorithm in this paper. In the IWDMDQPSO algorithm, the quantum theory is used to change the updating mode of the particles for guaranteeing the simplification and effectiveness of the algorithm. The adaptive inertia weight is used to improve the premature convergence of the algorithm. The disturbance factor is used to avoid the premature of the algorithm. The diversity mutation strategy is used to improve the global searching ability and computation speed. Finally, the famous benchmark functions are selected to prove the performance and effectiveness of the proposed IWDMDQPSO algorithm. The experiment results show that the proposed IWDMDQPSO algorithm takes on better solving accuracy and higher computation speed in solving the complex function. So it has a remarkable optimization performance.
목차
1. Introduction
2. Particle Swarm Optimization (PSO) Algorithm
3. The Quantum PSO Algorithm
4. The Description of Multi Strategies
4.1. Adaptive Inertia Weight
4.2 The Disturbance Factor
4.3. The Diversity Mutation Strategy
5. An Improved QPSO (IWDMDQPSO) Algorithm Based on the Multi Strategies
6. Experiment and Results
6.1. Test Function and Test Environment
6.2. Test Results and Analysis
7. Conclusion
Acknowledgments
References
