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
Multi-objective sidetracking horizontal well trajectory optimization in cluster wells based on DS algorithm
Zhiyue Wang,Deli Gao,Jianjun Liu +2 more
TL;DR: The convergence and stability of the proposed algorithm have been discussed, and the results indicate that d-DS has good convergence and numerical stability, thus the d- DS algorithm is excellent for solving trajectory optimization problem.
Journal ArticleDOI
Modified African Buffalo Optimization for Strategic Integration of Battery Energy Storage in Distribution Networks
TL;DR: A modified variant of African buffalo optimization (ABO) introduced to overcome some of the limitations observed in its standard variant and the proposed optimization model and modified ABO is very promising to improve the performance of active distribution systems.
Proceedings ArticleDOI
Well Placement Optimization Constrained to Minimum Well Spacing
Abeeb A. Awotunde,Carlos Naranjo +1 more
Journal ArticleDOI
A parallel tabu search for solving the primal buffer allocation problem in serial production systems
TL;DR: This paper presents a novel parallel tabu search algorithm equipped with a proper adaptive neighborhood generation mechanism to solve the primal buffer allocation problem, which consists of minimizing the total buffer capacity of a serial production system under a minimum throughput rate constraint.
Journal ArticleDOI
Market-System Design Optimization With Consider-Then-Choose Models
TL;DR: In this article, the authors present solutions to a design optimization problem that arises when demand is modeled with a consider-then-choose model: the choice probabilities are no longer continuous or continuously differentiable.
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.