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. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Toscano-Pulido, G., Coello, C. A. C., & Santana-Quintero, L. V. (2007). EMOPSO: A multi-objective particle swarm optimizer with emphasis on efficiency. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4403 LNCS, pp. 272–285). Springer Verlag. https://doi.org/10.1007/978-3-540-70928-2_23
Mendeley helps you to discover research relevant for your work.