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
Journal ArticleDOI
A bi-objective model to optimize reliability and cost of system with a choice of redundancy strategies
TL;DR: Two effective multi-objective metaheuristic algorithms named non-dominated sorting genetic algorithms (NSGA-II and multi- objective particle swarm optimization (MOPSO) are proposed and the performance of the algorithms is analyzed on a typical case and conclusions are demonstrated.
Journal ArticleDOI
A survey on evolutionary computation for complex continuous optimization
TL;DR: A comprehensive survey of evolutionary computation algorithms for dealing with 5-M complex challenges is presented by proposing a novel taxonomy according to the function of the approaches, including reducing problem difficulty, increasing algorithm diversity, accelerating convergence speed, reducing running time, and extending application field.
Journal ArticleDOI
A linear programming embedded genetic algorithm for an integrated cell formation and lot sizing considering product quality
TL;DR: A linear programming embedded genetic algorithm was developed following an integrated approach for cell configuration and lot sizing in a dynamic manufacturing environment to minimize both production and quality related costs.
Journal ArticleDOI
A soft-computing Pareto-based meta-heuristic algorithm for a multi-objective multi-server facility location problem
TL;DR: A Pareto-based meta-heuristic algorithm called multi-objective harmony search (MOHS) is proposed, in which facilities behave as M/M/m queues within multi-server queuing framework, which shows that the proposed MOHS outperforms the other two algorithms in terms of computational time.
Journal ArticleDOI
The oracle penalty method
Martin Schlüter,Matthias Gerdts +1 more
TL;DR: A new and universal penalty method, named oracle, is introduced, which is an advanced approach that only requires one parameter to be tuned, and is especially intended to be applied in stochastic metaheuristics like genetic algorithms, particle swarm optimization or ant colony optimization.
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.