Modified binary particle swarm optimization

作     者：Sangwook Lee Sangmoon Soak Sanghoun Oh Witold Pedrycz Moongu Jeon 

作者机构：College of Computing Georgia Institute of Technology Atlanta GA 30332 USA Information Systems Examination Team Korean Intellectual Property Ofice (KIPO) Government Complex Daejeon Building 4 920 Dunsandong Seogu Republic of Korea Department of Information and Communications Gwangju Institute of Science and Technology 261 Cheomdan-gwagiro Buk-gu Gwanju Republic of Korea Department of Electrical and Computer Engineering University of Alberta Edmonton Alberta Canada T6G 2V4 

出 版 物：《Progress in Natural Science:Materials International》 (自然科学进展·国际材料(英文))

年 卷 期：2008年第18卷第9期

页      面：1161-1166页

核心收录：

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 0805[工学-材料科学与工程（可授工学、理学学位）] 070105[理学-运筹学与控制论] 0701[理学-数学] 0702[理学-物理学] 

基　　金：Plant TechnologyAdvancement Program funded by Ministry of Construction & Transportation (Grant No. C106A1520001-06A085600210) the UCN Project of the MIC 21CFrontier R&D Program of Korean government 

主　　题：Binary particle swarm optimization Genotype-phenotype Mutation 

摘      要：This paper presents a modified binary particle swarm optimization (BPSO) which adopts concepts of the genotype-phenotype rep-resentation and the mutation operator of genetic *** main feature is that the BPSO can be treated as a continuous *** proposed BPSO algorithm is tested on various benchmark functions, and its performance is compared with that of the original *** results show that the modified BPSO outperforms the original BPSO algorithm.