In this paper, we present an extension of the heuristic called "particle swarm optimization" (PSO) that is able to deal with multiobjective optimization problems. Our approach uses the concept of Pareto dominance to determine the flight direction of a particle and is based on the idea of having a set of subswarms instead of single particles. In each sub-swarm, a PSO algorithm is executed and, at some point, the different sub-swarms exchange information. Our proposed approach is validated using several test functions taken from the evolutionary multiobjective optimization literature. Our results indicate that the approach is highly competitive with respect to algorithms representative of the state-of-the-art in evolutionary multiobjective optimization. © Springer-Verlag Berlin Heidelberg 2004.
CITATION STYLE
Pulido, G. T., & Coello Coello, C. A. (2004). Using clustering techniques to improve the performance of a multi-objective particle swarm optimizer. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3102, 225–237. https://doi.org/10.1007/978-3-540-24854-5_20
Mendeley helps you to discover research relevant for your work.