Modeling genetic algorithms with Markov chains.

From MaRDI portal
Publication:1354022

DOI10.1007/BF01530781zbMath1034.68534MaRDI QIDQ1354022

Michael D. Vose, Allen E. Nix

Publication date: 13 May 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)




Related Items (51)

Global optimization with exploration/selection algorithms and simulated annealingPERFORMANCE EVALUATION OF GENETIC ALGORITHMS AND EVOLUTIONARY PROGRAMMING IN OPTIMIZATION AND MACHINE LEARNINGTheory 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 scalingA comparative runtime analysis of heuristic algorithms for satisfiability problemsUnderstanding measure-driven algorithms solving irreversibly ill-conditioned problemsA self-adaptive migration model genetic algorithm for data mining applicationsA general steady state distribution based stopping criteria for finite length genetic algorithmsThe effect of multiple optima on the simple GA run-time complexityA genetic system based on simulated crossover of sequences of two-bit genesA new approach to estimating the expected first hitting time of evolutionary algorithmsMonotonicity of fitness landscapes and mutation rate controlAn agent-based model of hierarchic genetic searchDynamics of Information and Optimal Control of Mutation in Evolutionary SystemsMetaheuristics: A bibliographyOn initial populations of a genetic algorithm for continuous optimization problemsThe algebra of genetic algorithmsA proof of the Vose-Liepins conjectureA closer look at mutation in genetic algorithmsA mathematical analysis of the long-run behavior of genetic algorithms for social modelingPractical performance models of algorithms in evolutionary program induction and other domainsModified genetic algorithm-based clustering for probability density functionsLearning genetic algorithm parameters using hidden Markov modelsMarkov chain analysis of self-organizing mobile nodes self-organizing mobile nodesApplication of a Markovian process to the calculation of mean time equilibrium in a genetic drift modelA unified framework for population-based metaheuristicsOn the convergence of biogeography-based optimization for binary problemsA new genetic algorithm for solving nonconvex nonlinear programming problemsSorting by swaps with noisy comparisonsMarkov modelling and parameterisation of genetic evolutionary test generationsMODELLING THE DYNAMICS OF AN ADJUSTMENT OF A SEARCH SPACE SIZE IN A GENETIC ALGORITHMBackward-chaining evolutionary algorithmsUnnamed ItemThe island model as a Markov dynamic systemThe dynamics of a genetic algorithm for simple random Ising systemsNew stopping criterion for genetic algorithmsConvergence conditions of genetic algorithmsAnalytical and numerical comparisons of biogeography-based optimization and genetic algorithmsTheory of genetic algorithmsPhase transitions and symmetry breaking in genetic algorithms with crossoverA genetic algorithm for task scheduling on heterogeneous computing systems using multiple priority queuesConvergence of empirical processes for interacting particle systems with applications to nonlinear filteringTheoretical advances in artificial immune systemsTHE PERFORMANCE OF GENETIC ALGORITHM WITH ADJUSTMENT OF A SEARCH SPACETHE DYNAMICS OF A CHANGING RANGE GENETIC ALGORITHM UNDER STABILIZING SELECTIONLinear analysis of genetic algorithmsA Markov chain analysis of genetic algorithms with power of 2 cardinality alphabetsOptimizing epochal evolutionary search: population-size independent theory.Random heuristic search: applications to GAs and functions of unitation.A discipline of evolutionary programmingThe quasispecies regime for the simple genetic algorithm with ranking selectionTowards an analytic framework for analysing the computation time of evolutionary algorithms




Cites Work




This page was built for publication: Modeling genetic algorithms with Markov chains.