Evolutionary anytime algorithms

DOI10.1007/978-3-031-86849-8_2MaRDI QIDQ6966813zbMATH OpenFDO

Authors Jonathan E. Rowe Aishwaryaprajna, Jonathan E. Rowe

Publication date 27 June 2025

Full work available at URL https://doi.org/10.1007/978-3-031-86849-8_2

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Cites work

• Do additional target points speed up evolutionary algorithms?
• Drift analysis and evolutionary algorithms revisited
• How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys
• Non-uniform mutation rates for problems with unknown solution lengths
• On the analysis of the \((1+1)\) evolutionary algorithm
• Performance analysis of randomised search heuristics operating with a fixed budget
• Solving problems with unknown solution length at almost no extra cost
• The benefits and limitations of voting mechanisms in evolutionary optimisation

This page was built for publication: Evolutionary anytime algorithms

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