DeepAI AI Chat
Log In Sign Up

On the Runtime of Randomized Local Search and Simple Evolutionary Algorithms for Dynamic Makespan Scheduling

by   Frank Neumann, et al.

Evolutionary algorithms have been frequently used for dynamic optimization problems. With this paper, we contribute to the theoretical understanding of this research area. We present the first computational complexity analysis of evolutionary algorithms for a dynamic variant of a classical combinatorial optimization problem, namely makespan scheduling. We study the model of a strong adversary which is allowed to change one job at regular intervals. Furthermore, we investigate the setting of random changes. Our results show that randomized local search and a simple evolutionary algorithm are very effective in dynamically tracking changes made to the problem instance.


page 1

page 2

page 3

page 4


Convergence Properties of Two (μ + λ) Evolutionary Algorithms On OneMax and Royal Roads Test Functions

We present a number of bounds on convergence time for two elitist popula...

Runtime Performances of Randomized Search Heuristics for the Dynamic Weighted Vertex Cover Problem

Randomized search heuristics such as evolutionary algorithms are frequen...

Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments

Many real-world optimization problems occur in environments that change ...

Evolutionary Algorithms and Dynamic Programming

Recently, it has been proven that evolutionary algorithms produce good r...

The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics

Several important optimization problems in the area of vehicle routing c...

Memetic Algorithms Beat Evolutionary Algorithms on the Class of Hurdle Problems

Memetic algorithms are popular hybrid search heuristics that integrate l...