원문정보
초록
영어
In order to improve the weak situation of the global search ability, the stability and time consuming of optimization of differential evolution(DE) algorithm in solving high dimensional optimization problem, an improved differential evolution algorithm with multi- population and multi-strategy(MPMSIDE) is proposed to solve high dimensional optimization problem. Firstly, the different DE mutation strategies are studied. Then the MPMSIDE algorithm divides the population into several sub-populations, which evolve independently and communicate with each other at regular intervals by using different DE strategies, in order to save the computation time. And the improved mutation strategy and local optimization strategy are introduced to raise and balance the global searching ability and local searching ability, and improve the optimization efficiency. The selfadaptive update strategy is used to adjust the scaling factor and crossover factor for making the parameter sensitivity of DE algorithm and improving the stability and robustness. Finally, the proposed MPMSIDE algorithm is applied to standard test function optimization for verifying the effectiveness. The experimental results show that the proposed MPMSIDE algorithm has a relatively better optimization performance for solving complex optimization problem, and takes on remarkable optimizing ability, higher searching accuracy and faster convergence speed.
목차
1. Introduction
2. Differential Evolution
2.1. Initialization
2.2. Mutation
2.3. Crossover
2.4 Selection
3. An Improved DE Algorithm with Multi-population and Multi-Strategy (MPMSIDE)
3.1. The Idea of MPMSIDE Algorithm
3.2. The Flow of MPMSIDE Algorithm
4. The Results of Testing and Analyzing MPMSIDE Algorithm
5. Conclusion
ACKNOWLEDGEMENTS
References
