Comparing variants of MMAS ACO algorithms on pseudo-boolean functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4638 LNCS, Issue , 2007, Pages 61-75

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

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; OPTIMIZATION; RANDOM PROCESSES;

ACO ALGORITHMS; MMAS; RUNTIME ANALYSES;

ALGORITHMS;

EID: 38049187968     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74446-7_5     Document Type: Conference Paper

References (19)

1. Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)
2. Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: An autocatalytic optimizing process. Technical Report 91-016 Revised, Politecnico di Milano (1991)
3. Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1+1) evolutionary algorithm. Theor. Comput. Sci. 276, 51-81 (2002)
4. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambr. Univ. Press, Cambridge (1995)
5. Mitzenmacher, M., Upfal, E.: Probability and Computing - Randomized Algorithms and Probabilistic Analysis. Cambr. Univ. Press, Cambridge (2005)
6. Gutjahr, W.J.: ACO algorithms with guaranteed convergence to the optimal solution. Inform. Process. Lett. 82, 145-153 (2002)
7. Dorigo, M., Blum, C.: Ant colony optimization theory: A survey. Theor. Comput. Sci. 344, 243-278 (2005)
8. Gutjahr, W.J.: First steps to the runtime complexity analysis of Ant Colony Optimization. Comput. Oper. Res (to appear)
9. Neumann, F., Witt, C.: Runtime analysis of a simple ant colony optimization algorithm. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol. 4288, pp. 618-627. Springer, Heidelberg (2006) extended version to appear in Algorithmica
10. Doerr, B., Neumann, F., Sudholt, D., Witt, C.: On the runtime analysis of the 1-ANT ACO algorithm. In: Proc. of GECCO '07, ACM Press, New York (to appear)
11. Gutjahr, W. J., Sebastiani, G.: Runtime analysis of ant colony optimization. Technical report, Mathematics department, "Sapienza" Univ. of Rome, 2007/03 (2007)
12. Gutjahr, W.J.: Mathematical runtime analysis of ACO algorithms: Survey on an emerging issue. Swarm Intelligence (to appear)
13. Gutjahr, W. J.: On the finite-time dynamics of ant colony optimization. Methodol. Comput. Appli. Probab. 8, 105-133 (2006)
14. Stützle, T., Hoos, H.H.: MAX-MIN ant system. J. Future Gener. Comput. Syst. 16, 889-914 (2000)
15. Jansen, T., Wegener, I.: Evolutionary algorithms - how to cope with plateaus of constant fitness and when to reject strings of the same fitness. IEEE Trans. Evolut. Comput. 5(6), 589-599 (2001)
16. Gamier, J., Kallel, L., Schoenauer, M.: Rigorous hitting times for binary mutations. Evolut. Comput. 7, 173-203 (1999)
17. Wegener, I., Witt, C.: On the optimization of monotone polynomials by simple randomized search heuristics. Combin. Probab. Comput. 14, 225-247 (2005)
18. Wegener, I.: Methods for the analysis of evolutionary algorithms on pseudo-boolean functions. In: Sarker, R., Yao, X., Mohammadian, M. (eds.) Evolutionary Optimization, pp. 349-369. Kluwer, Dordrecht (2002)
19. Rudolph, G.: Convergence Properties of Evolutionary Algorithms. Kovač (1997)