Analysis of different MMAS ACO algorithms on unimodal functions and plateaus

Swarm Intelligence

Volumn 3, Issue 1, 2009, Pages 35-68

  Neumann, Frank ^a   Sudholt, Dirk ^b   Witt, Carsten ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Ant colony optimization; MMAS; Runtime analysis; Theory

Indexed keywords

ACO ALGORITHMS; ANT COLONY OPTIMIZATION; ANT SYSTEMS; LOWER BOUNDS; MMAS; RUN-TIME; RUNTIME ANALYSIS; TEST FUNCTIONS; THEORY; UNIMODAL FUNCTIONS;

CONTROL THEORY; FUNCTIONS; OPTIMIZATION; PROBABILITY DENSITY FUNCTION; PROGRAMMING THEORY;

BOOLEAN FUNCTIONS;

EID: 60149110378     PISSN: 19353812     EISSN: 19353820     Source Type: Journal    
DOI: 10.1007/s11721-008-0023-3     Document Type: Article

References (33)

1. Brémaud, P. (1998). Markov chains: Gibbs fields, Monte Carlo simulation, and queues. New York: Springer.
2. Doerr, B., & Johannsen, D. (2007). Refined runtime analysis of a basic ant colony optimization algorithm. In Proceedings of the congress on evolutionary computation (CEC '07) (pp. 501-507). New York: IEEE Press.
3. Doerr, B., Hebbinghaus, N., & Neumann, F. (2006). Speeding up evolutionary algorithms through restricted mutation operators. In LNCS: Vol. 4193. Parallel problem solving from nature (PPSN '06) (pp. 978-987). Berlin: Springer.
4. Doerr, B., Neumann, F., Sudholt, D., & Witt, C. (2007). On the runtime analysis of the 1-ANT ACO algorithm. In Proceedings of the genetic and evolutionary computation conference (GECCO '07) (pp. 33-40). New York: ACM.
5. Dorigo, M., & Blum, C. (2005). Ant colony optimization theory: A survey. Theoretical Computer Science, 344, 243-278.
6. Dorigo, M., & Stützle, T. (2004). Ant colony optimization. Cambridge: MIT Press.
7. Dorigo, M., Maniezzo, V., & Colorni, A. (1996). Ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics Part B, 26(1), 29-41.
8. Droste, S., Jansen, T., & Wegener, I. (2002). On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science, 276, 51-81.
9. Droste, S., Jansen, T., & Wegener, I. (2006). Upper and lower bounds for randomized search heuristics in black-box optimization. Theory of Computing Systems, 39(4), 525-544.
10. Eiben, A., & Smith, J. (2007). Introduction to evolutionary computing (2nd ed.). Berlin: Springer.
11. Garnier, J., Kallel, L., & Schoenauer, M. (1999). Rigorous hitting times for binary mutations. Evolutionary Computation, 7(2), 173-203.
12. Giel, O., & Wegener, I. (2003). Evolutionary algorithms and the maximum matching problem. In LNCS: Vol. 2607. Proceedings of the 20th annual symposium on theoretical aspects of computer science (STACS '03) (pp. 415-426). Berlin: Springer.
13. Gutjahr, W. J. (2002). ACO algorithms with guaranteed convergence to the optimal solution. Information Processing Letters, 82(3), 145-153.
14. Gutjahr, W. J. (2006). On the finite-time dynamics of ant colony optimization. Methodology and Computing in Applied Probability, 8(1), 105-133.
15. Gutjahr, W. J. (2007). Mathematical runtime analysis of ACO algorithms: Survey on an emerging issue. Swarm Intelligence, 1, 59-79.
16. Gutjahr, W. J. (2008). First steps to the runtime complexity analysis of ant colony optimization. Computers and Operations Research, 35(9), 2711-2727.
17. Gutjahr, W. J., & Sebastiani, G. (2008). Runtime analysis of ant colony optimization with best-so-far reinforcement. Methodology and Computing in Applied Probability, 10, 409-433.
18. Jansen, T. Sudholt, D. (2009, to appear). Analysis of an asymmetric mutation operator. Evolutionary Computation.
19. Jansen, T., & Wegener, I. (2001). Evolutionary algorithms - how to cope with plateaus of constant fitness and when to reject strings of the same fitness. IEEE Transactions on Evolutionary Computation, 5(6), 589-599.
20. Mitzenmacher, M., & Upfal, E. (2005). Probability and computing - randomized algorithms and probabilistic analysis. Cambridge: Cambridge University Press.
21. Motwani, R., & Raghavan, P. (1995). Randomized algorithms. Cambridge: Cambridge University Press.
22. Neumann, F. (2004). Expected runtimes of evolutionary algorithms for the Eulerian cycle problem. In Proceedings of the congress on evolutionary computation (CEC '04) (Vol. 1, pp. 904-910). New York: IEEE Press.
23. Neumann, F. (2007). Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem. European Journal of Operational Research, 181(3), 1620-1629.
24. Neumann, F., & Wegener, I. (2006). Minimum spanning trees made easier via multi-objective optimization. Natural Computing, 5(3), 305-319.
25. Neumann, F., & Wegener, I. (2007). Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Theoretical Computer Science, 378(1), 32-40.
26. Neumann, F., & Witt, C. (2006). Runtime analysis of a simple ant colony optimization algorithm. In LNCS: Vol. 4288. Proceedings of the 17th international symposium on algorithms and computation (ISAAC '06) (pp. 618-627). Berlin: Springer. Extended version to appear in Algorithmica.
27. Neumann, F., Sudholt, D., & Witt, C. (2007). Comparing variants of MMAS ACO algorithms on pseudo-Boolean functions. In LNCS: Vol. 4638. Proceedings of engineering stochastic local search algorithms (SLS '07) (pp. 61-75). Berlin: Springer.
28. Rudolph, G. (1997). Convergence properties of evolutionary algorithms. Hamburg: Kovač.
29. Scharnow, J., Tinnefeld, K., & Wegener, I. (2004). The analysis of evolutionary algorithms on sorting and shortest paths problems. Journal of Mathematical Modelling and Algorithms, 3(4), 349-366.
30. Stützle, T., & Hoos, H. H. (2000). MAX-MIN ant system. Future Generations Computer Systems, 16, 889-914.
31. Wegener, I. (2002). Methods for the analysis of evolutionary algorithms on pseudo-Boolean functions. In R. Sarker, X. Yao, & M. Mohammadian (Eds.), Evolutionary optimization (pp. 349-369). Dordrecht: Kluwer Academic.
32. Wegener, I., & Witt, C. (2005). On the optimization of monotone polynomials by simple randomized search heuristics. Combinatorics, Probability and Computing, 14, 225-247.
33. Witt, C. (2005). Worst-case and average-case approximations by simple randomized search heuristics. In LNCS: Vol. 3404. Proceedings of the 22nd symposium on theoretical aspects of computer science (STACS '05) (pp. 44-56). Berlin: Springer.