Theory of genetic algorithms

DOI10.1016/S0304-3975(00)00406-0zbMath0972.68133MaRDI QIDQ5941269

Lothar M. Schmitt

Publication date: 20 August 2001

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

zbMATH Keywords

genetic driftconvergence in the zero-mutation limit caseconvergent simulated annealing-type genetic algorithmnon-binary genetic algorithmsscaled proportional fitness selectionspectral analysis of mutation-crossover

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (37)

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 ⋮ Migration NSGA: method to improve a non-elitist searching of Pareto front, with application in magnetics ⋮ The effect of multiple optima on the simple GA run-time complexity ⋮ A new method to build spatio-temporal covariance functions: analysis of ozone data ⋮ Stochastic local search for the FEATURE SET problem, with applications to microarray data ⋮ An agent-based model of hierarchic genetic search ⋮ Selfish optimization and collective learning in populations ⋮ Optimizing minimum information pair-copula using genetic algorithm to select optimal basis functions ⋮ On the convergence rate issues of general Markov search for global minimum ⋮ An improved hybrid quantum optimization algorithm for solving nonlinear equations ⋮ Determination of the optimal accelerated burn-in time under Arrhenius-log normal distribution assumption ⋮ Analysis and Experimental Study of Heuristics for Job Scheduling Reoptimization Problems ⋮ A hybrid quantum inspired harmony search algorithm for 0-1 optimization problems ⋮ Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing ⋮ Roll steer minimization of McPherson-strut suspension system using genetic algorithm method ⋮ Transit sets of two-point crossover ⋮ The island model as a Markov dynamic system ⋮ Transit sets of -point crossover operators ⋮ Optimal design of pressure vessel using an improved genetic algorithm ⋮ Nonautonomous stochastic search for global minimum in continuous optimization ⋮ A review on computational intelligence for identification of nonlinear dynamical systems ⋮ Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem ⋮ Some results about the Markov chains associated to GPs and general EAs ⋮ A stopping criterion for logarithmic simulated annealing ⋮ The solution of unconfined seepage problem using natural element method (NEM) coupled with genetic algorithm (GA) ⋮ Global convergence of discrete-time inhomogeneous Markov processes from dynamical systems perspective ⋮ Annealing evolutionary stochastic approximation Monte Carlo for global optimization ⋮ Population size versus runtime of a simple evolutionary algorithm ⋮ Multistage non homogeneous Markov chain modeling of the non homogeneous genetic algorithm and convergence results ⋮ A simulation-based evolutionary approach to LNA circuit design optimization ⋮ Review of utilization of genetic algorithms in heat transfer problems ⋮ A hybrid assimilation scheme for characterization of three-phase flow in porous media ⋮ Annealing evolutionary stochastic approximation Monte Carlo for global optimization ⋮ Stabilizing unstable periodic orbits in large stability domains with dynamic time-delayed feedback control ⋮ The quasispecies regime for the simple genetic algorithm with ranking selection ⋮ Stabilization of multi-rotation unstable periodic orbits through dynamic extended delayed feedback control ⋮ Genetic algorithm for constrained global optimization in continuous variables

Uses Software

• Mathematica
• Genocop

Cites Work

• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• Nonstationary Markov chains and convergence of the annealing algorithm
• Non-negative matrices and Markov chains. 2nd ed
• Linear analysis of genetic algorithms
• Modeling genetic algorithms with Markov chains.
• A proof of the Vose-Liepins conjecture
• The Evolution of Cooperation
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Convergence and finite-time behavior of simulated annealing
• Simulated annealing methods with general acceptance probabilities
• Cooling Schedules for Optimal Annealing
• Simulated annealing: An introduction
• ASYMPTOTIC CONVERGENCE PROPERTIES OF GENETIC ALGORITHMS AND EVOLUTIONARY PROGRAMMING: ANALYSIS AND EXPERIMENTS
• Equation of State Calculations by Fast Computing Machines
• Stopping Criteria for Finite Length Genetic Algorithms
• On the Probability Theory of Linkage in Mendelian Heredity
• Statistical genetics and evolution
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Theory of genetic algorithms