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
Book
Nature-Inspired Optimization Algorithms
TL;DR: This book can serve as an introductory book for graduates, doctoral students and lecturers in computer science, engineering and natural sciences, and researchers and engineers as well as experienced experts will also find it a handy reference.
Journal ArticleDOI
Artificial bee colony algorithm for large-scale problems and engineering design optimization
Bahriye Akay,Dervis Karaboga +1 more
TL;DR: The ABC algorithm is applied to engineering design problems by extending the basic ABC algorithm simply by adding a constraint handling technique into the selection step of the ABC algorithm in order to prefer the feasible regions of entire search space.
Journal ArticleDOI
Blended biogeography-based optimization for constrained optimization
Haiping Ma,Dan Simon +1 more
TL;DR: The numerical results demonstrate that constrained blended BBO outperforms SGA and performs similarly to SPSO 07 for constrained single-objective optimization problems.
Book ChapterDOI
Unified particle swarm optimization for solving constrained engineering optimization problems
TL;DR: A penalty function approach is employed and the algorithm is modified to preserve feasibility of the encountered solutions to investigate the performance of the recently proposed Unified Particle Swarm Optimization method on constrained engineering optimization problems.
Journal ArticleDOI
Extended ant colony optimization for non-convex mixed integer nonlinear programming
TL;DR: Two novel extensions for the well known ant colony optimization (ACO) framework are introduced here, which allow the solution of mixed integer nonlinear programs (MINLPs) and a hybrid implementation based on this extended ACO framework, specially developed for complex non-convex MINLPs is presented.
References
More filters
Journal ArticleDOI
A Genetic Algorithm for the Multiple-Choice Integer Program
TL;DR: Extensive computational tests for dual degenerate problem instances show that suboptimal solutions can be obtained with the genetic algorithm within running times that are shorter than those of the OSL optimization routine.
Proceedings Article
Constrained GA Optimization
Marc Shoenauer,Spyros Xanthakis +1 more
TL;DR: This method succeeded on some truss structure optimization problems, where the other genetic techniques for handling the constraints failed to give good results, as some constraints are not even computable until others are satissed.
Journal ArticleDOI
Evolutionary programming techniques for constrained optimization problems
Jong-Hwan Kim,Hyun Myung +1 more
TL;DR: Simulations indicate that the TPEP achieves an exact global solution without gradient information, with less computation time than the other optimization methods studied here, for general constrained optimization problems.
Proceedings Article
Genetic Optimization Using A Penalty Function
Alice E. Smith,David M. Tate +1 more
Book ChapterDOI
Evolutionary Optimization of Constrained Problems
Keigo Watanabe,Mohamed Hashem +1 more
TL;DR: This chapter deals with a new approach which will utilize a log-dynamic penalty function method in the NES algorithm that has been proposed and tested in the previous chapter.