Runtime Analysis of Ant Colony Optimization with Best-So-Far Reinforcement

The paper provides some theoretical results on the analysis of the expected time needed by a class of Ant Colony Optimization algorithms to solve combinatorial optimization problems. A part of the study refers to some general results on the expected runtime of the considered class of algorithms. These results are then specialized to the case of pseudo-Boolean functions. In particular, three well known functions and a combination of two of them are considered: the OneMax, the Needle-in-a-Haystack, the LeadingOnes, and the OneMax-Needle-in-a-Haystack. The results obtained for these functions are also compared to those from the well-investigated (1+1)-Evolutionary Algorithm. The results shed light on a suitable parameter choice for the considered class of algorithms. Furthermore, it turns out that for two of the four studied problems, the expected runtime for the considered class, expressed in terms of the problem size, is of the same order as that for (1+1)-Evolutionary Algorithm. For the other two problems, the results are significantly in favour of the considered class of Ant Colony Optimization algorithms.

[1]  Terry Jones,et al.  Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms , 1995, ICGA.

[2]  Dan Boneh,et al.  On genetic algorithms , 1995, COLT '95.

[3]  Gian Luca Foresti,et al.  A distributed probabilistic system for adaptive regulation of image processing parameters , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[4]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[5]  T. Stützle,et al.  MAX-MIN Ant System and local search for the traveling salesman problem , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[6]  E. D. Taillard,et al.  Ant Systems , 1999 .

[7]  Riccardo Poli,et al.  New ideas in optimization , 1999 .

[8]  Marco Dorigo,et al.  The ant colony optimization meta-heuristic , 1999 .

[9]  Walter J. Gutjahr,et al.  A Graph-based Ant System and its convergence , 2000, Future Gener. Comput. Syst..

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

[11]  L. Kallel,et al.  Theoretical Aspects of Evolutionary Computing , 2001, Natural Computing Series.

[12]  C. Reeves,et al.  Properties of fitness functions and search landscapes , 2001 .

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

[14]  Martin Middendorf,et al.  Modeling the Dynamics of Ant Colony Optimization , 2002, Evolutionary Computation.

[15]  Thomas Stützle,et al.  A short convergence proof for a class of ant colony optimization algorithms , 2002, IEEE Trans. Evol. Comput..

[16]  Thomas Stützle,et al.  A SHORT CONVERGENCE PROOF FOR A CLASS OF ACO ALGORITHMS , 2002 .

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

[18]  Anton V. Eremeev,et al.  A Study on Performance of the (1+1)-Evolutionary Algorithm , 2002, FOGA.

[19]  Véronique Ladret.  Asymptotic hitting time for a simple evolutionary model of protein folding , 2003, math/0308237.

[20]  W. Gutjahr.  A GENERALIZED CONVERGENCE RESULT FOR THE GRAPH-BASED ANT SYSTEM METAHEURISTIC , 2003, Probability in the Engineering and Informational Sciences.

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

[22]  G. Sebastiani,et al.  An Extended Ant Colony Algorithm and Its Convergence Analysis , 2005 .

[23]  Ingo Wegener,et al.  On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions , 2005, J. Discrete Algorithms.

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

[25]  Mauro Birattari,et al.  On the Invariance of Ant System , 2006, ANTS Workshop.

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

[27]  Mauro Birattari,et al.  On the Invariance of Ant Colony Optimization , 2007, IEEE Transactions on Evolutionary Computation.

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

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

[30]  Thomas Stützle,et al.  Ant Colony Optimization , 2009, EMO.