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
Citations
More filters
Inverse Kinematic Multiobjective Optimization For A Vehicle-Arm Robot System Using Evolutionary Algorithms
Humberto Rodríguez,Ilka Banfield +1 more
TL;DR: This work presents a review of the most important techniques used for solving the inverse kinematic problem, focusing at the end on the application of a Non-Dominated, Sorting, Elitist MOEA with nonlinear constraints.
Journal ArticleDOI
Resolution-Oriented Weighted Stacking Algorithm
TL;DR: In this article , the authors proposed a weighted stacking algorithm for obtaining high-resolution data and constructed an optimization objective function using the similarity of the stacked amplitude spectrum and constant (amplitude spectrum of impulse function).
Book ChapterDOI
Optimization Algorithms and Energy Management Strategies
TL;DR: An advanced fuel economy strategy using fueling regulators switching is presented and analyzed in this chapter as fuel economy under constant and variable load.
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
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.