Quantum-Behaved Particle Swarm Optimization with Chaotic Search
スポンサーリンク
概要
- 論文の詳細を見る
The chaotic search is introduced into Quantum-behaved Particle Swarm Optimization (QPSO) to increase the diversity of the swarm in the latter period of the search, so as to help the system escape from local optima. Taking full advantages of the characteristics of ergodicity and randomicity of chaotic variables, the chaotic search is carried out in the neighborhoods of the particles which are trapped into local optima. The experimental results on test functions show that QPSO with chaotic search outperforms the Particle Swarm Optimization (PSO) and QPSO.
- 2008-07-01
著者
-
Nomura Hirosato
Faculty Of Computer Science And Systems Engineering Kyushu Institute Of Technology
-
YANG Kaiqiao
Faculty of Computer Science and Systems Engineering, Kyushu Institute of Technology
-
Yang Kaiqiao
Faculty Of Computer Science And Systems Engineering Kyushu Institute Of Technology