Graph-based Ant System and its convergence

Future Generation Computer Systems

Volumn 16, Issue 8, 2000, Pages 873-888

  Gutjahr, Walter J ^a  

^a UNIVERSITY OF VIENNA   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; GRAPH THEORY; HEURISTIC METHODS; ITERATIVE METHODS; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES;

ANT SYSTEMS;

OPTIMIZATION;

EID: 0033738317     PISSN: 0167739X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-739X(00)00044-3     Document Type: Article

References (19)

1. E. Aarts, J. Korst, Simulated Annealing and Boltzmann Machines, Wiley, New York, 1989.
2. B. Bullnheimer, R.F. Hartl, C. Strauss, A new rank-based version of the Ant System: a computational study, Cent. Eur J. Oper. Res. Econom. 7 (1999) 25-38.
3. B. Bullnheimer, G. Kotsis, C. Strauss, 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, Kluwer Academic Publishers, Dordrecht, 1998, pp. 87-100.
4. M. Dorigo, Optimization, learning and natural algorithms, Ph.D. Thesis, Department of Electronics, Politecnico di Milano, Italy, 1992.
5. M. Dorigo, G. Di Caro, L.M. Gambardella, Ant algorithms for distributed discrete optimization, Artif. Life 5 (2) (1999) 137-172.
6. M. Dorigo, G. Di Caro, The ant colony optimization meta-heuristic, in: D. Corne, M. Dorigo, F. Glover (Eds.), New Ideas in Optimization, McGraw-Hill, London, UK, 1999, pp. 11-32.
7. M. Dorigo, L.M. Gambardella, Ant Colony System: a cooperative learning approach to the traveling salesman problem, IEEE Trans. Evolutionary Comput. 1 (1997) 53-66.
8. M. Dorigo, V. Maniezzo, A. Colorni, The Ant System: an autocatalytic optimization process, Technical Report 91-016, Department of Electronics, Politecnico di Milano, Italy, 1991.
9. M. Dorigo, V. Maniezzo, A. Colorni, The Ant System: optimization by a colony of cooperating agents, IEEE Trans. Systems Man Cybernet. 26 (1996) 29-41.
10. Th.A. Feo, M.G.C. Resende, Greedy randomized adaptive search procedures, J. Global Optimization 6 (1995) 109-133.
11. R.G. Gallager, Discrete Stochastic Processes, Kluwer Academic Publishers, Dordrecht, 1996.
12. F. Glover, Tabu Search, Part I, ORSA J. Comput. 1 (1989) 190-206.
13. L.M. Gambardella, M. Dorigo, Ant-Q: a reinforcement learning approach to the traveling salesman problem, in: Proceedings of the 12th International Conference on Machine Learning, ML'95, Morgan Kaufmann, Palo Alto, CA, 1995, pp. 252-260.
14. L.M. Gambardella, M. Dorigo, Solving symmetric and asymmetric TSPs by ant colonies, in: Proceedings of the IEEE Conference on Evolutionary Computing, ICEC'96, IEEE Press, New York, 1996, pp. 622-627.
15. W.J. Gutjahr, A generalized convergence result for the Graph-based Ant System metaheuristic, Technical Report 99-09, Department of Statistics, Operation Research and Computer Science, University of Vienna, Austria, 1999.
16. J.H. Holland, Adaption in Natural and Artificial Systems, University of Michigan Press, Michigan, 1975.
17. V. Maniezzo, A. Colorni, M. Dorigo, The Ant System applied to the quadratic assignment problem, Technical Report IRIDIA/94-28, Université Libre de Bruxelles, Belgium, 1994.
18. Z. Michalewicz, Genetic Algorithms+Data Structures=Evolution Programs, Springer, Berlin, 1992.
19. Ch.H. Papadimitriou, K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice- Hall, Englewood Cliffs, NJ, 1982.