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
Genetic algorithms with heuristics rules to solve multi source single product flexible multistage logistics network problems
TL;DR: This research shows the proposed HR-GA has substantially reduced the elapsed time to obtain better acceptable solution to the multi source single product fMLN problem.
An Evolutionary Immune Approach for University Course Timetabling
Y. Awad,A. Dawood,A. Badr +2 more
TL;DR: An immune-inspired algorithm, namely the Clonal Selection Algorithm1 (CSA1) is formulating and testing its ability in solving the UCTP against the Genetic algorithm (GA), and an Immune-Genetic algorithm (IGA) was also created, which combines the crossover operator borrowed from the genetic algorithm with immune- inspired concepts.
Posted Content
Model and Solve the Bi-Criteria Multi Source Flexible Multistage Logistics Network
TL;DR: In this article, a multi-source flexible multistage logistics network (fMLN) problem is formulated, where each customer can be served by a number of facilities simultaneously.
Journal Article
A New Model for Location-Allocation Problem within Queuing Framework
TL;DR: This model represents a mixed-integer nonlinear programming problem which belongs to the class of NP-hard problems and two metaheuristic algorithms including non-dominated sorting genetic algorithms (NSGA-II and NRGA) are proposed.
Proceedings ArticleDOI
Industrial Network Topology Generation with Genetic Algorithms
Christoph Fischer,Maximilian Berndt,Dennis Krummacker,Janis Zemitis,Daniel Fraunholz,Hans D. Schotten +5 more
TL;DR: The description of an algorithm, an encoding format for network topologies as well as a methodology for evaluating solutions, and an evaluation of the developed algorithm in terms of quality of a found solution and performance of execution are shown.
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.