First steps to the runtime complexity analysis of ant colony optimization

Computers and Operations Research

Volumn 35, Issue 9, 2008, Pages 2711-2727

  Gutjahr, Walter J ^a  

^a UNIVERSITY OF VIENNA   (Austria)

Author keywords

Analysis of algorithms; Ant colony optimization; Complexity; Evolutionary algorithms; Runtime analysis

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; EVOLUTIONARY ALGORITHMS; FINITE DIFFERENCE METHOD; PROBLEM SOLVING; RANDOM PROCESSES; THEOREM PROVING;

ANALYSIS OF ALGORITHMS; ANT COLONY OPTIMIZATION; RUNTIME ANALYSIS;

OPTIMIZATION;

EID: 38749084585     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2006.12.017     Document Type: Article

References (27)

1. Dorigo M, Maniezzo V, Colorni A. The ant system: an autocatalytic optimization process. Technical Report 91-016, Department of Electronics, Politecnico di Milano, Italy; 1991.
2. Dorigo M., Maniezzo V., and Colorni A. The ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics 26 (1996) 1-13
3. Dorigo M., and Di Caro G. The ant colony optimization metaheuristic. In: Corne D., Dorigo M., and Glover F. (Eds). New ideas in optimization (1999), McGraw-Hill, New York 11-32
4. Dorigo M., and Blum C. Ant colony optimization theory: a survey. Theoretical Computer Science 344 (2005) 243-278
5. Gutjahr W.J. A graph-based ant system and its convergence. Future Generation Computer Systems 16 (2000) 873-888
6. Gutjahr W.J. ACO algorithms with guaranteed convergence to the optimal solution. Information Processing Letters 82 (2002) 145-153
7. Gutjahr W.J. A generalized convergence result for the graph-based ant system. Probability in the Engineering and Informational Sciences 17 (2003) 545-569
8. Stützle T., and Dorigo M. A short convergence proof for a class of ACO algorithms. IEEE Transactions on Evolutionary Computation 6 (2002) 358-365
9. Sebastiani G., and Torrisi G.L. An extended ant colony algorithm and its convergence analysis. Methodology and Computing in Applied Probability 7 (2005) 249-263
10. Merkle D., and Middendorf M. Modeling the dynamics of ant colony optimization. Evolutionary Computation 10 (2002) 235-262
11. Gutjahr W.J. On the finite-time dynamics of ant colony optimization. Methodology and Computing in Applied Probability 8 (2006) 105-133
12. Droste S., Jansen T., and Wegener I. On the analysis of the (1 + 1) evolutionary algorithm. Theoretical Computer Science 276 (2002) 51-81
13. Neumann F, Wegener I. Randomized local search, evolutionary algorithms, and the minimum spanning tree. Technical Report CI-165/04, Department of Computer Science, University of Dortmund, Germany; 2004.
14. Wegener I., and Witt C. On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions. Journal of Discrete Algorithms 3 (2005) 61-78
15. Gutjahr WJ. A converging ACO algorithm for stochastic combinatorial optimization. Proceedings of SAGA 2003 (stochastic algorithms: foundations and applications), Lecture notes in computer science, vol. 2827. Berlin: Springer; 2003. p. 10-25.
16. Gutjahr WJ. S-ACO: an ant-based approach to combinatorial optimization under uncertainty. Proceedings of ANTS 2004 (fourth international workshop on ant colony optimization and swarm intelligence), Lecture notes in computer science, vol. 3172. Berlin: Springer; 2004. p. 238-49.
17. Rauner M., Brailsford S.C., Gutjahr W.J., and Zeppelzauer W. Optimal screening policies for diabetic retinopathy using a combined discrete-event simulation and ant colony optimization approach. In: Anderson J.G., and Katzper M. (Eds). Proceedings of international conference on health sciences simulation, western multiconference '05; (2005) 147-152
18. Brailsford SC, Gutjahr WJ, Rauner M, Zeppelzauer W. Combined discrete-event simulation and ant colony optimisation approach for selecting optimal screening policies for diabetic retinopathy. Computational Management Science, in print (published online: 15th August 2006).
19. Dorigo M., and Stützle T. Ant colony optimization (2004), MIT Press, Cambridge, MA
20. Gambardella L.M., and Dorigo M. Ant-Q: a reinforcement learning approach to the traveling salesman problem. Proceedings of ML-95, twelfth international conference on machine learning (1995), Morgan Kaufman, Palo Alto, CA 252-260
21. Stützle T, Hoos HH. The MAX-MIN ant system and local search for the travelling salesman problem. In: Baeck T, Michalewicz Z, Yao X, editors. Proceedings of ICEC '97 (international conference on evolutionary computation), 1997. p. 309-14.
22. Stützle T., and Hoos H.H. MAX-MIN ant system. Future Generation Computer Systems 16 (2000) 889-914
23. Gutjahr WJ. Theory of ant colony optimization: status and perspectives. MIC'05 (sixth metaheuristics international conference). Proceedings of CD-ROM, 2005.
24. Neumann F, Witt C. Runtime analysis of a simple ant colony optimization algorithm. Technical Report CI-200/06, Department of Computer Science, University of Dortmund, Germany; 2006.
25. Norman F. Markov processes and learning models (1972), Academic Press, New York, London
26. Bullnheimer B., Hartl R.F., and Strauss C. A new rank-based version of the ant system: a computational study. Central European Journal for Operations Research 7 (1999) 25-38
27. Dorigo M., and Gambardella L.M. Ant colony system: a cooperative approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation 1 (1997) 53-66