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
Journal ArticleDOI
Thermodynamic design space data-mining and multi-objective optimization of SCO2 Brayton cycles
TL;DR: In this paper, the authors implemented the thermodynamic design space data-mining and multi-objective optimization of two typical supercritical carbon dioxide (SCO2) Brayton cycles: the recompression Brayton cycle (RBC) and the reheating cycle (RRBC).
Journal ArticleDOI
Economic-statistical design of adaptive arma control chart for autocorrelated data
Antonio Costa,Sergio Fichera +1 more
TL;DR: In this article, the design of adaptive ARMA control charts with autocorrelated data has been investigated and an original research contribution has been made to address the design and analysis of adaptive control charts.
Journal ArticleDOI
Adaptation of the penalty function method to genetic algorithm in electromagnetic devices designing
TL;DR: In this article, a new method of determining the value of the penalty coefficient in subsequent iterations associated with changing penalty is proposed, which can be applied to solve constrained optimization tasks in electromagnetic devices designing.
Optimal Experimental Design for Parameter Identification and Model Selection
TL;DR: The Unscented Transformation (UT) approach as an alternative to standard approaches of uncertainty propagation is reviewed in detail and it is demonstrated that the UT method outperforms the linearisation concept in precision while utilising a low level of computational load compared to Monte Carlo simulations.
Proceedings ArticleDOI
A comparative study of evolutionary algorithms for phase shifting transformer setting optimization
TL;DR: The investigation shows that the attractive and repulsive Particle Swarm Optimization (ARPSO) performs as good as Differential Evolution and are consequently most suitable to solve the PST optimization problem.
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.