scispace - formally typeset
Open AccessJournal ArticleDOI

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

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Utilizing the Correlation Between Constraints and Objective Function for Constrained Evolutionary Optimization

TL;DR: This paper is the first attempt to utilize the correlation between constraints and objective function to keep this balance, and a novel constrained optimization evolutionary algorithm is presented.
Book ChapterDOI

A Review of Particle Swarm Optimization Methods Used for Multimodal Optimization

TL;DR: Particle swarm optimization is a metaheuristic inspired on the flight of a flock of birds seeking food, which has been widely used for a variety of optimization tasks, but its use in multimodal optimization (i.e., single-objective optimization problems having multiple optima) has been relatively scarce.
Journal ArticleDOI

A bi-objective continuous review inventory control model

TL;DR: Several multi-objective Pareto-based optimization algorithms are presented and the algorithms were analyzed statistically and graphically to find the optimal value for both order quantity and reorder point through minimizing the total cost and maximizing the service level of the proposed model simultaneously.
Journal ArticleDOI

Combined Optimal Sizing and Control of Li-Ion Battery/Supercapacitor Embedded Power Supply Using Hybrid Particle Swarm–Nelder–Mead Algorithm

TL;DR: In this paper, the authors examined and optimized parameters that affect the sizing and control of a hybrid embedded power supply composed of Li-ion batteries and supercapacitors in electric vehicle applications.
Journal ArticleDOI

Investigating a hybrid simulated annealing and local search algorithm for constrained optimization

TL;DR: A Hybrid Simulated Annealing method (HSA), for solving the general COP, which has features that address both feasibility and optimality issues and here, it is supported by a local search procedure, Feasible Sequential Quadratic Programming (FSQP).
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

Thomas Bäck
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.