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
Optimal design of a segmented thermoelectric generator based on three-dimensional numerical simulation and multi-objective genetic algorithm
TL;DR: A general method to optimize the structure and load current for a segmented thermoelectric generator (TEG) module, where the bismuth telluride is selected as the cold side material, and the skutterudite is chosen as the hotside material, is proposed.
Journal ArticleDOI
Optimal siting of DG units in power systems from a probabilistic multi-objective optimization perspective
TL;DR: In this article, a comprehensive multi-objective (MO) optimization approach by which all the crucial and maybe contradictory aspects of great influence in the placement process can be accounted for is presented.
Journal ArticleDOI
GGA: A modified genetic algorithm with gradient-based local search for solving constrained optimization problems
TL;DR: This work proposes a hybrid GA which combines the classical genetic mechanisms with the gradient-descent technique for local searching and constraints management and confers to GAs the capability of escaping from the discovered local optima, by progressively moving towards the global solution.
Journal ArticleDOI
A cooperative particle swarm optimizer with stochastic movements for computationally expensive numerical optimization problems
TL;DR: The main contribution of this study is proposing extraordinary motion for particles in the PSO, so called extraordinariness particle swarm optimizer (EPSO) which outperforms than the standard PSO and its variants for benchmarks such as CEC 2015 benchmarks.
Journal ArticleDOI
A Tutorial on Distance Metric Learning: Mathematical Foundations, Algorithms, Experimental Analysis, Prospects and Challenges
TL;DR: All the algorithms studied in this paper will be evaluated with exhaustive testing in order to analyze their capabilities in standard classification problems, particularly considering dimensionality reduction and kernelization.
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.