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
Reducing impacts of rice fields nitrate contamination on the river ecosystem by a coupled SWAT reservoir operation optimization model
TL;DR: In this paper , the authors proposed a multipurpose reservoir operation optimization for mitigating impact of rice fields' contamination on the downstream river ecosystem, which was applied in the Tajan River basin in Mazandaran Province, Iran, in which the rice is the main crop.
Journal ArticleDOI
Adaptive Slicing of Implicit Porous Structure with Topology Guarantee
Jiacong Yan,Hongwei Lin +1 more
TL;DR: Wang et al. as discussed by the authors developed a method based on the persistent homology theory to adaptively slice implicit porous structures, which guaranteed the topological correctness of the generated adaptive slice model.
Journal Article
Derivation of Optimum Operation Policies using Genetic Algorithm
Numerical solution to the optimization problem in sampling
TL;DR: In this article, an attempt is made to get these optimum estimators of parameters in stratified random sampling using genetic algorithms (GAs), and the results show that the genetic algorithm is more efficient than classical ratio type estimator in the case of population parameters.
Proceedings ArticleDOI
Heron: Automatically Constrained High-Performance Library Generation for Deep Learning Accelerators
Jun Bi,Qi Guo,Xiaqing Li,Yongwei Zhao,Yuanbo Wen,Yuxuan Guo,Enshuai Zhou,Xingui Hu,Zidong Du,Ling Li,Huaping Chen,Tianshi Chen +11 more
TL;DR: In this article , the authors propose Heron, a novel exploration-based approach, to efficiently generate high-performance libraries of DLAs, which are typically either manually implemented or automatically generated by explorationbased compilation approaches.
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.