Running time analysis of ACO systems for shortest path problems

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

Volumn 5752 LNCS, Issue , 2009, Pages 76-91

  Horoba, Christian ^a   Sudholt, Dirk ^a,b  

^a TU DORTMUND UNIVERSITY   (Germany)

^b INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACYCLIC GRAPHS; ANT COLONIES; ANT-COLONY OPTIMIZATION; ARBITRARY GRAPHS; FOOD SOURCES; HIGH PROBABILITY; INFORMATION PROCESSING; METAHEURISTIC; RUNNING TIME; RUNNING TIME ANALYSIS; SHORTEST PATH; SHORTEST PATH PROBLEM; UPPER BOUND;

DATA PROCESSING; HEURISTIC METHODS; LEARNING ALGORITHMS;

WIRELESS SENSOR NETWORKS;

EID: 70350475678     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03751-1_6     Document Type: Conference Paper

References (21)

1. 1. Dorigo, M., Gambardella, L.M.: Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation 1(1), 53-66 (1997)
2. 2. Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: An autocatalytic optimizing process. Technical Report 91-016 Revised, Politecnico di Milano (1991)
3. 3. Di Caro, G., Dorigo, M.: AntNet: Distributed stigmergetic control for communications networks. Journal of Artificial Intelligence Research 9, 317-365 (1998)
4. 4. Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)
5. 5. Gutjahr, W.J.: A generalized convergence result for the graph-based ant system metaheuristic. Probability in the Engineering and Informational Sciences 17, 545-569 (2003)
6. 6. Merkle, D., Middendorf, M.: Modelling the dynamics of Ant Colony Optimization algorithms. Evolutionary Computation 10(3), 235-262 (2002)
7. 7. Gutjahr, W.J.: First steps to the runtime complexity analysis of ant colony optimization. Computers and Operations Research 35(9), 2711-2727 (2008)
8. 8. 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)
9. 9. Doerr, B., Neumann, F., Sudholt, D., Witt, C.: On the runtime analysis of the 1-ANT ACO algorithm. In: Proc. of GECCO 2007, pp. 33-40. ACM Press, New York (2007)
10. 10. Stützle, T., Hoos, H.H.: MAX-MIN ant system. Journal of Future Generation Computer Systems 16, 889-914 (2000)
11. 11. Gutjahr, W.J., Sebastiani, G.: Runtime analysis of ant colony optimization with best-so-far reinforcement. Methodology and Computing in Applied Probability 10, 409-433 (2008)
12. 12. Neumann, F., Sudholt, D., Witt, C.: Analysis of different MMAS ACO algorithms on unimodal functions and plateaus. Swarm Intelligence 3(1), 35-68 (2009)
13. 13. Neumann, F., Sudholt, D., Witt, C.: Rigorous analyses for the combination of ant colony optimization and local search. In: Dorigo, M., Birattari, M., Blum, C., Clerc, M., Stützle, T., Winfield, A.F.T. (eds.) ANTS 2008. LNCS, vol. 5217, pp. 132-143. Springer, Heidelberg (2008)
14. 14. Neumann, F., Witt, C.: Ant colony optimization and the minimum spanning tree problem. In: Maniezzo, V., Battiti, R., Watson, J.-P. (eds.) LION 2007 II. LNCS, vol. 5313, pp. 153-166. Springer, Heidelberg (2008)
15. 15. Attiratanasunthron, N., Fakcharoenphol, J.: A running time analysis of an ant colony optimization algorithm for shortest paths in directed acyclic graphs. Information Processing Letters 105(3), 88-92 (2008)
16. 16. Scharnow, J., Tinnefeld, K., Wegener, I.: The analysis of evolutionary algorithms on sorting and shortest paths problems. Journal of Mathematical Modelling and Algorithms 3(4), 349-366 (2004)
17. 17. Doerr, B., Happ, E., Klein, C.: A tight analysis of the (1+1)-EA for the single source shortest path problem. In: Proc. of CEC 2007, pp. 1890-1895. IEEE Press, Los Alamitos (2007)
18. 18. Doerr, B., Happ, E., Klein, C.: Crossover can provably be useful in evolutionary computation. In: Proc. of GECCO 2008, pp. 539-546. ACM Press, New York (2008)
19. 19. Horoba, C.: Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem. In: Proc. of FOGA 2009, pp. 113-120. ACM Press, New York (2009)
20. 20. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press, Cambridge (2001)
21. 21. Mitzenmacher, M., Upfal, E.: Probability and Computing. Cambridge University Press, Cambridge (2005)