Using reliability analysis to estimate the number of generations to convergence in genetic algorithms
Information Processing LettersPublished 1 June 1993
Uday K. Chakraborty, Debabrata Ghosh Dastidar
Citations36
SJR quartileQ3
SJR score0.41
SNIP0.73
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
A stochastic reliability model for the haploid, binary, fixed-length genetic algorithm is presented and empirical evidence is provided.
Abstract
We present a stochastic reliability model for the haploid, binary, fixed-length genetic algorithm. Empirical evidence is provided.
Keywords
Computer Science
Choice Reviews OnlineGenetic algorithms in search, optimization, and machine learning
49,278 Citations1989
This book brings together the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields.
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.
Journal of the Franklin InstituteAn introduction to probability theory and its applications
29,966 Citations1958
IEEE Transactions on Systems Man and CyberneticsOptimization of Control Parameters for Genetic Algorithms
2,831 Citations1986John J. Grefenstette
GA's are shown to be effective for both levels of the systems optimization problem and are applied to the second level task of identifying efficient GA's for a set of numerical optimization problems.
Foundations of genetic algorithmsA Comparative Analysis of Selection Schemes Used in Genetic Algorithms
2,400 Citations1991David E. Goldberg, Kalyanmoy Deb
A number of selection schemes commonly used in modern genetic algorithms are compared on the basis of solutions to deterministic difference or differential equations, verified through computer simulations to provide convenient approximate or exact solutions and useful convergence time and growth ratio estimates.
Deep Blue (University of Michigan)An Analysis Of The Behavior Of A Class Of Genetic Adaptive Systems.
1,299 Citations1975Kenneth DeJong
Complex SystemsMessy genetic algorithms: motivation, analysis, and first results
1,128 Citations1989David E. Goldberg, Bradley Korb +1 more
The mGA presented herein repeatedly achieves globally optimal results without prior knowledge of good string arrangements, and it does so at the very first generation in which strings are long enough to cover the problem.
Foundations of genetic algorithmsAn Extension To the Theory of Convergence and a Proof of the Time Complexity of Genetic Algorithms
56 Citations1991C. A. Ankenbrandt
The standard recurrence relation for binary and nonbinary genetic algorithms is solved using an inductive proof and a proof using linear finite difference equations, and the resulting equations define the relationship between estimated run time, problem size, fitness ratio and the complexity of the domain specific evaluation function.