MOPSOhv: A new hypervolume-based multi-objective particle swarm optimizer
- 1 July 2014
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 1089778X,p. 266-273
Abstract
This paper proposes a new hypervolume-based multi-objective particle swarm optimizer (called MOPSOhv) that uses an external archive to store the global nondominated solutions found during the evolutionary process. The proposed algorithm makes use of the hypervolume contribution of archived solutions for selecting global and personal leaders for each particle in the main swarm, and also as a mechanism for pruning the external archive when it is updated with new nondominated solutions. In order to increase the diversity when particles are updated in their positions, a mutation operator is used. The performance of the proposed algorithm is evaluated adopting standard test problems and indicators reported in the specialized literature, comparing its results with respect to those obtained by state-of-the-art multi-objective evolutionary algorithms. Our preliminary results indicate that our proposal is competitive with respect to state-of-the-art multi-objective evolutionary algorithms, being particularly suitable for solving many-objective optimization problems (i.e., problems having more than 3 objectives).Keywords
This publication has 21 references indexed in Scilit:
- Parallel implementation of MOPSO on GPU using OpenCL and CUDA2011
- A multi-objective particle swarm optimizer based on decomposition2011
- Multiobjective evolutionary algorithms: A survey of the state of the artSwarm and Evolutionary Computation, 2011
- Empirical comparison of MOPSO methods - Guide selection and diversity preservation -2009
- Parallel multi-objective optimization using Master-Slave model on heterogeneous resources2008
- Multi-objective particle swarm optimization on computer grids2007
- Particle Swarm Optimization and Fitness Sharing to solve Multi-Objective Optimization Problems2005
- An effective use of crowding distance in multiobjective particle swarm optimization2005
- Covering Pareto-optimal fronts by subswarms in multi-objective particle swarm optimization2005
- Handling multiple objectives with particle swarm optimizationIEEE Transactions on Evolutionary Computation, 2004