Variants of an adaptive penalty scheme for steady-state genetic algorithms in engineering optimization

Abstract

Purpose

The purpose of this paper is to propose variants of an adaptive penalty scheme for steady-state genetic algorithms applied to constrained engineering optimization problems.

Design/methodology/approach

For each constraint a penalty parameter is adaptively computed along the evolution according to information extracted from the current population such as the existence of feasible individuals and the level of violation of each constraint. The adaptive penalty method (APM), as originally proposed, computes the constraint violations of the initial population, and updates the penalty coefficient of each constraint after a given number of new individuals are inserted in the population. A second variant, called sporadic APM with constraint violation accumulation, works by accumulating the constraint violations during a given insertion of new offspring into the population, updating the penalty coefficients, and fixing the penalty coefficients for the next generations. The APM with monotonic penalty coefficients is the third variation, where the penalty coefficients are calculated as in the original method, but no penalty coefficient is allowed to have its value reduced along the evolutionary process. Finally, the penalty coefficients are defined by using a weighted average between the current value of a coefficient and the new value predicted by the method. This variant is called the APM with damping.

Findings

The paper checks new variants of an APM for evolutionary algorithms; variants of an APM, for a steady-state genetic algorithm based on an APM for a generational genetic algorithm, largely used in the literature previously proposed by two co-authors of this manuscript; good performance of the proposed APM in comparison with other techniques found in the literature; innovative and general strategies to handle constraints in the field of evolutionary computation.

Research limitations/implications

The proposed algorithm has no limitations and can be applied in a large number of evolutionary algorithms used to solve constrained optimization problems.

Practical implications

The proposed algorithm can be used to solve real world problems in engineering as can be viewed in the references, presented in this manuscript, that use the original (APM) strategy. The performance of these variants is examined using benchmark problems of mechanical and structural engineering frequently discussed in the literature.

Originality/value

It is the first extended analysis of the variants of the APM submitted for possible publication in the literature, applied to real world engineering optimization problems.

Citation

Lemonge, A.C.C., Barbosa, H.J.C. and Bernardino, H.S. (2015), "Variants of an adaptive penalty scheme for steady-state genetic algorithms in engineering optimization", Engineering Computations, Vol. 32 No. 8, pp. 2182-2215. https://doi.org/10.1108/EC-07-2014-0158