Correlated and uncorrelated fitness landscapes and how to tell the difference
From MaRDI portal
Publication:916592
DOI10.1007/BF00202749zbMath0703.92016WikidataQ55967974 ScholiaQ55967974MaRDI QIDQ916592
Publication date: 1990
Published in: Biological Cybernetics (Search for Journal in Brave)
random walkfitness landscapesautocorrelation of fitnessesaverage autocorrelationcombinatorial optimization algorithmsglobally optimal fitnesses of AR(1) landscapes
Time series, auto-correlation, regression, etc. in statistics (GARCH) (62M10) Problems related to evolution (92D15)
Related Items
ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms ⋮ A new adaptive multi-start technique for combinatorial global optimizations ⋮ Rugged and Elementary Landscapes ⋮ Random walks and orthogonal functions associated with highly symmetric graphs ⋮ Optimal execution with non-linear transient market impact ⋮ Complex networks: from graph theory to biology ⋮ Local search with memory: Benchmarking RTS ⋮ \(\mathrm{PUBO}_i\): a tunable benchmark with variable importance ⋮ Fitness landscape analysis and metaheuristics efficiency ⋮ On the Hamming distance in combinatorial optimization problems on hypergraph matchings ⋮ A review of metrics on permutations for search landscape analysis ⋮ Landscapes and their correlation functions ⋮ A minimum on the mean number of steps taken in adaptive walks ⋮ Mutation landscapes ⋮ Autocorrelation coefficient for the graph bipartitioning problem ⋮ Fitness landscape of the cellular automata majority problem: view from the ``Olympus ⋮ Breaking the search space symmetry in partitioning problems: an application to the graph coloring problem ⋮ A review of distances for the Mallows and generalized Mallows estimation of distribution algorithms ⋮ Penalty and partitioning techniques to improve performance of QUBO solvers ⋮ A REGION-BASED MULTI-ISSUE NEGOTIATION PROTOCOL FOR NONMONOTONIC UTILITY SPACES ⋮ Stochastic local search and parameters recommendation: a case study on flowshop problems ⋮ From fitness landscapes evolution to automatic local search algorithm generation ⋮ Partial neighborhood local searches ⋮ Evolutionary accessibility in tunably rugged fitness landscapes ⋮ Designing Efficient Evolutionary Algorithms for Cluster Optimization: A Study on Locality ⋮ Autocorrelation measures for the quadratic assignment problem ⋮ Quantitative measure of nonconvexity for black-box continuous functions ⋮ On the classification of NP-complete problems in terms of their correlation coefficient ⋮ On the roles of semantic locality of crossover in genetic programming ⋮ Elementary landscape decomposition of the frequency assignment problem ⋮ FITNESS LANDSCAPES AND THE ANDREWS–CURTIS CONJECTURE ⋮ Why operator-induced neighborhoods are a bad idea ⋮ Fourier and Taylor series on fitness landscapes ⋮ Algorithm runtime prediction: methods \& evaluation ⋮ Random assignment problems ⋮ On the Foundations and the Applications of Evolutionary Computing ⋮ A Complex-Networks View of Hard Combinatorial Search Spaces ⋮ Coupled map lattices as spatio-temporal fitness functions: Landscape measures and evolutionary optimization ⋮ Neutrality in fitness landscapes. ⋮ Arbitrary elementary landscapes \& AR(1) processes ⋮ The characteristic landscape equation for an AR(2) landscape ⋮ Dynamics of local search trajectory in traveling salesman problem ⋮ On the landscape ruggedness of the quadratic assignment problem ⋮ The parameter-less genetic algorithm in practice ⋮ The linear ordering problem: instances, search space analysis and algorithms ⋮ On the usefulness of accessibility graphs with combinatorial optimization problems ⋮ Iterated local search for the quadratic assignment problem ⋮ The landscape of the traveling salesman problem ⋮ Hill Climbing Algorithms and Trivium ⋮ On the use of random walks to estimate correlation in fitness landscapes. ⋮ Landscapes on spaces of trees ⋮ Optimization by hierarchical mutant production
Cites Work
