A decomposition-based multi-objective Particle Swarm Optimization algorithm for continuous optimization problems
Wei Peng, Qingfu Zhang
Abstract
Wei Peng, Qingfu Zhang
Abstract
Particle Swarm Optimization (PSO) is a heuristic optimization technique that uses previous personal best experience and global best experience to search global optimal solutions. This paper studies the application of PSO techniques to multi-objective optimization using decomposition methods. A new decomposition-based multi-objective PSO algorithm is proposed, called MOPSO/D. It integrates PSO into a multi-obejective evolutionary algorithm based on decomposition (MOEA/D). The experimental results demonstrate that MOPSO/D can achieve better performance than a well-known MOEA, NSGA-II with differential evolution (DE), on most of the selected test instances. It shows that MOPSO/D will be a competitive candidate for multi-objective optimization.
OpenAlex reports 85 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Particle Swarm Optimization (PSO) is a heuristic optimization technique that uses previous personal best experience and global best experience to search global optimal solutions. This paper studies the application of PSO techniques to multi-objective optimization using decomposition methods. A new decomposition-based multi-objective PSO algorithm is proposed, called MOPSO/D. It integrates PSO into a multi-obejective evolutionary algorithm based on decomposition (MOEA/D). The experimental results demonstrate that MOPSO/D can achieve better performance than a well-known MOEA, NSGA-II with differential evolution (DE), on most of the selected test instances. It shows that MOPSO/D will be a competitive candidate for multi-objective optimization.
Key concepts: Particle swarm optimization, Mathematical optimization, Multi-swarm optimization, Decomposition, Imperialist competitive algorithm, Differential evolution, Metaheuristic, Evolutionary algorithm