Hitting times of local and global optima in genetic algorithms with very high selection pressure

DOI10.2298/YJOR160318016EzbMath1474.90528arXiv1606.05784OpenAlexW2962740835MaRDI QIDQ4987699

Anton Valentinovich Eremeev

Publication date: 3 May 2021

Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

combinatorial optimizationlocal searchevolutionary algorithmsruntime analysisfitness level

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Runtime analysis of non-elitist populations: from classical optimisation to partial information
• Crossover can be constructive when computing unique input-output sequences
• Local search, reducibility and approximability of NP-optimization problems
• Attraction probabilities in variable neighborhood search
• Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems
• A genetic algorithm for the set covering problem
• A discipline of evolutionary programming
• The analysis of evolutionary algorithms -- A proof that crossover really can help
• On the runtime analysis of the simple genetic algorithm
• Genetic local search the graph partitioning problem under cardinality constraints
• Optimal recombination in genetic algorithms for combinatorial optimization problems: Part I
• A Sharp Bound on the Ratio Between Optimal Integer and Fractional Covers
• Optimized Crossover for the Independent Set Problem
• Drift analysis and average time complexity of evolutionary algorithms

This page was built for publication: Hitting times of local and global optima in genetic algorithms with very high selection pressure