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
Proceedings ArticleDOI
A Null Synthesis Technique-Based Beamformer for Uniform Rectangular Arrays
TL;DR: In this article , a beamformer based on the null synthesis technique for uniform rectangular arrays of half-wavelength dipoles is proposed, which uses complex weight control to produce adaptive patterns with small distortions in sidelobes.
Journal ArticleDOI
Improving black tea quality through optimization of withering conditions using artificial neural network and genetic algorithm
Proceedings ArticleDOI
Distributed Design Optimization of Large Aspect Ratio Wing Aircraft with Rapid Transonic Flutter Analysis in Linux
Proceedings ArticleDOI
Hybrid Time-Energy Optimal Trajectory Planning for Robot Manipulators With Path and Uniform Velocity Constraints
TL;DR: In this article , a pseudo acceleration allocation method is proposed for robot manipulators to achieve a uniform linear velocity distribution without violating robot joint constraints, and the time energy indicator is minimized during the motion.
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.