Ant Colony Optimization for stochastic shortest path problems

Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10

Volumn , Issue , 2010, Pages 1465-1472

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

^a TU DORTMUND UNIVERSITY   (Germany)

^b INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

Author keywords

Ant colony optimization; Combinatorial optimization; Running time analysis; Shortest path problems; Stochastic optimization

Indexed keywords

ANT-COLONY OPTIMIZATION; EDGE WEIGHTS; EXPONENTIAL TIME; GAMMA-DISTRIBUTED; GENERAL UPPER BOUND; INDEPENDENT NOISE; LOWER BOUNDS; RUNNING TIME ANALYSIS; SHORTEST PATH; SHORTEST PATH PROBLEM; STOCHASTIC OPTIMIZATIONS; STOCHASTIC SHORTEST PATH PROBLEM;

APPROXIMATION ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMBINATORIAL OPTIMIZATION; GRAPH THEORY; STOCHASTIC SYSTEMS;

WIRELESS SENSOR NETWORKS;

EID: 77955870840     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1830483.1830750     Document Type: Conference Paper

References (22)

1. N. Attiratanasunthron andJ. Fakcharoenphol. 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.
2. S. Baswana, S. Biswas, B. Doerr, T. Friedrich, P. P. Kurur, andF. Neumann. Computing single source shortest paths using single-objective fitness functions. In FOGA '09, pages 59-66. ACM Press, 2009.
3. D. P. Bertsekas andJ. N. Tsitsiklis. An analysis of stochastic shortest path problems. Mathematics of Operations Research, 16(3):580-595, 1991.
4. J. A. Boyan andM. Mitzenmacher. Improved results for route planning in stochastic transportation. In SODA '01, pages 895-902. SIAM, 2001.
5. B. Doerr, E. Happ, andC. Klein. A tight analysis of the (1+1)-EA for the single source shortest path problem. In CEC '07, pages 1890-1895. IEEE Press, 2007.
6. B. Doerr, E. Happ, andC. Klein. Crossover can provably be useful in evolutionary computation. In GECCO '08, pages 539-546. ACM Press, 2008.
7. B. Doerr, F. Neumann, D. Sudholt, andC. Witt. On the runtime analysis of the 1-ANT ACO algorithm. In GECCO '07, pages 33-40. ACM Press, 2007.
8. B. Doerr andM. Theile. Improved analysis methods for crossover-based algorithms. In GECCO '09, pages 247-254. ACM Press, 2009.
9. M. Dorigo andT. Stützle. Ant Colony Optimization. MIT Press, 2004.
10. S. Droste, T. Jansen, andI. Wegener. On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science, 276:51-81, 2002.
11. Y. Y. Fan, R. E. Kalaba, andJ. E. Moore. Arriving on time. Journal of Optimization Theory and Applications, 127(3) :497-513, 2005.
12. W. J. Gutjahr andG. Sebastiani. Runtime analysis of ant colony optimization with best-so-far reinforcement. Methodology and Computing in Applied Probability, 10:409-433, 2008.
13. C. Horoba andD. Sudholt. Running time analysis of ACO systems for shortest path problems. In SLS '09, pages 76-91. Springer, 2009.
14. E. D. Miller-Hooks andH. S. Mahmassani. Least expected time paths in stochastic, time-varying transportation networks. Transportation Science, 34(2): 198-215, 2000.
15. F. Neumann, D. Sudholt, andC. Witt. Rigorous analyses for the combination of ant colony optimization and local search. In ANTS '08, pages 132-143. Springer, 2008.
16. F. Neumann, D. Sudholt, andC. Witt. Analysis of different MMAS ACO algorithms on unimodal functions and plateaus. Swarm Intelligence, 3(1):35-68, 2009.
17. F. Neumann andC. Witt. Ant colony optimization and the minimum spanning tree problem. In LION '07, pages 153-166. Springer, 2008.
18. F. Neumann andC. Witt. Runtime analysis of a simple ant colony optimization algorithm. Algorithmica, 54(2):243-255, 2009.
19. E. Nikolova, M. Brand, andD. R. Karger. Optimal route planning under uncertainty. In ICAPS '06, pages 131-141. AAAI Press, 2006.
20. C. H. Papadimitriou andM. Yannakakis. Shortest paths without a map. Theoretical Computer Science, 84(1):127-150, 1991.
21. J. Scharnow, K. Tinnefeld, andI. Wegener. The analysis of evolutionary algorithms on sorting and shortest paths problems. Journal of Mathematical Modelling and Algorithms, 3(4):349-366, 2004.
22. Y. Zhou. Runtime analysis of an ant colony optimization algorithm for TSP instances. IEEE Transactions on Evolutionary Computation, 13(5): 1083-1092, 2009.