7 research outputs found
On the Runtime of Randomized Local Search and Simple Evolutionary Algorithms for Dynamic Makespan Scheduling
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.Comment: Conference version appears at IJCAI 201
Running Time Analysis of the (1+1)-EA for Robust Linear Optimization
Evolutionary algorithms (EAs) have found many successful real-world
applications, where the optimization problems are often subject to a wide range
of uncertainties. To understand the practical behaviors of EAs theoretically,
there are a series of efforts devoted to analyzing the running time of EAs for
optimization under uncertainties. Existing studies mainly focus on noisy and
dynamic optimization, while another common type of uncertain optimization,
i.e., robust optimization, has been rarely touched. In this paper, we analyze
the expected running time of the (1+1)-EA solving robust linear optimization
problems (i.e., linear problems under robust scenarios) with a cardinality
constraint . Two common robust scenarios, i.e., deletion-robust and
worst-case, are considered. Particularly, we derive tight ranges of the robust
parameter or budget allowing the (1+1)-EA to find an optimal solution
in polynomial running time, which disclose the potential of EAs for robust
optimization.Comment: 17 pages, 1 tabl
Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments
Many real-world optimization problems occur in environments that change
dynamically or involve stochastic components. Evolutionary algorithms and other
bio-inspired algorithms have been widely applied to dynamic and stochastic
problems. This survey gives an overview of major theoretical developments in
the area of runtime analysis for these problems. We review recent theoretical
studies of evolutionary algorithms and ant colony optimization for problems
where the objective functions or the constraints change over time. Furthermore,
we consider stochastic problems under various noise models and point out some
directions for future research.Comment: This book chapter is to appear in the book "Theory of Randomized
Search Heuristics in Discrete Search Spaces", which is edited by Benjamin
Doerr and Frank Neumann and is scheduled to be published by Springer in 201