Linear analysis of genetic algorithms

DOI10.1016/S0304-3975(98)00004-8MaRDI QIDQ1276251zbMATH OpenFDO

Authors Lothar M. Schmitt, Chrystopher L. Nehaniv, Robert H. Fujii

Publication date 20 January 1999

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(98)00004-8

zbMATH Keywords

genetic algorithmsMarkov chains

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Parallel algorithms in computer science (68W10)

Recommendations

• A rigorous analysis of the compact genetic algorithm for linear functions
• Fourier analysis of genetic algorithms
• scientific article; zbMATH DE number 1547722
• A comparison of several linear genetic programming techniques
• Theoretical analysis of steady state genetic algorithms
• scientific article; zbMATH DE number 876662
• scientific article; zbMATH DE number 20220
• Genetic algorithms

Cites work

• Convergence and finite-time behavior of simulated annealing
• Equation of state calculations by fast computing machines
• scientific article; zbMATH DE number 3689205 (Why is no real title available?)
• scientific article; zbMATH DE number 21232 (Why is no real title available?)
• scientific article; zbMATH DE number 3455908 (Why is no real title available?)
• scientific article; zbMATH DE number 3496342 (Why is no real title available?)
• scientific article; zbMATH DE number 3570731 (Why is no real title available?)
• scientific article; zbMATH DE number 711300 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• scientific article; zbMATH DE number 3340846 (Why is no real title available?)
• scientific article; zbMATH DE number 3342965 (Why is no real title available?)
• scientific article; zbMATH DE number 3399886 (Why is no real title available?)
• scientific article; zbMATH DE number 4182860 (Why is no real title available?)
• Modeling genetic algorithms with Markov chains.
• Non-negative matrices and Markov chains.
• Nonstationary Markov chains and convergence of the annealing algorithm
• On weak and monotone -closures of C^ *-algebras
• Simulated annealing: An introduction

Cited in

(30)

• A branching process model for genetic algorithms
• Modeling genetic algorithms with Markov chains.
• A discipline of evolutionary programming
• Population aggregation based on fitness
• Theory of genetic algorithms. II: Models for genetic operators over the string-tensor representation of populations and convergence to global optima for arbitrary fitness function under scaling
• Some results about the Markov chains associated to GPs and general EAs
• On the convergence of genetic algorithms
• The unified method analyzing convergence of genetic algorithms
• A Markov chain analysis of genetic algorithms: large deviation principle approach
• On stability and classification tools for genetic algorithms
• Geometric convergence of genetic algorithms under tempered random restart
• Linear Genetic Programming
• Genetic fitness optimization using rapidly mixing Markov chains
• scientific article; zbMATH DE number 20220 (Why is no real title available?)
• Asymptotic convergence of genetic algorithms
• scientific article; zbMATH DE number 1342316 (Why is no real title available?)
• scientific article; zbMATH DE number 709406 (Why is no real title available?)
• scientific article; zbMATH DE number 2040834 (Why is no real title available?)
• scientific article; zbMATH DE number 1462668 (Why is no real title available?)
• scientific article; zbMATH DE number 2086835 (Why is no real title available?)
• scientific article; zbMATH DE number 798681 (Why is no real title available?)
• scientific article; zbMATH DE number 876662 (Why is no real title available?)
• Theoretical analysis of steady state genetic algorithms
• Modeling the genetic algorithm by a nonhomogeneous Markov chain: weak and strong ergodicity
• Asymptotic and pointwise stability of evolutionary algorithms
• An effective hybrid optimization strategy for job-shop scheduling problems
• Theory of genetic algorithms
• A general steady state distribution based stopping criteria for finite length genetic algorithms
• The effect of multiple optima on the simple GA run-time complexity
• A genetic system based on simulated crossover of sequences of two-bit genes

This page was built for publication: Linear analysis of genetic algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1276251)