{"title":"A modified particle swarm optimization algorithm for reliability problems","authors":"D. Zou, Jianhua Wu, Liqun Gao, Xin Wang","doi":"10.1109/BICTA.2010.5645107","DOIUrl":null,"url":null,"abstract":"A modified particle swarm optimization (MPSO) algorithm is proposed to solve reliability problems in this paper. The MPSO modifies the velocity updating of particle swarm optimization (PSO) algorithm. For each particle, its personal best particle and the global best particle are separated to update its velocity, in other words, either its personal best particle or the global best particle is considered for velocity updating, and it is determined by a dynamic probability. In addition, a new inertia weight is introduced into the velocity updating, and it is used to balance the global search and local search. Based on a large number of experiments, the proposed algorithm has demonstrated stronger convergence and stability than the other two PSO algorithms on solving reliability problems. The results show that the MPSO can be an efficient alternative for solving reliability problems.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BICTA.2010.5645107","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
A modified particle swarm optimization (MPSO) algorithm is proposed to solve reliability problems in this paper. The MPSO modifies the velocity updating of particle swarm optimization (PSO) algorithm. For each particle, its personal best particle and the global best particle are separated to update its velocity, in other words, either its personal best particle or the global best particle is considered for velocity updating, and it is determined by a dynamic probability. In addition, a new inertia weight is introduced into the velocity updating, and it is used to balance the global search and local search. Based on a large number of experiments, the proposed algorithm has demonstrated stronger convergence and stability than the other two PSO algorithms on solving reliability problems. The results show that the MPSO can be an efficient alternative for solving reliability problems.