{"title":"Enhance Performance of Particle Swarm Optimization by Altering the Worst Personal Best Particle","authors":"Chang-Huang Chen, Chih-Ming Lin","doi":"10.1109/TAAI.2012.62","DOIUrl":null,"url":null,"abstract":"In this paper, a strategy to increase the performance of particle swarm optimization is proposed. The idea is to altering the content of the worst particle of the personal best particles after each iteration. The behavior of the worst personal best particle is then forced to move out its regular path and then affects other particles' behavior. This approach prevents the particles getting stuck on local minimum. To altering the worst personal particle, some of its elements are replaced by its opposition values, inspired by the concept of opposition-based learning, and some elements are taken from the global best ever found or other personal best particle. Depending on which personal best particles are used, two variants are developed. The strategy enhances the exploration and exploitation capability of particle swarm optimization, since both approaches achieve better solution quality and convergent speed when tested on a suite of benchmark function, especially for multimodal functions, as demonstrated in the paper.","PeriodicalId":385063,"journal":{"name":"2012 Conference on Technologies and Applications of Artificial Intelligence","volume":"515 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Conference on Technologies and Applications of Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TAAI.2012.62","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
In this paper, a strategy to increase the performance of particle swarm optimization is proposed. The idea is to altering the content of the worst particle of the personal best particles after each iteration. The behavior of the worst personal best particle is then forced to move out its regular path and then affects other particles' behavior. This approach prevents the particles getting stuck on local minimum. To altering the worst personal particle, some of its elements are replaced by its opposition values, inspired by the concept of opposition-based learning, and some elements are taken from the global best ever found or other personal best particle. Depending on which personal best particles are used, two variants are developed. The strategy enhances the exploration and exploitation capability of particle swarm optimization, since both approaches achieve better solution quality and convergent speed when tested on a suite of benchmark function, especially for multimodal functions, as demonstrated in the paper.