Abstract
In this paper the influence of structural information obtained from a problem relaxation on the performance of an ACO algorithm for the symmetric TSP is studied. More precisely, a very simple ACO algorithm is guided by including Minimal Spanning Tree information into the visibility. Empirical results on a large number of benchmark instances from TSPLIB are presented. The paper concludes with remarks on some more elaborate ideas for using problem relaxation within ACO.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Blum, C., Dorigo, M.: The Hyper-Cube framework for ant colony optimization. IEEE Transactions on Systems, Man and Cybernetics B 34(2), 1161–1772 (2004)
Colorni, A., Dorigo, M., Maniezzo, V.: Distributed Optimization by Ant Colonies. In: Varela, F., Bourgine, P. (eds.) Proc. Europ. Conf. Artificial Life, Elsevier, Amsterdam (1991)
Croes, G.A.: A method for solving Traveling Salesman Problems. Operations Research 6, 791–801 (1958)
Dorigo, M., Gambardella, L.M.: Ant Colony System: A cooperative learning approach to the Travelling Salesman Problem. IEEE Transactions on Evolutionary Computation 1(1), 53–66 (1997)
Dorigo, M., Stuetzle, T.: Ant Colony Optimization. MIT Press/Bradford Books, Cambridge, MA (2004)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP Completeness. W. H. Freeman & Co., New York (1979)
Gendreau, M., Hertz, A., Laporte, G.: New insertion and postoptimization procedures for the travelling salesman problem. Operations Research 40, 1086–1094 (1992)
Gutjahr, W.J.: A graph-based Ant System and its convergence. Future Generation Computing Systems 16, 873–888 (2000)
Gutjahr, W.J.: ACO algorithms with guaranteed convergence to the optimal solution. Information Processing Letters 82, 145–153 (2002)
Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society 7, 48–50 (1956)
Lawler, E.L., Lenstra, J.K., Kan, A.H.G.R., Schmoys, D.B. (eds.): The Traveling Salesman Problem. Wiley, Chichester (1985)
Le Louarn, F.-X., Gendreau, M., Potvin, J.-Y.: GENI Ants for the travelling salesman problem. Annals of Operations Research 131, 187–201 (2004)
Maniezzo, V.: Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem. INFORMS Journal on Computing 11(4), 358–369 (1999)
Stuetzle, T., Dorigo, M.: A short convergence proof for a class of ACO algorithms. IEEE Transactions on Evolutionary Computation 6(4), 358–365 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Reimann, M. (2007). Guiding ACO by Problem Relaxation: A Case Study on the Symmetric TSP. In: Bartz-Beielstein, T., et al. Hybrid Metaheuristics. HM 2007. Lecture Notes in Computer Science, vol 4771. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75514-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-75514-2_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75513-5
Online ISBN: 978-3-540-75514-2
eBook Packages: Computer ScienceComputer Science (R0)