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
Application of genetic algorithms in design and optimisation of multi-stream plate–fin heat exchangers
TL;DR: In this article, two new approaches in the thermo-hydraulic design of multi-stream heat exchangers (MSHEs) are introduced, where geometrical aspects of the MSHE (e.g. exchanger dimensions, fin type, etc.) are optimized with a genetic algorithm (GA) using the Total Annual Cost (TAC) as an objective function.
Journal ArticleDOI
Long Short-Term Memory Networks and Bayesian Optimization for Predicting the Time-Weighted Average Pressure of Shield Supporting Cycles
TL;DR: A hybrid machine learning model integrating the long short-term memory (LSTM) networks and the Bayesian optimization (BO) algorithm was developed to predict TWAP based on the setting pressure, revised setting pressure (SP), final pressure (FP), number of yielding (NY), TWAP in the last supporting cycle (TWAP (last)), and loading rate in each period.
Proceedings ArticleDOI
A Genetic Algorithm with a Penalty Function in the Selective Travelling Salesman Problem on a Road Network
TL;DR: Since R-STSP is NP-hard and stands the problem with a constraint, the genetic algorithm (GA) with a penalty function is proposed and shown that this GA outperforms the GA searching only the feasible solution space.
Proceedings ArticleDOI
OGPR: An Obstacle-Guided Path Refinement Approach for Mobile Robot Path Planning
TL;DR: The developed OGPR approach is developed to plan a set of short collision-free paths between the start and the target points for mobile robots and the results show that its effectiveness in planning safe paths shorter than the state-of-the-art A* algorithm is shown.
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.