2007•Journal of systems managementRequires access

A New Particle Swarm Optimization for Solving Constrained Optimization Problems

Kong Min

Open publisher page 9 citations

Abstract

This paper proposes a new particle swarm optimization(PSO) for solving the constrained optimization problems.Based upon an acceptable assumption that any feasible solution is better than any infeasible solution,a new mechanism for constraints handling is incorporated in the standard PSO to transform the constrained optimization problem into an unconstrained optimization problem.In addition to the mechanism of constraints handling,a mutation strategy to increase population diversity is added to the proposed algorithm,which can enhance the probability of leading the particle swarm escape from local optimums,and then improve the convergence speed and solution quality.The experimental results compared with genetic algorithm and a standard PSO show that the proposed algorithm is a feasible algorithm for solving constrained optimization problems.

About this research paper

What this paper is about

This paper proposes a new particle swarm optimization(PSO) for solving the constrained optimization problems.Based upon an acceptable assumption that any feasible solution is better than any infeasible solution,a new mechanism for constraints handling is incorporated in the standard PSO to transform the constrained optimization problem into an unconstrained optimization problem.In addition to the mechanism of constraints handling,a mutation strategy to increase population diversity is added to the proposed algorithm,which can enhance the probability of leading the particle swarm escape from local optimums,and then improve the convergence speed and solution quality.The experimental results compared with genetic algorithm and a standard PSO show that the proposed algorithm is a feasible algorithm for solving constrained optimization problems.

Why it matters

OpenAlex reports 9 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

This paper proposes a new particle swarm optimization(PSO) for solving the constrained optimization problems.Based upon an acceptable assumption that any feasible solution is better than any infeasible solution,a new mechanism for constraints handling is incorporated in the standard PSO to transform the constrained optimization problem into an unconstrained optimization problem.In addition to the mechanism of constraints handling,a mutation strategy to increase population diversity is added to the proposed algorithm,which can enhance the probability of leading the particle swarm escape from local optimums,and then improve the convergence speed and solution quality.The experimental results compared with genetic algorithm and a standard PSO show that the proposed algorithm is a feasible algorithm for solving constrained optimization problems.

Key concepts: Multi-swarm optimization, Mathematical optimization, Particle swarm optimization, Meta-optimization, Metaheuristic, Convergence (economics), Derivative-free optimization, Computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
A New Particle Swarm Optimization for Solving Constrained Optimization Problems — Research Paper | ScholarLens