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
Open pit mine production schedule optimization using a hybrid of maximum-flow and genetic algorithms
TL;DR: In this study, the maximum flow algorithm with a genetic algorithm is used to generate the long-term production schedule and results for realistic instances are provided to indicate the efficiency of the solutions.
Journal ArticleDOI
Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem
TL;DR: This work proposes a two-stage search algorithm, where the first stage aims to locate a promising hyperplane within the whole search space and the second stage tries to find improved solutions by exploring the reduced subspace defined by the hyperplane.
Journal ArticleDOI
Entropy based region reducing genetic algorithm for reliability redundancy allocation in interval environment
TL;DR: Comparative performance studies of the proposed subpopulation and entropy based region reducing genetic algorithm (GA) with Laplace crossover and power mutation demonstrate that the proposed GA is promising to solve the reliability redundancy optimization problem providing better optimum system reliability.
Journal ArticleDOI
Maintenance planning and dynamic grouping for multi-component systems with positive and negative economic dependencies
TL;DR: A dynamic maintenance approach based on a rolling horizon scheme and a genetic algorithm to find the grouped-maintenance plan for complex systems whose structure may lead to both positive and negative economic dependencies is proposed.
Journal ArticleDOI
Control Strategy Optimization for Parallel Hybrid Electric Vehicles Using a Memetic Algorithm
Yu-Huei Cheng,Ching-Ming Lai +1 more
TL;DR: In this article, the authors used a robust evolutionary computation method called a "memetic algorithm" to optimize the control parameters in parallel hybrid electric vehicles (HEVs) in order to realize the optimal control strategy.
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.