Pseudo-Adaptive Penalization to Handle Constraints in Particle Swarm Optimizers

Mauro Innocente, Johann Sienz

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

3 Citations (Scopus)

Abstract

Since particle swarm optimization is suitable for unconstrained problems only, some external technique needs to be incorporated to deal with constrained problems. One of the most popular techniques is the penalization method, where infeasible solutions are penalized by increasing the objective function value in minimization problems. The key is in the amount of penalization, which is typically linked to the amount of constraint violation. By turning the constrained problem into an unconstrained one, these methods are well suited for particle swarm optimizers because they do not disrupt the normal dynamics of the swarm. However they present the downside that problem-dependent penalization coefficients are involved: an excessive penalization might lead to premature convergence, whereas too mild a penalization might lead to infeasible solutions being chosen over feasible ones.
Ideally, the penalization coefficients should be adaptive. While research on adaptive coefficients is extensive in the literature, a different adaptive scheme is proposed here where the coefficients are kept constant. The procedure consists of an initial self-tuned relaxation of the constraint violation tolerances, followed by a pseudo-adaptive decrease of the relaxations. The self-tuning is performed so that an approximate target feasibility ratio is reached. The pseudo-adaptive decrease is linked to the number of potential feasible solutions found at the current time-step. Thus, by linking the penalization to the constraint violations beyond the pseudo-adaptive tolerance rather than to the actual constraint violations, a pseudo-adaptive penalization is achieved.
A particle swarm optimizer equipped with this constraint-handling mechanism is successfully tested on a suite of thirteen constrained problems. For comparison, the experiments are also performed without tolerance relaxations, and with the initial self-tuned relaxation followed by a deterministic decrease. Comparisons to the results reported by Toscano Pulido et al. and by Muñoz Zavala et al. are offered as frames of reference. The pseudo-adaptive tolerance relaxations scheme is successful in improving the solutions obtained for problems with low feasibility ratios and/or whose solutions are near or on the boundaries.
Original languageEnglish
Title of host publicationProceedings of the Tenth International Conference on Computational Structures Technology
EditorsB.H.V. Topping, J.M. Adam, F.J. Pallarés, R. Bru, M.L. Romero
Place of PublicationStirlingshire
PublisherSaxe-Coburg Publications
ISBN (Print) 978-1-905088-38-6
DOIs
Publication statusPublished - 2010
Externally publishedYes
Event10th Int. Conference on Computational Structures Technology - Universidad Politécnica de Valencia, Valencia, Spain
Duration: 14 Sep 201017 Sep 2010
Conference number: 10
http://www.civil-comp.com/conf/cst2010.htm

Publication series

NameCivil-Comp Proceedings
ISSN (Electronic)1759-3433

Conference

Conference10th Int. Conference on Computational Structures Technology
CountrySpain
CityValencia
Period14/09/1017/09/10
Internet address

Keywords

  • particle swarm optimization
  • pseudo-adaptive tolerance relaxation
  • penalization method
  • constant coefficients

Fingerprint Dive into the research topics of 'Pseudo-Adaptive Penalization to Handle Constraints in Particle Swarm Optimizers'. Together they form a unique fingerprint.

Cite this