An improved particle swarm optimization algorithm for reliability problems

✍ Scribed by Peifeng Wu; Liqun Gao; Dexuan Zou; Steven Li

• Publisher: Elsevier Science
• Year: 2011
• Tongue: English
• Weight: 496 KB
• Volume: 50
• Category: Article
• ISSN: 0019-0578
• DOI: 10.1016/j.isatra.2010.08.005

✦ Synopsis

An improved particle swarm optimization (IPSO) algorithm is proposed to solve reliability problems in this paper. The IPSO designs two position updating strategies: In the early iterations, each particle flies and searches according to its own best experience with a large probability; in the late iterations, each particle flies and searches according to the fling experience of the most successful particle with a large probability. In addition, the IPSO introduces a mutation operator after position updating, which can not only prevent the IPSO from trapping into the local optimum, but also enhances its space developing ability. Experimental results show that the proposed algorithm has stronger convergence and stability than the other four particle swarm optimization algorithms on solving reliability problems, and that the solutions obtained by the IPSO are better than the previously reported best-known solutions in the recent literature.