scispace - formally typeset
Open AccessJournal ArticleDOI

Penalty Function Methods for Constrained Optimization with Genetic Algorithms

Reads0
Chats0
TLDR
These penalty-based methods for handling constraints in Genetic Algorithms are presented and discussed and their strengths and weaknesses are discussed.
Abstract
Genetic Algorithms are most directly suited to unconstrained optimization. Application of Genetic Algorithms to constrained optimization problems is often a challenging effort. Several methods have been proposed for handling constraints. The most common method in Genetic Algorithms to handle constraints is to use penalty functions. In this paper, we present these penalty-based methods and discuss their strengths and weaknesses.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Modification of the SCE-UA to Include Constraints by Embedding an Adaptive Penalty Function and Application: Application Approach

TL;DR: In this paper, an adaptive penalty function was used to impose constraints on the shuffled complex evolution-University of Arizona (SCE-UA) to include constraints and to develop an automatic calibration module of the SWMM (storm water management model).
Journal ArticleDOI

Centrifugal pump impeller and volute shape optimization via combined NUMECA, genetic algorithm, and back propagation neural network

TL;DR: In this article, a combination of GA and back propagation neural network (BPNN) is employed to optimize the impeller design while preventing prematurity or stagnation due to the GA.
Journal ArticleDOI

Solving Constrained Optimization Problems with Sine-Cosine Algorithm

TL;DR: This study aims to show the performance of Sine-Cosine Algorithm on constrained optimization problems and compares the performances by using well-known constrained test functions.
Journal ArticleDOI

An efficient evolutionary algorithm to optimize the Choquet integral: ISLAM et al.

TL;DR: This work proposes efficient evolutionary algorithm (EA) operators that are guaranteed to naturally preserve constraints, thus eliminating the need to resort to costly evaluations and fixing of constraint violations, and scales well to large numbers of inequality constraints.
Journal ArticleDOI

Flutter Analysis of Aerostructures Test Wing with Test Validated Structural Dynamic Model

TL;DR: In this article, the mass properties, natural frequencies, and mode shapes are matched to the target data and the mass matrix orthogonality is retained to minimize the model uncertainties for the structural dynamic model of the Aerostructures Test Wing.
References
More filters
Book

Genetic algorithms in search, optimization, and machine learning

TL;DR: In this article, the authors present the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields, including computer programming and mathematics.
Book

Genetic Algorithms + Data Structures = Evolution Programs

TL;DR: GAs and Evolution Programs for Various Discrete Problems, a Hierarchy of Evolution Programs and Heuristics, and Conclusions.
Book

Nonlinear Programming: Theory and Algorithms

TL;DR: The book is a solid reference for professionals as well as a useful text for students in the fields of operations research, management science, industrial engineering, applied mathematics, and also in engineering disciplines that deal with analytical optimization techniques.
Journal ArticleDOI

An efficient constraint handling method for genetic algorithms

TL;DR: GA's population-based approach and ability to make pair-wise comparison in tournament selection operator are exploited to devise a penalty function approach that does not require any penalty parameter to guide the search towards the constrained optimum.
Book

Evolutionary algorithms in theory and practice

Thomas Bäck
TL;DR: In this work, the author compares the three most prominent representatives of evolutionary algorithms: genetic algorithms, evolution strategies, and evolutionary programming within a unified framework, thereby clarifying the similarities and differences of these methods.