A MOPSO Algorithm Based Exclusively on Pareto Dominance Concepts
Alvarez-Benitez, Julio E.
Everson, Richard M.
Fieldsend, Jonathan E.
Lecture Notes in Computer Science
In extending the Particle Swarm Optimisation methodology to multi-objective problems it is unclear how global guides for particles should be selected. Previous work has relied on metric information in objective space, although this is at variance with the notion of dominance which is used to assess the quality of solutions. Here we propose methods based exclusively on dominance for selecting guides from a non-dominated archive. The methods are evaluated on standard test problems and we find that probabilistic selection favouring archival particles that dominate few particles provides good convergence towards and coverage of the Pareto front. We demonstrate that the scheme is robust to changes in objective scaling. We propose and evaluate methods for confining particles to the feasible region, and find that allowing particles to explore regions close to the constraint boundaries is important to ensure convergence to the Pareto front.
Copyright © 2005 Springer Verlag. The final publication is available at link.springer.com
3rd International Conference, EMO 2005, Guanajuato, Mexico, March 9-11, 2005. Proceedings
Book title: Evolutionary Multi-Criterion Optimization
Vol. 3410, pp. 459-473