DeepAI AI Chat
Log In Sign Up

When Non-Elitism Meets Time-Linkage Problems

by   Weijie Zheng, et al.

Many real-world applications have the time-linkage property, and the only theoretical analysis is recently given by Zheng, et al. (TEVC 2021) on their proposed time-linkage OneMax problem, OneMax_(0,1^n). However, only two elitist algorithms (1+1)EA and (μ+1)EA are analyzed, and it is unknown whether the non-elitism mechanism could help to escape the local optima existed in OneMax_(0,1^n). In general, there are few theoretical results on the benefits of the non-elitism in evolutionary algorithms. In this work, we analyze on the influence of the non-elitism via comparing the performance of the elitist (1+λ)EA and its non-elitist counterpart (1,λ)EA. We prove that with probability 1-o(1) (1+λ)EA will get stuck in the local optima and cannot find the global optimum, but with probability 1, (1,λ)EA can reach the global optimum and its expected runtime is O(n^3+clog n) with λ=c log_e/e-1 n for the constant c≥ 1. Noting that a smaller offspring size is helpful for escaping from the local optima, we further resort to the compact genetic algorithm where only two individuals are sampled to update the probabilistic model, and prove its expected runtime of O(n^3log n). Our computational experiments also verify the efficiency of the two non-elitist algorithms.


page 1

page 2

page 3

page 4


Analysis of Evolutionary Algorithms on Fitness Function with Time-linkage Property

In real-world applications, many optimization problems have the time-lin...

Theoretical Analyses of Evolutionary Algorithms on Time-Linkage OneMax with General Weights

Evolutionary computation has shown its superiority in dynamic optimizati...

How the Move Acceptance Hyper-Heuristic Copes With Local Optima: Drastic Differences Between Jumps and Cliffs

In recent work, Lissovoi, Oliveto, and Warwicker (Artificial Intelligenc...

Does Comma Selection Help To Cope With Local Optima

One hope of using non-elitism in evolutionary computation is that it aid...

Update Strength in EDAs and ACO: How to Avoid Genetic Drift

We provide a rigorous runtime analysis concerning the update strength, a...

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

The paper is devoted to upper bounds on the expected first hitting times...

On the performance of a hybrid genetic algorithm in dynamic environments

The ability to track the optimum of dynamic environments is important in...