A penalty approach to handle inequality constraints in particle swarm optimization

Kazuaki Masuda, Kenzo Kurihara, Eitaro Aiyoshi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

12 Citations (Scopus)

Abstract

This paper proposes a penalty method for solving nonlinear optimization problems with inequalities by the particle swarm optimization (PSO) algorithm. The proposed method is not only very simple but also useful. One should only search for the global solution of a series of unconstrained minimization problems simply by a standard PSO algorithm. It does not require to check the feasibility of search points during the search. Moreover, it is shown that the global best solution gets feasible as the penalty parameter is increased to a sufficiently but finitely large value. The proposed method is verified by numerical experiments to famous benchmark problems.

Original languageEnglish
Title of host publication2010 IEEE International Conference on Systems, Man and Cybernetics, SMC 2010
Pages2520-2525
Number of pages6
DOIs
Publication statusPublished - 2010 Dec 1
Event2010 IEEE International Conference on Systems, Man and Cybernetics, SMC 2010 - Istanbul, Turkey
Duration: 2010 Oct 102010 Oct 13

Publication series

NameConference Proceedings - IEEE International Conference on Systems, Man and Cybernetics
ISSN (Print)1062-922X

Other

Other2010 IEEE International Conference on Systems, Man and Cybernetics, SMC 2010
CountryTurkey
CityIstanbul
Period10/10/1010/10/13

Keywords

  • Constraint handling
  • Nonlinear programming
  • Particle swarm optimization (PSO)
  • Penalty method

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Control and Systems Engineering
  • Human-Computer Interaction

Fingerprint Dive into the research topics of 'A penalty approach to handle inequality constraints in particle swarm optimization'. Together they form a unique fingerprint.

Cite this