On the analysis of trajectory-based search algorithms: when is it beneficial to reject improvements?

DOI10.1007/s00453-018-0462-1zbMath1411.68146OpenAlexW2808518210MaRDI QIDQ1725659

Jorge Pérez Heredia, Samadhi Nallaperuma, Pietro S. Oliveto, Dirk Sudholt

Publication date: 14 February 2019

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-018-0462-1

zbMATH Keywords

evolutionary algorithmsMetropolis algorithmnon-elitismstrong selection weak mutation regime

Mathematics Subject Classification ID

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

Related Items

On the analysis of trajectory-based search algorithms: when is it beneficial to reject improvements?

Cites Work

• Hybridizing evolutionary algorithms with variable-depth search to overcome local optima
• Toward a unifying framework for evolutionary processes
• On the analysis of trajectory-based search algorithms: when is it beneficial to reject improvements?
• How to escape local optima in black box optimisation: when non-elitism outperforms elitism
• Towards a runtime comparison of natural and artificial evolution
• On the mixing time and spectral gap for birth and death chains
• Equation of State Calculations by Fast Computing Machines
• Using markov-chain mixing time estimates for the analysis of ant colony optimization
• Unnamed Item
• Unnamed Item