A novel strategy of pareto-optimal solution searching in multi-objective particle swarm optimization (MOPSO)
✍ Scribed by Junjie Yang; Jianzhong Zhou; Li Liu; Yinghai Li
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 525 KB
- Volume
- 57
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
✦ Synopsis
a b s t r a c t
In multi-objective particle swarm optimization (MOPSO) algorithms, finding the global optimal particle (gBest) for each particle of the swarm from a set of non-dominated solutions is very difficult yet an important problem for attaining convergence and diversity of solutions. First, a new Pareto-optimal solution searching algorithm for finding the gBest in MOPSO is introduced in this paper, which can compromise global and local searching based on the process of evolution. The algorithm is implemented and is compared with another algorithm which uses the Sigma method for finding gBest on a set of well-designed test functions. Finally, the multi-objective optimal regulation of cascade reservoirs is successfully solved by the proposed algorithm.