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.

[1]  Frank Neumann,et al.  Bioinspired computation in combinatorial optimization: algorithms and their computational complexity , 2010, GECCO '12.

[2]  Carsten Witt,et al.  Runtime analysis of ant colony optimization on dynamic shortest path problems , 2015, Theor. Comput. Sci..

[3]  Timo Kötzing,et al.  ACO Beats EA on a Dynamic Pseudo-Boolean Function , 2012, PPSN.

[4]  Xin Yao,et al.  Drift analysis and average time complexity of evolutionary algorithms , 2001, Artif. Intell..

[5]  Carsten Witt,et al.  Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions† , 2013, Combinatorics, Probability and Computing.

[6]  Benjamin Doerr,et al.  Multiplicative Drift Analysis , 2010, GECCO '10.

[7]  Thomas Jansen,et al.  Analyzing Evolutionary Algorithms: The Computer Science Perspective , 2012 .

[8]  Carsten Witt,et al.  UNIVERSITY OF DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics , 2004 .

[9]  Thomas Jansen,et al.  On the analysis of the (1+1) evolutionary algorithm , 2002, Theor. Comput. Sci..

[10]  Per Kristian Lehre,et al.  Dynamic evolutionary optimisation: an analysis of frequency and magnitude of change , 2009, GECCO.

[11]  Frank Neumann,et al.  A Parameterized Runtime Analysis of Evolutionary Algorithms for the Euclidean Traveling Salesperson Problem , 2012, AAAI.

[12]  Benjamin Doerr,et al.  Monotonic functions in EC: anything but monotone! , 2014, GECCO.

[13]  Thomas Jansen,et al.  Evolutionary algorithms and artificial immune systems on a bi-stable dynamic optimisation problem , 2014, GECCO.

[14]  Carsten Witt,et al.  MMAS Versus Population-Based EA on a Family of Dynamic Fitness Functions , 2014, Algorithmica.

[15]  Xin Yao,et al.  Towards an analytic framework for analysing the computation time of evolutionary algorithms , 2003, Artif. Intell..

[16]  Xin Yao,et al.  On the approximation ability of evolutionary optimization with application to minimum set cover , 2010, Artif. Intell..

[17]  Christian Horoba.  Exploring the Runtime of an Evolutionary Algorithm for the Multi-Objective Shortest Path Problem , 2010, Evolutionary Computation.

[18]  Pietro Simone Oliveto,et al.  Analysis of diversity mechanisms for optimisation in dynamic environments with low frequencies of change , 2013, GECCO '13.

[19]  Thomas Jansen,et al.  On the brittleness of evolutionary algorithms , 2007, FOGA'07.

[20]  Anne Auger,et al.  Theory of Randomized Search Heuristics: Foundations and Recent Developments , 2011, Theory of Randomized Search Heuristics.

[21]  V. Climenhaga.  Markov chains and mixing times , 2013 .

[22]  Carsten Witt,et al.  Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models , 2007, Evolutionary Computation.

[23]  Yang Yu,et al.  An analysis on recombination in multi-objective evolutionary optimization , 2013, Artif. Intell..

[24]  Frank Neumann,et al.  Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem , 2004, Eur. J. Oper. Res..

[25]  Yang Yu,et al.  A new approach to estimating the expected first hitting time of evolutionary algorithms , 2006, Artif. Intell..

[26]  Frank Neumann,et al.  A Parameterized Runtime Analysis of Simple Evolutionary Algorithms for Makespan Scheduling , 2012, PPSN.