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

2016/06/18 by Anton V. Eremeev, Eremeev, Anton
Computer Science · #Advanced Multi-Objective Optimization Algorithms #Evolutionary Algorithms and Applications #FOS: Computer and information sciences #Metaheuristic Optimization Algorithms Research #Neural and Evolutionary Computing (cs.NE)

paper · pdf · doi:10.48550/arxiv.1606.05784

openalex publication_date 2016/06/18 · openalex created_date 2022/10/01 · openalex updated_date 2026/07/28

Abstract

The paper is devoted to upper bounds on the expected first hitting times of\nthe sets of local or global optima for non-elitist genetic algorithms with very\nhigh selection pressure. The results of this paper extend the range of\nsituations where the upper bounds on the expected runtime are known for genetic\nalgorithms and apply, in particular, to the Canonical Genetic Algorithm. The\nobtained bounds do not require the probability of fitness-decreasing mutation\nto be bounded by a constant less than one.\n

Related

• Asymptotical Analysis of the (1+(λ,λ)) GA Escape Time from Local Optima on Jump Functions
• Runtime Analysis of Fitness-Proportionate Selection on Linear Functions
• A New Method for Lower Bounds on the Running Time of Evolutionary\n Algorithms
• Level-Based Analysis of Genetic Algorithms for Combinatorial\n Optimization
• Non-Elitist Genetic Algorithm as a Local Search Method