Analysis of evolutionary algorithms: from computational complexity analysis to algorithm engineering

DOI10.1145/1967654.1967656MaRDI QIDQ5276079zbMATH OpenOpenAlexFDO

Authors Thomas Jansen, Christine Zarges

Publication date 14 July 2017

Published in Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1967654.1967656

zbMATH Keywords

algorithm engineeringperformance measuresruntime analysis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms (68W40)

Recommendations

• Analysis for time complexity of evolutionary algorithms
• Drift analysis and average time complexity of evolutionary algorithms
• scientific article; zbMATH DE number 6019547
• Some analyses about the time complexity of evolutionary algorithms
• Some analysis about the time complexity of evolutionary algorithms

Cited in

(14)

• The analysis of evolutionary algorithms -- A proof that crossover really can help
• A mixed evolutionary-statistical analysis of an algorithm's complexity
• Efficiency and effectiveness metrics in evolutionary algorithms and their application
• Performance analysis of randomised search heuristics operating with a fixed budget
• Algorithmic analysis of a basic evolutionary algorithm for continuous optimization
• scientific article; zbMATH DE number 1754532 (Why is no real title available?)
• Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
• Analysis for time complexity of evolutionary algorithms
• Analyzing evolutionary algorithms. The computer science perspective.
• The cost of randomness in evolutionary algorithms: crossover can save random bits
• Runtime analysis for permutation-based evolutionary algorithms
• Experimental and theoretical analysis of local search optimising OBDD variable orderings
• Runtime analysis with variable cost
• Analysis of evolutionary algorithms for the longest common subsequence problem

This page was built for publication: Analysis of evolutionary algorithms: from computational complexity analysis to algorithm engineering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5276079)