Modified binary particle swarm optimization

This paper presents a modified binary particle swarm optimization （BPSO） which adopts concepts of the genotype-phenotype representation and the mutation operator of genetic algorithms. Its main feature is that the BPSO can be treated as a continuous PSO. The proposed BPSO algorithm is tested on vari...

Full description

Saved in:
Bibliographic Details
Published inProgress in natural science Vol. 18; no. 9; pp. 1161 - 1166
Main Authors Lee, Sangwook, Soak, Sangmoon, Oh, Sanghoun, Pedrycz, Witold, Jeon, Moongu
Format Journal Article
LanguageEnglish
Published Elsevier Ltd 01.09.2008
Subjects
Binary particle swarm optimization
BPSO
Genotype–phenotype
Mutation
基准功能
基因突变
Genotype–phenotype
Binary particle swarm optimization
Mutation
Online AccessGet full text
ISSN1002-0071
DOI10.1016/j.pnsc.2008.03.018

Cover

More Information
Summary:This paper presents a modified binary particle swarm optimization （BPSO） which adopts concepts of the genotype-phenotype representation and the mutation operator of genetic algorithms. Its main feature is that the BPSO can be treated as a continuous PSO. The proposed BPSO algorithm is tested on various benchmark functions, and its performance is compared with that of the original BPSO. Experimental results show that the modified BPSO outperforms the original BPSO algorithm.
Bibliography:Binary particle swarm optimization
Binary particle swarm optimization; Genotype-phenotype; Mutation
Mutation
Q343.1
Genotype-phenotype
11-3853/N
ISSN:1002-0071
DOI:10.1016/j.pnsc.2008.03.018