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
Proceedings ArticleDOI
Estimating the spectral sensitivity of a digital sensor using calibration targets
TL;DR: This work will be using an evolution strategy to obtain the sensor response curves of a camera given a single image of a calibration target.
Journal ArticleDOI
Integrated airport pavement management using a hybrid approach of Markov Chain and supervised multi-objective genetic algorithms
Zahra Ansarilari,Amir Golroo +1 more
TL;DR: The second version of Non-Dominated Sorting Genetic Algorithms (NSGA-II) is applied to solve pavement management problems, i.e. providing a pavement maintenance activity plan over the planning horizon through a supervised manner considering both pavement conditions and monetary resources as objective functions.
DissertationDOI
New heuristics for global optimization of complex bioprocesses
TL;DR: An introduction to global optimization in the biotechnological area, including the main type of existing problems and the available optimization methods to solve them, and a scatter search-based algorithm for the global optimization of non-linear dynamic systems.
Journal ArticleDOI
Stackelberg–Nash equilibrium of pricing and inventory decisions in duopoly supply chains using a nested evolutionary algorithm
TL;DR: This study investigates the joint decision on price and inventory control of a deterioration product is investigated in a duopoly setting, and formulate in-chain, and chain-to-chain competition as a bi-level programming problem, and analyze Stackelberg–Nash equilibrium of the problem.
Journal ArticleDOI
Allocation and sizing of distribution transformers and feeders for optimal planning of MV/LV distribution networks using optimal integrated biogeography based optimization method
TL;DR: BBO is employed for solving the problem of optimal planning of a distribution system including both medium voltage and low voltage networks and based on uniform or non-uniform load density, where a planning procedure is employed iteratively to find the optimal location and rating of distribution transformers and substations.
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.