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 it
An evolutionary game based particle swarm optimization algorithm
โ Scribed by Wei-Bing Liu; Xian-Jia Wang
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 455 KB
- Volume
- 214
- Category
- Article
- ISSN
- 0377-0427
No coin nor oath required. For personal study only.
โฆ Synopsis
Particle swarm optimization (PSO) is an evolutionary algorithm used extensively. This paper presented a new particle swarm optimizer based on evolutionary game (EGPSO). We map particles' finding optimal solution in PSO algorithm to players' pursuing maximum utility by choosing strategies in evolutionary games, using replicator dynamics to model the behavior of particles. And in order to overcome premature convergence a multi-start technique was introduced. Experimental results show that EGPSO can overcome premature convergence and has great performance of convergence property over traditional PSO.
๐ SIMILAR VOLUMES
This paper presents a co-evolutionary particle swarm optimization (CPSO) algorithm to solve global nonlinear optimization problems. A new co-evolutionary PSO (CPSO) is constructed. In the algorithm, a deterministic selection strategy is proposed to ensure the diversity of population. Meanwhile, base
We previously proposed to introduce evolutionary computation into particle swarm optimization (PSO), named evolutionary PSO (EPSO). It is well known that a constricted version of PSO, i.e., a canonical particle swarm optimizer (CPSO), has good convergence property compared with PSO. For further impr