New Multiobjectve PSO Algorithm for Nonlinear Constrained Programming Problems

DOI

10.2991/iske.2007.15How to use a DOI?

Keywords

nonlinear constrained programming; swarm algorithm; multiobjectve optimization; adaptively dynamically changing

Abstract

A new approach is presented to solve nonlinear constrained programming problems (NLCPs) by using particle swarm algorithm(PSO). It neither uses any penalty functions, nor distinguish the feasible solutions and the infeasible solutions including swarm. The new technique treats the NLCPs as a bi-objective optimization problem, one objective is the original objective of NLCPs, and the other is the degree violation of constraints. As we prefer to keep the ratio of infeasible solutions so as to increase the diversity of swarm and avoid the defect of conventional over-penalization, a new fitness function is designed based on the second objective. In order to make the PSO escape from the local optimum easily, we also design a adaptively dynamically changing inertia weight. The numerical experiment shows that the algorithm is effective.

Copyright

© 2007, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Chun-an Liu
PY  - 2007/10
DA  - 2007/10
TI  - New Multiobjectve PSO Algorithm for Nonlinear Constrained Programming Problems
BT  - Proceedings of the 2007 International Conference on Intelligent Systems and Knowledge Engineering (ISKE 2007)
PB  - Atlantis Press
SP  - 80
EP  - 83
SN  - 1951-6851
UR  - https://doi.org/10.2991/iske.2007.15
DO  - 10.2991/iske.2007.15
ID  - Liu2007/10
ER  -