The search functionality is under construction.
The search functionality is under construction.

Binary Particle Swarm Optimization with Bit Change Mutation

Sangwook LEE, Haesun PARK, Moongu JEON

  • Full Text Views

    0

  • Cite this

Summary :

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.

Publication
IEICE TRANSACTIONS on Fundamentals Vol.E90-A No.10 pp.2253-2256
Publication Date
2007/10/01
Publicized
Online ISSN
1745-1337
DOI
10.1093/ietfec/e90-a.10.2253
Type of Manuscript
Special Section LETTER (Special Section on Nonlinear Theory and its Applications)
Category
Optimization

Authors

Keyword