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
Proceedings ArticleDOI
Coupling simulation with HeuristicLab to solve facility layout problems
Beham,Kofler,Wagner,Affenzeller +3 more
Journal ArticleDOI
Handling Constraints Using Penalty Functions in Materialized View Selection
Anjana Gosain,Kavita Sachdeva +1 more
TL;DR: The adaptive penalty function method yields the best results in terms of minimum query processing cost and achieves the optimality, scalability and feasibility of the problem on varying the lattice dimensions and on increasing the number of user queries.
Book ChapterDOI
Extractive Summary: An Optimization Approach Using Bat Algorithm
TL;DR: Bat algorithm is used as an optimization technique which provides efficient result in creating an extractive summary and the objective is to cover maximum topics of the document and simultaneously minimize the redundancies between the sentences of the summary.
Journal ArticleDOI
An evolutionary algorithmic approach to determine the Nash equilibrium in a duopoly with nonlinearities and constraints
TL;DR: Through the paper it is explicitly demonstrated how EAA can solve games with constrained payoff functions that cannot be dealt with by traditional analytical methods, demonstrating the resilience and rigor of the EAA solution approach.
Journal ArticleDOI
A Generic Indirect Deep Learning Approach for Multisensor Degradation Modeling
TL;DR: Wang et al. as discussed by the authors proposed a generic indirect deep learning method that constructs an health index (HI) by combining multiple sensor signals to better characterize the degradation process, which can be applied to the degradation modeling of various engineering systems.
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.