| Autor: |
Shao, Zengzhen, Liu, Yanmin, Dong, Shuxia |
| Zdroj: |
Advanced Intelligent Computing Theories & Applications; 2010, p602-610, 9p |
| Abstrakt: |
Multi-Objective Particle Swarm Optimizers (MOPSOs) easily converge to a false Pareto front. In this paper, we proposed a hybrid algorithm of MOPSO with evolutionary programming (denoted as EPMOPSO) for solving MOPs. In EPMOPSO, the neighborhood of each particle is dynamically constructed, and the velocity of each particle is adjusted by all particles in its neighborhood including itself, the best performing particle in the swarm and the elite group that is evolved using evolutionary programming. Simulation results show that EPMOPSO is able to find a much better spread of solutions and has faster convergence to true Pareto-optimal front compared with five state-of-the-art MOPSOs. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
