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
Bees-algorithm-based optimization of component size and control strategy parameters for parallel hybrid electric vehicles
V. T. Long,N. V. Nhan +1 more
TL;DR: In this paper, the authors presented the optimization of key component sizes and control strategy for parallel hybrid electric vehicles (parallel HEVs) using the bees algorithm (BA), an intelligent optimization tool that mimics the food foraging behavior of honey bees.
Proceedings ArticleDOI
QoS-Based Web Service Composition Accommodating Inter-service Dependencies Using Minimal-Conflict Hill-Climbing Repair Genetic Algorithm
Lifeng Ai,Maolin Tang +1 more
TL;DR: Wang et al. as discussed by the authors presented a repair genetic algorithm, namely minimal-conflict hill-climbing repair GA, to address the Web service composition optimization problem in the presence of domain constraints and inter service dependencies and conflicts.
Proceedings ArticleDOI
A Framework for Optimization, Service Placement, and Runtime Operation in the Fog
TL;DR: An architecture and implementation of a representative framework called FogFrame that defines the necessary communication mechanisms for instantiating and maintaining service execution in the fog and how the framework operates at runtime, i.e., adapts to changes in the available resources, balances the workload and recovers from resource failures and overloads is designed.
Journal ArticleDOI
An innovative hybrid multi-objective particle swarm optimization with or without constraints handling
TL;DR: A new hybrid optimizer is proposed in which an innovative local optimal particles search strategy, which on basis of particular analysis on disadvantage of global optimal particle method, is integrated into multi-objective particle swarm optimization.
Journal ArticleDOI
Optimization strategies for non-linear material parameters identification in metal forming problems
TL;DR: In this article, three constitutive models were considered, namely, a non-linear elastic-plastic hardening model, a hyperelastic model and an elasto-viscoplastic model with isotropic and kinematic work-hardening.
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.