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
Proceedings ArticleDOI
Study of the Sequential Constraint-Handling Technique for Evolutionary Optimization With Application to Structural Problems
TL;DR: Two heuristics that allow finding a satisfying constraint sequence have been developed and can therefore be easy to implement, and powerful alternatives for solving engineering design problems.
Journal ArticleDOI
Genetic Algorithm Combination of Boolean Constraint Programming for Solving Course of Action Optimization in Influence Nets
TL;DR: A novel method of Genetic Algorithm combination of Boolean Constraint Programming (BCP) is proposed to solve CCOP, which holds a complex mathematical configuration, which is expressed as a 0 1 integer optimization problem with compositional constraints and unobvious optimal object function.
Proceedings ArticleDOI
Constrained Problem Optimization using Altered Artificial Bee Colony Algorithm
TL;DR: The performance analysis of A- ABC algorithm has been done by testing it on ten classical constraint optimization benchmark functions and the simulation results, when compared with other traditional meta-heuristic approaches, are found best on most of the problems and at-least comparable on remaining one.
Journal ArticleDOI
Constraint-handling techniques for generative product design systems in the mass customization context
TL;DR: This article evaluates two promising sequential constraint-handling techniques and the often used weighted sum technique with regard to convergence time, convergence rate, and diversity of the design solutions.
Journal ArticleDOI
Hybrid Line Search and Simulated Annealing For Production Planning System in Industrial Engineering
TL;DR: The hybridization of line search and simulated annealing method provides satisfactory outcomes for the production planning problem in an uncertain environment and the major advantages and disadvantages are provided.
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.