A hybrid multi-swarm particle swarm optimization to solve constrained optimization problems

In the real-world applications, most optimization problems are subject to different types of constraints. These problems are known as constrained optimization problems (COPs). Solving COPs is a very important area in the optimization field. In this paper, a hybrid multi-swarm particle swarm optimiza...

Full description

Saved in:
Bibliographic Details
Published inFrontiers of Computer Science Vol. 3; no. 1; pp. 38 - 52
Main Authors WANG, Yong, CAI, Zixing
Format Journal Article
LanguageEnglish
Published Heidelberg Higher Education Press 01.03.2009
SP Higher Education Press
Springer Nature B.V
Subjects
Online AccessGet full text
ISSN2095-2228
1673-7350
2095-2236
1673-7466
DOI10.1007/s11704-009-0010-x

Cover

More Information
Summary:In the real-world applications, most optimization problems are subject to different types of constraints. These problems are known as constrained optimization problems (COPs). Solving COPs is a very important area in the optimization field. In this paper, a hybrid multi-swarm particle swarm optimization (HMPSO) is proposed to deal with COPs. This method adopts a parallel search operator in which the current swarm is partitioned into several subswarms and particle swarm optimization (PSO) is severed as the search engine for each sub-swarm. Moreover, in order to explore more promising regions of the search space, differential evolution (DE) is incorporated to improve the personal best of each particle. First, the method is tested on 13 benchmark test functions and compared with three stateof-the-art approaches. The simulation results indicate that the proposed HMPSO is highly competitive in solving the 13 benchmark test functions. Afterward, the effectiveness of some mechanisms proposed in this paper and the effect of the parameter setting were validated by various experiments. Finally, HMPSO is further applied to solve 24 benchmark test functions collected in the 2006 IEEE Congress on Evolutionary Computation (CEC2006) and the experimental results indicate that HMPSO is able to deal with 22 test functions.
Bibliography:differential evolution
Document received on :2008-09-01
Document accepted on :2008-10-29
particle swarm optimization
constrainthandling technique
constrained optimization problems
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2095-2228
1673-7350
2095-2236
1673-7466
DOI:10.1007/s11704-009-0010-x