Cover-encodings of fitness landscapes

DOI10.1007/s11538-018-0451-1zbMath1398.92179arXiv1806.05248OpenAlexW2808596446WikidataQ89287615 ScholiaQ89287615MaRDI QIDQ1786928

Konstantin Klemm, Anita Mehta, Peter F. Stadler

Publication date: 25 September 2018

Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1806.05248

zbMATH Keywords

combinatorial optimizationadaptive walkcoarse-graininggenotype-phenotype maporacle function

Mathematics Subject Classification ID

Problems related to evolution (92D15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Optimisation via encodings: a renormalisation group perspective

Cites Work

• Theory and principled methods for the design of metaheuristics
• Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
• Design of modern heuristics. Principles and application.
• Matching theory
• Fast Fourier transform for fitness landscapes
• A fast algorithm for the maximum clique problem
• The number of spanning forests of a graph
• Representations for genetic and evolutionary algorithms. With a foreword by David E. Goldberg.
• Easily searched encodings for number partitioning
• The traveling salesman problem and its variations.
• Combinatorial Landscapes
• Renormalization Group and Critical Phenomena. I. Renormalization Group and the Kadanoff Scaling Picture
• Saddles and Barrier in Landscapes of Generalized Search Operators
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cover-encodings of fitness landscapes