Analyzing search heuristics with differential equations

Drift Theory is currently the most common technique for the analysis of randomized search heuristics because of its broad applicability and the resulting tight first hitting time bounds. The biggest problem when applying a drift theorem is to find a suitable potential function which maps a complex space into a single number, capturing the essence of the state of the search in just one value. We discuss another method for the analysis of randomized search heuristics based on the Theory of Differential Equations. This method considers the deterministic counterpart of the randomized process by replacing probabilistic outcomes by their expectation, and then bounding the error with good probability. We illustrate this by analyzing an Ant Colony Optimization algorithm (ACO) for the Minimum Spanning Tree problem (MST).

[1]  Günter Rudolph,et al.  Analyzing the (1, ) Evolution Strategy via Stochastic Approximation Methods , 1995, Evolutionary Computation.

[2]  N. Wormald.  The differential equation method for random graph processes and greedy algorithms , 1999 .

[3]  H. Schwefel,et al.  Analyzing (1; ) Evolution Strategy via Stochastic Approximation Methods , 1995 .

[4]  Xin Yao,et al.  A study of drift analysis for estimating computation time of evolutionary algorithms , 2004, Natural Computing.

[5]  Frank Neumann,et al.  Design and Management of Complex Technical Processes and Systems by Means of Computational Intelligence Methods Runtime Analysis of a Simple Ant Colony Optimization Algorithm Runtime Analysis of a Simple Ant Colony Optimization Algorithm , 2022 .

[6]  Tiago Paixão,et al.  An Application of Stochastic Differential Equations to Evolutionary Algorithms , 2017, FOGA '17.

[7]  Benjamin Doerr,et al.  Refined runtime analysis of a basic ant colony optimization algorithm , 2007, 2007 IEEE Congress on Evolutionary Computation.

[8]  B. Hajek.  Hitting-time and occupation-time bounds implied by drift analysis with applications , 1982, Advances in Applied Probability.

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

[10]  Frank Neumann,et al.  Ant Colony Optimization and the minimum spanning tree problem , 2006, Theor. Comput. Sci..

[11]  Dirk Sudholt,et al.  On the runtime analysis of the 1-ANT ACO algorithm , 2007, GECCO '07.

[12]  Pietro Simone Oliveto,et al.  Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation , 2008, Algorithmica.

[13]  Johannes Lengler,et al.  Fixed Budget Performance of the (1+1) EA on Linear Functions , 2015, FOGA.

[14]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..