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

DOI10.1016/S0304-3975(03)00393-1zbMath1071.68100MaRDI QIDQ1884972

Lothar M. Schmitt

Publication date: 27 October 2004

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

zbMATH Keywords

Simulated annealingCoevolutionAsymptotic convergence of genetic algorithmsNeighborhood-based searchNon-commuting crossover and mutation operatorsUnbounded power-law scaled proportional fitness selection

Mathematics Subject Classification ID

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

Related Items (10)

The effect of multiple optima on the simple GA run-time complexity ⋮ A phenomenological constitutive model for the nonlinear viscoelastic responses of biodegradable polymers ⋮ Determination of the optimal accelerated burn-in time under Arrhenius-log normal distribution assumption ⋮ Some modifications of low-dimensional simplex evolution and their convergence ⋮ 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 ⋮ Robust predictive control based on the Meixner-like model ⋮ Gradient-free aerodynamic shape optimization using Large Eddy Simulation ⋮ The quasispecies regime for the simple genetic algorithm with ranking selection

Uses Software

• Genocop

Cites Work

• 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
• Parallel recombinative simulated annealing: A genetic algorithm
• Non-negative matrices and Markov chains. 2nd ed
• Sharp large deviations estimates for simulated annealing algorithms
• Applications of sharp large deviations estimates to optimal cooling schedules
• Rough large deviation estimates for simulated annealing: Application to exponential schedules
• Linear analysis of genetic algorithms
• Modeling genetic algorithms with Markov chains.
• A proof of the Vose-Liepins conjecture
• Genetic algorithms: Bridging the convergence gap
• On the convergence rates of genetic algorithms
• Random heuristic search
• Ergodicity in Parametric Nonstationary Markov Chains: An Application to Simulated Annealing Methods
• Simulated annealing: An introduction
• Asymptotic convergence of genetic algorithms
• ASYMPTOTIC CONVERGENCE PROPERTIES OF GENETIC ALGORITHMS AND EVOLUTIONARY PROGRAMMING: ANALYSIS AND EXPERIMENTS
• Stopping Criteria for Finite Length Genetic Algorithms
• On the Probability Theory of Linkage in Mendelian Heredity
• Theory of genetic algorithms

This page was built for publication: 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