A generalized convergence result for the graph-based ant system metaheuristic

Probability in the Engineering and Informational Sciences

Volumn 17, Issue 4, 2003, Pages 545-569

  Gutjahr, Walter J ^a  

^a UNIVERSITY OF VIENNA   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ANT COLONY OPTIMIZATION; OPTIMAL SYSTEMS;

ANT SYSTEMS; CONVERGENCE RESULTS; GRAPH-BASED; METAHEURISTIC; OPTIMAL SOLUTIONS; RESTRICTIVE CONDITIONS;

GRAPHIC METHODS;

EID: 1642573400     PISSN: 02699648     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0269964803174086     Document Type: Article

References (18)

1. Aarts, E. & Korst, J. (1989). Simulated annealing and Boltzmann machines. New York: Wiley.
2. Bullnheimer, B., Hartl, R.F., & Strauss, C. (1999). A new rank-based version of the ant system: A computational study. Central European Journal for Operations Research and Economics 7(1): 25-38.
3. Bullnheimer, B., Kotsis, G., & Strauss, C. (1998). Parallelization strategies for the ant system. In R. Leone, A. Murti, P. M. Pardalos, & G. Toralo (eds.), High performance algorithms and software in nonlinear optimization. Dordrecht: Kluwer Academic, pp. 87-100.
4. Dorigo, M. (1992). Optimization, learning and natural algorithms. Ph.D. thesis, Politecnico di Milano, Milan, Italy.
5. Dorigo, M. & Di Caro, G. (1999). The ant colony optimization meta-heuristic. In D. Corne, M. Dorigo, & F. Glover (eds.), New ideas in optimization. New York: MCGraw-Hill, pp. 11-32.
6. Dorigo, M., Di Caro, G., & Gambardella, L.M. (1999). Ant algorithms for discrete optimization. Artificial Life 5(2).
7. Dorigo, M., Maniezzo, V., & Colorni, A. (1991). The ant system: An autocatalytic optimization process. Technical Report 91-016, Politecnico di Milano, Milan, Italy.
8. Dorigo, M., Maniezzo, V., & Colorni, A. (1996). The ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics 26: 1-13.
9. Feo, Th.A. & Resende, M.G.C. (1995). Greedy randomized adaptive search procedures. Journal of Global Optimization 6: 109-133.
10. Gallager, R.G. (1996). Discrete stochastic processes. Dordrecht: Kluwer Academic.
11. Gambardella, L.M. & Dorigo, M. (1995). Ant-Q: A reinforcement learning approach to the traveling salesman problem. Proceedings of ML-95, Twelfth International Conference on Machine Learning, pp. 252-260.
12. Geman, D. & Geman, S. (1984). Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Proceedings on Pattern Analysis and Machine Intelligence 6: 721-741.
13. Gutjahr, W.J. (2000). A graph-based ant system and its convergence. Future Generation Computer Systems 16(8): 873-882.
14. Gutjahr, W.J. (2002). ACO algorithms with guaranteed convergence to the optimal solution. Information Processing Letters 82: 145-153.
15. Hajek, B. (1988). Cooling schedules for optimal anealing. Mathematics of Operations Research 13: 311-329.
16. Holland, J.H. (1975). Adaption in natural and artificial systems. Ann Arbor: University of Michigan Press.
17. Maniezzo, V. (1999). Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem. INFORMS 11(4): 358-369.
18. Michalewicz, Z. (1992). Genetic algorithms + data structures = evolution programs. New York: Springer.