Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions

Recently, the first rigorous runtime analyses of ACO algorithms have been presented. These results concentrate on variants of the MAX-MIN ant system by Stutzle and Hoos and consider their runtime on simple pseudo-Boolean functions such as OneMax and LeadingOnes. Interestingly, it turns out that a variant called 1-ANT is very sensitive to the choice of the evaporation factor while a recent technical report by Gutjahr and Sebastiani suggests partly opposite results for their variant called MMAS. In this paper, we elaborate on the differences between the two ACO algorithms, generalize the techniques by Gutjahr and Sebastiani and show improved results.

[1]  Walter J. Gutjahr,et al.  First steps to the runtime complexity analysis of ant colony optimization , 2008, Comput. Oper. Res..

[2]  M. Dorigo,et al.  Ant System: An Autocatalytic Optimizing Process , 1991 .

[3]  Walter J. Gutjahr,et al.  Mathematical runtime analysis of ACO algorithms: survey on an emerging issue , 2007, Swarm Intelligence.

[4]  Eli Upfal,et al.  Probability and Computing: Randomized Algorithms and Probabilistic Analysis , 2005 .

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

[6]  Ingo Wegener,et al.  Methods for the Analysis of Evolutionary Algorithms on Pseudo-Boolean Functions , 2003 .

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

[8]  Manuel López-Ibáñez,et al.  Ant colony optimization , 2010, GECCO '10.

[9]  W. Gutjahr.  On the Finite-Time Dynamics of Ant Colony Optimization , 2006 .

[10]  Xin Yao,et al.  Evolutionary Optimization , 2002 .

[11]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

[12]  Marco Dorigo,et al.  Ant colony optimization theory: A survey , 2005, Theor. Comput. Sci..

[13]  Marc Schoenauer,et al.  Rigorous Hitting Times for Binary Mutations , 1999, Evolutionary Computation.

[14]  Walter J. Gutjahr,et al.  ACO algorithms with guaranteed convergence to the optimal solution , 2002, Inf. Process. Lett..

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

[16]  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 .

[17]  Thomas Jansen,et al.  Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Evolutionary Algorithms-How to Cope With Plateaus of Constant Fitness and When to Reject Strings of the Same Fitness , 2001 .

[18]  Ingo Wegener,et al.  On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics , 2005, Combinatorics, Probability and Computing.