Binary Particle Swarm Optimization with Bit Change Mutation(Optimization,<Special Section>Nonlinear Theory and its Applications)

スポンサーリンク

概要

• 論文の詳細を見る

• Particle swarm optimization (PSO), inspired by social psychology principles and evolutionary computations, has been successfully applied to a wide range of continuous optimization problems. However, research on discrete problems has been done not much even though discrete binary version of PSO (BPSO) was introduced by Kennedy and Eberhart in 1997. In this paper, we propose a modified BPSO algorithm, which escapes from a local optimum by employing a bit change mutation. The proposed algorithm was tested on De jong's suite and its results show that BPSO with the proposed mutation outperforms the original BPSO.

• 社団法人電子情報通信学会の論文
• 2007-10-01

著者

• Lee Sangwook

  School Of Information & Mechatronics Gist

• PARK Haesun

  College of Computing at Georgia Tech

• JEON Moongu

  School of Information & Mechatronics, GIST

• Jeon Moongu

  School Of Information & Mechatronics Gist

関連論文

• Binary Particle Swarm Optimization with Bit Change Mutation(Optimization,Nonlinear Theory and its Applications)

スポンサーリンク