Abstract: A hybrid particle swarm optimization algorithm based on the chaos search is proposed. It can not only overcome the disadvantage of easily getting into the local extremum in the later evolution period, but also keep the rapidity of the previous period. Finally, the basic particle swarm optimization algorithm is compared with the hybrid algorithm. The experiment results demonstrate that the new algorithm proposed is better than the basic particle swarm optimization algorithm in the aspects of convergence and stability.

Key words: chaos search, hybrid algorithm, ergodicity, local extremum , particle swarm optimization algorithm