OAK

Modified binary particle swarm optimization

Metadata Downloads
Abstract
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. (C) 2008 National Natural Science Foundation of China and Chinese Academy of Sciences. Published by Elsevier Limited and Science in China Press. All rights reserved.
Author(s)
Lee, SangwookSoak, SangmoonOh, SanghounPedrycz, WitoldJeon, Moongu
Issued Date
2008-09
Type
Article
DOI
10.1016/j.pnsc.2008.03.018
URI
https://scholar.gist.ac.kr/handle/local/17292
Publisher
ELSEVIER SCIENCE INC
Citation
Progress in Natural Science: Materials International, v.18, no.9, pp.1161 - 1166
ISSN
1002-0071
Appears in Collections:
Department of Electrical Engineering and Computer Science > 1. Journal Articles
공개 및 라이선스
  • 공개 구분공개
파일 목록
  • 관련 파일이 존재하지 않습니다.

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.