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
Dissertation
Planning of distribution networks for medium voltage and low voltage
TL;DR: In this article, a comprehensive planning is presented for the distribution networks, and a novel segmentation-based strategy is proposed for including dynamic load characteristics (dynamic load characteristics) in distribution network planning.
Journal ArticleDOI
A genetic algorithm based heuristic for dynamic lot sizing problem with returns and hybrid products
TL;DR: A Genetic Algorithm based heuristic (GA_H) has been proposed to solve the dynamic lot sizing problem with returns and hybrids (DLSPRH), which is a constrained mixed-integer nonlinear programming problem and significantly outperforms the other metaheuristic algorithms.
Journal ArticleDOI
A new constraint handling method based on the modified Alopex-based evolutionary algorithm
TL;DR: Results indicate that the proposed constraint handling method based on a modified AEA (Alopex-based evolutionary algorithm) is reliable and efficient for solving constrained optimization problems and has great potential in handling many engineering problems with constraints, even with equations.
Structural Model Tuning Capability in an Object-Oriented Multidisciplinary Design, Analysis, and Optimization Tool
TL;DR: In this article, a multidisciplinary design, analysis, and optimization (MDAO) tool is introduced to optimize the objective function and constraints such that the mass properties, the natural frequencies, and the mode shapes are matched to the target data as well as the mass matrix being orthogonalized.
Journal ArticleDOI
Optimizing supply chain network design with location-inventory decisions for perishable items: A Pareto-based MOEA approach
TL;DR: A Pareto-based meta-heuristic approach called multi-objective imperialist competitive algorithm (MOICA) is presented to solve the model and results analysis show the robustness of MOICA to find and manage Pare to solutions.
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.