Penalty Function Methods for Constrained Optimization with Genetic Algorithms
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
Book ChapterDOI
Context-awareness handoff planning in heterogeneous wireless networks
TL;DR: Two integrated approaches for context-awareness handoff planning mechanisms, namely MADM approach and GA approach are developed, which are able to derive a proper network handoff plan which guarantees QoS requirements and reduces delay, jitter, and number of handoffs.
Journal ArticleDOI
Robust design and optimization of UAV empennage
TL;DR: Methodology presented in this paper can be used in various optimization problems, especially those involving expensive computations and requiring top quality design.
Journal ArticleDOI
An intermediate point obstacle avoidance algorithm for serial robot
TL;DR: An intermediate point obstacle avoidance algorithm to ensure smooth trajectory and efficient movement during the obstacle avoidance process and a novel collision detection strategy and fitness evaluation function based on genetic algorithm to optimize the intermediate point parameters are proposed.
Journal ArticleDOI
Hybrid Evolutionary-Heuristic Algorithm for Capacitor Banks Allocation
TL;DR: An evolutionaryheuristic method has been proposed for optimal capacitor allocation in radial distribution networks and has given significantly better solutions for time dependent load in the 69-bus network than found in references.
Proceedings Article
High speed genetic algorithms in quantum logic synthesis: Low level parallelization vs. representation
TL;DR: A comparison between an efficient representation of the synthesized quantum circuit as Quantum Multi-valued Decision Diagram (QMDD) and a low level parallelized evaluation method using the hardware accelerated matrix manipulation is described.
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.