scispace - formally typeset
Open AccessJournal ArticleDOI

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

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Multi-objective multi-layer congested facility location-allocation problem optimization with Pareto-based meta-heuristics

TL;DR: A Pareto-based multi- objective meta-heuristic approach based on the multi-objective vibration damping optimization (MOVDO) and the multi -objective harmony search algorithm (MOHSA) is proposed, demonstrating the effectiveness of the proposed model and the efficacy of the procedures and algorithms.
Journal ArticleDOI

A parameter-tuned genetic algorithm for multi-product economic production quantity model with space constraint, discrete delivery orders and shortages

TL;DR: The model of the problem is a constrained non-linear integer program and a genetic algorithm is proposed to solve it and design of experiments is employed to calibrate the parameters of the algorithm for different problem sizes.
BookDOI

Handbook of Optimization

TL;DR: A reader will also encounter various methods used for proposed optimization approaches, such as game theory and evolutionary algorithms or modelling of evolutionary algorithm dynamics like complex networks.
Journal ArticleDOI

A constraint-handling technique for genetic algorithms using a violation factor

TL;DR: This paper presents a constraint-handling technique for GA’s solely using the violation factor, called VCH (Violation Constraint-Handling) method, which was able to provide a consistent performance and match results from other GA-based techniques.
Journal ArticleDOI

A multi-objective harmony search algorithm to optimize multi-server location–allocation problem in congested systems

TL;DR: A meta-heuristic algorithm called multi-objective harmony search algorithm (MOHA) is developed to solve the LA model, in which the facilities are modeled as an M / M / m queuing system, and the results based on different problem sizes are in favor of MOHA.
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.