A Comparison of Evolutionary Programming and Genetic Algorithms on Selected Constrained Optimization Problems
SIMULATIONPublished 1 June 1995
David B. Fogel
Citations117
SJR quartileQ2
SJR score0.38
SNIP0.89
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The experiments indicate that evolutionary programming outperforms the genetic algorithm and potential difficulties in the design of suitable penalty functions for constrained optimization problems are indicated.
Abstract
Evolutionary programming and genetic algorithms are compared on two constrained optimization problems. The constrained problems are redesigned as related unconstrained problems by the application of penalty functions. The experiments indicate that evolutionary programming outperforms the genetic algorithm. The results are statistically significant under nonparametric hypothesis testing. The results also indicate potential difficulties in the design of suitable penalty functions for constrained optimization problems. A discussion is offered regarding the suitability of different methods of evolutionary computation for such problems.
Keywords
Computer Science
The MIT Press eBooksAdaptation in Natural and Artificial Systems
35,568 Citations1992John H. Holland
Initially applying his concepts to simply defined artificial systems with limited numbers of parameters, Holland goes on to explore their use in the study of a wide range of complex, naturally occuring processes, concentrating on systems having multiple factors that interact in nonlinear ways.
Artificial intelligenceGenetic Algorithms + Data Structures = Evolution Programs
11,598 Citations1992Zbigniew Michalewicz
Handbook of Genetic Algorithms
7,308 Citations1991Lawrence Davis
Oxford University Press eBooksEvolutionary Algorithms in Theory and Practice
4,299 Citations1996Thomas Bäck
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.
Evolutionary ComputationAn Overview of Evolutionary Algorithms for Parameter Optimization
2,110 Citations1993Thomas Bäck, Hans–Paul Schwefel
Three main streams of evolutionary algorithms (EAs), probabilistic optimization algorithms based on the model of natural evolution, are compared in this article: evolution strategies (ESs), evolutionary programming (EP), and genetic algorithms (GAs).
IEEE Transactions on Neural NetworksAn introduction to simulated evolutionary optimization
1,508 Citations1994David B. Fogel
The development of each of these procedures over the past 35 years is described and some recent efforts in these areas are reviewed.
IEEE Transactions on Neural NetworksConvergence analysis of canonical genetic algorithms
1,456 Citations1994Günter Rudolph
This paper analyzes the convergence properties of the canonical genetic algorithm with mutation, crossover and proportional reproduction applied to static optimization problems and shows variants of CGA's that always maintain the best solution in the population are shown to converge to the global optimum due to the irreducibility property of the underlying original nonconvergent CGA.
IEEE Transactions on Neural NetworksAn evolutionary algorithm that constructs recurrent neural networks
1,022 Citations1994Peter J. Angeline, Gregory M. Saunders +1 more
It is argued that genetic algorithms are inappropriate for network acquisition and an evolutionary program is described, called GNARL, that simultaneously acquires both the structure and weights for recurrent networks.
SIMULATIONConstrained Optimization Via Genetic Algorithms
795 Citations1994Abdollah Homaifar, Charlene X. Qi +1 more
The proposed search algorithm is realized by GAs which utilize a penalty function in the objective function to account for violation, based on systematic multi-stage assignments of weights in the penalty method as opposed to single- stage assignments in sequential unconstrained minimization.
Australian Journal of Biological SciencesSimulation of Genetic Systems by Automatic Digital Computers I. Introduction
445 Citations1957AS Fraser
Methods of setting automatic digital computers to simulate the algebraic aspects of reproduction, segregation, and selection and the application of these methods to the problem of the importance of linkage in multifactorial inheritance is illustrated by results from the SILLIAC.
Biological CyberneticsAn evolutionary approach to the traveling salesman problem
290 Citations1988David B. Fogel
A simulation of natural evolution is conducted using the traveling salesman problem as an artificial environment and evolutionary adaptation is demonstrated to be worthwhile in a variety of contexts.
Biological CyberneticsComparing genetic operators with gaussian mutations in simulated evolutionary processes using linear systems
242 Citations1990David B. Fogel, J. W. Atmar
The results indicate that specific genetic operations to mutate the structure that encodes expressed behavior do not compare favorably with more simple random mutation.
Optimization Through Evolution and Recombination
182 Citations2013Hans J. Bremermann
The number of bits per second that flow through all the channels within a computer is counted and this is defined as the processing rate.
Machine LearningDynamic Parameter Encoding for genetic algorithms
145 Citations1992Nicol N. Schraudolph, Richard K. Belew
BiosystemsOn the effectiveness of crossover in simulated evolutionary optimization
111 Citations1994David B. Fogel, Lauren C. Stayton
This work has suggested that genetic models using recombination operators, specifically crossover, are typically more efficient and effective at function optimization than behavioral models that rely solely on mutation.
Cybernetics & SystemsASYMPTOTIC CONVERGENCE PROPERTIES OF GENETIC ALGORITHMS AND EVOLUTIONARY PROGRAMMING: ANALYSIS AND EXPERIMENTS
106 Citations1994David B. Fogel
The basic convergence properties of evolutionary optimization algorithms are investigated and it is indicated that the methods studied will asymptotically converge to global optima and genetic algorithms may prematurely stagnate at solutions that may not even be locally optimal.
Journal of Theoretical BiologyEvolutionary learning circuits
99 Citations1974Michael Conrad
A theory of the central nervous system based on information processing concepts suitable for describing molecular biological systems and makes a number of definite predictions about the CNS, some of which correspond to known facts and others of which are testable.
IEEE Transactions on Neural NetworksNotes on the simulation of evolution
92 Citations1994Wirt Atmar
The simulation of evolution for the purposes of parameter optimization has generally demonstrated itself to be a robust and rapid optimization technique, but there may exist more value in simulating evolution than simple parameter optimization.
BiosystemsEvolutionary algorithms and a fractal inverse problem
38 Citations1994David J. Nettleton, Roberto Garigliano
Results presented show the success of evolutionary programming in solving an example of a fractal inverse problem, but indicate that a genetic algorithm is not as successful.