Particle swarm optimization with information share mechanism
- Authors
- Zhan, Zhi-Hui; Zhang, Jun; Huang, Rui-Zhang
- Issue Date
- Jul-2009
- Publisher
- ACM
- Keywords
- Global numerical optimization; Information share; Particle swarm optimization
- Citation
- GECCO '09: Proceedings of the 11th Annual conference on Genetic and evolutionary computation, pp 1761 - 1762
- Pages
- 2
- Indexed
- SCOPUS
- Journal Title
- GECCO '09: Proceedings of the 11th Annual conference on Genetic and evolutionary computation
- Start Page
- 1761
- End Page
- 1762
- URI
- https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/117895
- DOI
- 10.1145/1569901.1570146
- Abstract
- This paper proposes an information share mechanism into particle swarm optimization (PSO) in order to use all the useful information of the swarm to prevent premature convergence. The particle in traditional PSO uses only the information from its personal best position and the neighborhood's best position. This mechanism is not with sufficient search information and therefore the algorithm is easy to be trapped into local optima. In the proposed information share PSO (ISPSO), all the particles post their best search information to a share device and any particle can read the information on the device and use the information provided by any other particle to help enhance its search ability. Therefore, the ISPSO can use the whole swarm's information to guide the flying direction. The ISPSO has been applied to optimize multimodal functions, and the experimental results demonstrate that the ISPSO can yield better performance when is compared with the traditional and some other improved PSOs.
- Files in This Item
-
Go to Link
- Appears in
Collections - COLLEGE OF ENGINEERING SCIENCES > SCHOOL OF ELECTRICAL ENGINEERING > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.