2008•Unpublished venueRequires access

A decomposition-based multi-objective Particle Swarm Optimization algorithm for continuous optimization problems

Wei Peng, Qingfu Zhang

Open publisher page 85 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 85 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Particle swarm optimization, Mathematical optimization, Multi-swarm optimization, Decomposition, Imperialist competitive algorithm, Differential evolution, Metaheuristic, Evolutionary algorithm

Related papers

Back to paper searchBrowse research topicsOriginal source
A decomposition-based multi-objective Particle Swarm Optimization algorithm for continuous optimization problems — Research Paper | ScholarLens