Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
Evolutionary Computation
MOPSO: a proposal for multiple objective particle swarm optimization
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
A non-dominated sorting particle swarm optimizer for multiobjective optimization
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
Dynamic multiple swarms in multiobjective particle swarm optimization
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
Particle swarm optimization is a computational intelligence method of solving the multiobjective optimization problems. But for a given particle, there is no effective way to select its globally optimal particle and locally optimal particle. The particle angle is defined by the particle's objective vector. The globally optimal particle is selected according to the minimal particle angle. Updating the locally optimal particle and particle swarm is based on the Pareto dominance relationship between the locally optimal particle and the offspring particles and the particle's density. A multiobjective particle swarm optimization based on the minimal particle angle is proposed. The algorithm proposed is compared with sigma method ,NSPSO method and NSGA-II method on four complicated benchmark multiobjective function optimization problems. It is shown from the results that the Pareto front obtained with the algorithm proposed in this paper has good distribution, approach and extension properties.