Running time analysis of ant colony optimization for shortest path problems

Journal of Discrete Algorithms

Volumn 10, Issue 1, 2012, Pages 165-180

  Sudholt, Dirk ^a   Thyssen, Christian ^b  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Ant Colony Optimization; Combinatorial optimization; Metaheuristics; Running time analysis; Shortest path problems

Indexed keywords

ANT COLONIES; ANT-COLONY OPTIMIZATION; ARBITRARY DIRECTED GRAPHS; FOOD SOURCES; GENETIC APPROACH; HIGH PROBABILITY; META HEURISTICS; RUNNING TIME; RUNNING TIME ANALYSIS; SHORTEST PATH; SHORTEST PATH PROBLEM; THEORETICAL FOUNDATIONS; UPPER BOUND;

ARTIFICIAL INTELLIGENCE; COMBINATORIAL OPTIMIZATION; DATA PROCESSING; HEURISTIC ALGORITHMS; OPTIMIZATION; WIRELESS SENSOR NETWORKS;

GRAPH THEORY;

EID: 84855525948     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2011.06.002     Document Type: Article

References (46)

1. N. Attiratanasunthron, and J. Fakcharoenphol A running time analysis of an ant colony optimization algorithm for shortest paths in directed acyclic graphs Information Processing Letters 105 3 2008 88 92 (Pubitemid 350192392)
2. H. Bast, S. Funke, P. Sanders, and D. Schultes Fast routing in road networks with transit nodes Science 316 5824 2007 566 (Pubitemid 46683135)
3. S. Baswana, S. Biswas, B. Doerr, T. Friedrich, P.P. Kurur, and F. Neumann Computing single source shortest paths using single-objective fitness functions Proceedings of the 10th International Workshop on Foundations of Genetic Algorithms (FOGA '09) 2009 ACM Press 59 66
4. T.M. Chan More algorithms for all-pairs shortest paths in weighted graphs Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC 07) 2007 ACM Press 590 598 (Pubitemid 47630777)
5. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein Introduction to Algorithms 2nd edn. 2001 MIT Press
6. G. Di Caro, and M. Dorigo AntNet: Distributed stigmergetic control for communications networks Journal of Artificial Intelligence Research 9 1998 317 365 (Pubitemid 128636207)
7. B. Doerr, E. Happ, and C. Klein A tight analysis of the (1 + 1) -EA for the single source shortest path problem Proceedings of the 8th IEEE Congress on Evolutionary Computation (CEC 07) 2007 IEEE Press 1890 1895
8. B. Doerr, E. Happ, and C. Klein Crossover can provably be useful in evolutionary computation Proceedings of the 10th Genetic and Evolutionary Computation Conference (GECCO 08) 2008 ACM Press 539 546
9. B. Doerr, and D. Johannsen Edge-based representation beats vertex-based representation in shortest path problems Proceedings of the 12th Genetic and Evolutionary Computation Conference (GECCO 10) 2010 ACM Press 759 766
10. B. Doerr, D. Johannsen, T. Kötzing, F. Neumann, and M. Theile More effective crossover operators for the all-pairs shortest path problem Proceedings of the 11th International Conference on Parallel Problem Solving from Nature (PPSN 10) LNCS vol. 6238 2010 Springer 184 193
11. B. Doerr, F. Neumann, D. Sudholt, and C. Witt Runtime analysis of the 1-ANT Ant Colony Optimizer Theoretical Computer Science 412 17 2011 1629 1644
12. B. Doerr, and M. Theile Improved analysis methods for crossover-based algorithms Proceedings of the 11th Genetic and Evolutionary Computation Conference (GECCO 09) 2009 ACM Press 247 254
13. M. Dorigo, and C. Blum Ant colony optimization theory: A survey Theoretical Computer Science 344 2005 243 278 (Pubitemid 41554100)
14. M. Dorigo, and L.M. Gambardella Ant colony system: A cooperative learning approach to the traveling salesman problem IEEE Transactions on Evolutionary Computation 1 1 1997 53 66 (Pubitemid 127771018)
15. M. Dorigo, V. Maniezzo, A. Colorni, The ant system: An autocatalytic optimizing process, Tech. Rep. 91-016 Revised, Politecnico di Milano, 1991.
16. M. Dorigo, and T. Stützle Ant Colony Optimization 2004 MIT Press
17. S. Droste, T. Jansen, and I. Wegener Upper and lower bounds for randomized search heuristics in black-box optimization Theory of Computing Systems 39 4 2006 525 544 (Pubitemid 43876884)
18. S. Fischer, and I. Wegener The one-dimensional Ising model: Mutation versus recombination Theoretical Computer Science 344 2-3 2005 208 225 (Pubitemid 41550360)
19. W.J. Gutjahr A generalized convergence result for the graph-based ant system metaheuristic Probability in the Engineering and Informational Sciences 17 2003 545 569 (Pubitemid 38126171)
20. W.J. Gutjahr Mathematical runtime analysis of ACO algorithms: Survey on an emerging issue Swarm Intelligence 1 2007 59 79
21. W.J. Gutjahr First steps to the runtime complexity analysis of ant colony optimization Computers and Operations Research 35 9 2008 2711 2727 (Pubitemid 351186799)
22. W.J. Gutjahr, and G. Sebastiani Runtime analysis of ant colony optimization with best-so-far reinforcement Methodology and Computing in Applied Probability 10 2008 409 433
23. C. Horoba, and D. Sudholt Running time analysis of ACO systems for shortest path problems Proceedings of the 2nd International Workshop on Engineering Stochastic Local Search Algorithms (SLS 09) LNCS vol. 5752 2009 Springer 76 91
24. C. Horoba, D. Sudholt, Ant colony optimization for stochastic shortest path problems, in: Proceedings of the 12th Genetic and Evolutionary Computation Conference (GECCO 10), 2010, pp. 1465-1472.
25. T. Jansen, and I. Wegener On the analysis of evolutionary algorithms-A proof that crossover really can help Algorithmica 34 1 2002 47 66
26. D.R. Karger, D. Koller, and S.J. Phillips Finding the hidden path: Time bounds for all-pairs shortest paths SIAM Journal of Computing 22 1993 1199 1217
27. T. Kötzing, F. Neumann, H. Röglin, and C. Witt Theoretical properties of two ACO approaches for the traveling salesman problem Seventh International Conference on Ant Colony Optimization and Swarm Intelligence (ANTS 10) LNCS vol. 6234 2010 Springer 324 335
28. T. Kötzing, F. Neumann, D. Sudholt, and M. Wagner Simple Max-Min Ant Systems and the optimization of linear pseudo-Boolean functions Proceedings of the 11th Workshop on Foundations of Genetic Algorithms (FOGA 2011) 2011 ACM Press 209 218
29. D. Merkle, and M. Middendorf Modelling the dynamics of ant colony optimization algorithms Evolutionary Computation 10 3 2002 235 262
30. M. Mitzenmacher, and E. Upfal Probability and Computing 2005 Cambridge University Press
31. F. Neumann, D. Sudholt, and C. Witt Rigorous analyses for the combination of ant colony optimization and local search Proceedings of the 6th International Conference on Ant Colony Optimization and Swarm Intelligence (ANTS 08) LNCS vol. 5217 2008 Springer 132 143
32. F. Neumann, D. Sudholt, and C. Witt Analysis of different MMAS ACO algorithms on unimodal functions and plateaus Swarm Intelligence 3 1 2009 35 68
33. F. Neumann, D. Sudholt, C. Witt, A few ants are enough: ACO with iteration-best update, in: Proceedings of the 12th Genetic and Evolutionary Computation Conference (GECCO 10), 2010, pp. 63-70.
34. F. Neumann, and M. Theile How Crossover speeds up evolutionary algorithms for the multi-criteria all-pairs-shortest-path problem Proceedings of the 11th International Conference on Parallel Problem Solving from Nature (PPSN 10) LNCS vol. 6238 2010 Springer 667 676
35. F. Neumann, and C. Witt Runtime analysis of a simple ant colony optimization algorithm Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC 06) LNCS vol. 4288 2006 Springer 618 627
36. F. Neumann, and C. Witt Ant colony optimization and the minimum spanning tree problem Proceedings of the 2nd International Conference on Learning and Intelligent Optimization (LION 07) LNCS vol. 5313 2008 Springer 153 166
37. F. Neumann, and C. Witt Runtime analysis of a simple ant colony optimization algorithm Algorithmica 54 2 2009 243 255
38. J.B. Orlin, K. Madduri, K. Subramani, and M. Williamson A faster algorithm for the single source shortest path problem with few distinct positive lengths Journal of Discrete Algorithms 8 2 2010 189 198
39. J. Scharnow, K. Tinnefeld, and I. Wegener The analysis of evolutionary algorithms on sorting and shortest paths problems Journal of Mathematical Modelling and Algorithms 3 4 2004 349 366 (Pubitemid 40317583)
40. T. Stützle, and H.H. Hoos MAX-MIN ant system Journal of Future Generation Computer Systems 16 2000 889 914
41. D. Sudholt Crossover is provably essential for the Ising model on trees Proceedings of the 7th Genetic and Evolutionary Computation Conference (GECCO 05) 2005 ACM Press 1161 1167 (Pubitemid 43226428)
42. D. Sudholt Using Markov-Chain mixing time estimates for the analysis of ant colony optimization Proceedings of the 11th Workshop on Foundations of Genetic Algorithms (FOGA 2011) 2011 ACM Press 139 150
43. D. Sudholt, and C. Witt Runtime analysis of a binary particle swarm optimizer Theoretical Computer Science 411 21 2010 2084 2100
44. V. Vassilevska Nondecreasing paths in a weighted graph or: How to optimally read a train schedule Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 08) 2008 SIAM 465 472
45. I. Wegener Towards a theory of randomized search heuristics Mathematical Foundations of Computer Science LNCS vol. 2747 2003 Springer 125 141
46. Y. Zhou Runtime analysis of an ant colony optimization algorithm for TSP instances IEEE Transactions on Evolutionary Computation 13 5 2009 1083 1092