摘要
The deficiencies of basic particle swarm optimization （bPSO） are its ubiquitous prematurity and its inability to seek the global optimal solution when optimizing complex high-dimensional functions. To overcome such deficiencies, the chaos-PSO （COSPSO） algorithm was established by introducing the chaos optimization mechanism and a global particle stagnation-disturbance strategy into bPSO. In the improved algorithm, chaotic movement was adopted for the particles＇ initial movement trajectories to replace the former stochastic movement, and the chaos factor was used to guide the particles＇ path. When the global particles were stagnant, the disturbance strategy was used to keep the particles in motion. Five benchmark optimizations were introduced to test COSPSO, and they proved that COSPSO can remarkably improve efficiency in optimizing complex functions. Finally, a case study of COSPSO in calculating design flood hydrographs demonstrated the applicability of the improved algorithm.
The deficiencies of basic particle swarm optimization （bPSO） are its ubiquitous prematurity and its inability to seek the global optimal solution when optimizing complex high-dimensional functions. To overcome such deficiencies, the chaos-PSO （COSPSO） algorithm was established by introducing the chaos optimization mechanism and a global particle stagnation-disturbance strategy into bPSO. In the improved algorithm, chaotic movement was adopted for the particles＇ initial movement trajectories to replace the former stochastic movement, and the chaos factor was used to guide the particles＇ path. When the global particles were stagnant, the disturbance strategy was used to keep the particles in motion. Five benchmark optimizations were introduced to test COSPSO, and they proved that COSPSO can remarkably improve efficiency in optimizing complex functions. Finally, a case study of COSPSO in calculating design flood hydrographs demonstrated the applicability of the improved algorithm.
基金
supported by the National Basic Research Program of China (973 Program) (Grant No.2006CB403402)
