Optimizing epochal evolutionary search: population-size independent theory.

DOI10.1016/S0045-7825(99)00383-7zbMath1039.92031arXivadap-org/9810003WikidataQ57234288 ScholiaQ57234288MaRDI QIDQ1574373

James P. Crutchfield, Erik Van Nimwegen

Publication date: 2000

Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/adap-org/9810003

Mathematics Subject Classification ID

Problems related to evolution (92D15) Mathematical programming (90C99)

Related Items (4)

Hybridizations of evolutionary algorithms with large neighborhood search ⋮ Optimal adaptive performance and delocalization in NK fitness landscapes ⋮ Random heuristic search: applications to GAs and functions of unitation. ⋮ The quasispecies regime for the simple genetic algorithm with ranking selection

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The dynamics of a genetic algorithm for simple random Ising systems
• Replication and mutation on neutral networks
• Evolution in a flat fitness landscape
• Modeling genetic algorithms with Markov chains.
• Evolving cellular automata to perform computations: Mechanisms and impediments
• Advances in artificial life. Third European conference on artificial life, Granada, Spain, June 4-6, 1995. Proceedings
• Finite populations induce metastability in evolutionary search.
• Statistical Dynamics of the Royal Road Genetic Algorithm
• The dynamics of a genetic algorithm for a simple learning problem
• The evolution of emergent computation.

This page was built for publication: Optimizing epochal evolutionary search: population-size independent theory.