Neutrality in fitness landscapes.

DOI10.1016/S0096-3003(99)00166-6zbMath1113.92314OpenAlexW2095199595WikidataQ56991840 ScholiaQ56991840MaRDI QIDQ5931693

Peter F. Stadler, Christian M. Reidys

Publication date: 25 April 2001

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0096-3003(99)00166-6

zbMATH Keywords

Combinatorial optimizationNeutralityRandom landscapesRuggedness

Mathematics Subject Classification ID

Problems related to evolution (92D15) Combinatorial optimization (90C27)

Related Items

ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms ⋮ Mutate now, die later. Evolutionary dynamics with delayed selection ⋮ Rugged and Elementary Landscapes ⋮ Constraint-handling through multi-objective optimization: the hydrophobic-polar model for protein structure prediction ⋮ NEUTRAL EVOLUTION AND MUTATION RATES OF SEQUENTIAL DYNAMICAL SYSTEMS ⋮ Fitness landscape of the cellular automata majority problem: view from the ``Olympus ⋮ Evolutionary optimization: pitfalls and booby traps ⋮ Expansion-based hill-climbing ⋮ A study of the neutrality of Boolean function landscapes in genetic programming ⋮ On the effect of solution representation and neighborhood definition in AutoML fitness landscapes ⋮ Spatial-domain fitness landscape analysis for combinatorial optimization ⋮ Percolation on fitness landscapes: effects of correlation, phenotype, and incompatibilities ⋮ Fitness landscape analysis of automated machine learning search spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Replication and mutation on neutral networks
• Correlated and uncorrelated fitness landscapes and how to tell the difference
• Autocorrelation coefficient for the graph bipartitioning problem
• Traveling salesman problem and local search
• Local search and the local structure of NP-complete problems
• Acyclic orientations of random graphs
• Random field models for fitness landscapes
• Generic properties of combinatory maps: Neutral networks of RNA secondary structures
• Random induced subgraphs of generalized \(n\)-cubes
• Landscapes and their correlation functions
• On the quality of local search for the quadratic assignment problem
• Elements of a theory of simulation. II: Sequential dynamical systems.
• Random walks and orthogonal functions associated with highly symmetric graphs
• Application of statistical mechanics to NP-complete problems in combinatorial optimisation
• Graph bipartitioning and statistical mechanics
• Amplitude Spectra of Fitness Landscapes
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Random structures
• The landscape of the traveling salesman problem