EMOPSO: a multi-objective particle swarm optimizer with emphasis on efficiency. This paper presents the Efficient Multi-Objective Particle Swarm Optimizer (EMOPSO), which is an improved version of a multi-objective evolutionary algorithm (MOEA) previously proposed by the authors. Throughout the paper, we provide several details of the design process that led us to EMOPSO. The main issues discussed are: the mechanism to maintain a set of well-distributed nondominated solutions, the turbulence operator that avoids premature convergence, the constraint-handling scheme, and the study of parameters that led us to propose a self-adaptation mechanism. The final algorithm is able to produce reasonably good approximations of the Pareto front of problems with up to 30 decision variables, while performing only 2,000 fitness function evaluations. As far as we know, this is the lowest number of evaluations reported so far for any multi-objective particle swarm optimizer. Our results are compared with respect to the NSGA-II in 12 test functions taken from the specialized literature.
Keywords for this software
References in zbMATH (referenced in 3 articles )
Showing results 1 to 3 of 3.
- Yun, Yeboon; Nakayama, Hirotaka; Yoon, Min: Generation of Pareto optimal solutions using generalized DEA and PSO (2016)
- Wang, Yan; Zeng, Jian-chao: A multi-objective artificial physics optimization algorithm based on ranks of individuals (2013)
- Durillo, J.J.; Nebro, A.J.; Luna, F.; Coello, C.A.Coello; Alba, E.: Convergence speed in multi-objective metaheuristics: efficiency criteria and empirical study (2010)