Abstract
The traveling salesperson problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding the solution of an input with a large number of cities, the problem is approximated into a simpler form containing smaller number of cities, which is then solved optimally. Graph pyramid solution strategies, in a bottom-up manner using Borůvka’s minimum spanning tree, convert a 2D Euclidean TSP problem with a large number of cities into successively smaller problems (graphs) with similar layout and solution, until the number of cities is small enough to seek the optimal solution. Expanding this tour solution in a top-down manner to the lower levels of the pyramid approximates the solution. The new model has an adaptive spatial structure and it simulates visual acuity and visual attention. The model solves the TSP problem sequentially, by moving attention from city to city with the same quality as humans. Graph pyramid data structures and processing strategies are a plausible model for finding near-optimal solutions for computationally hard pattern recognition problems.
Supported by the Austrian Science Fund under grants P18716-N13 and S9103-N04, and the USA Air Force Office of Scientific Research.
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
Johnson, D.S., McGeoch, L.A.: Local Search in Combinatorial Optimization. In: Aarts, E.H.L., Lenstra, J.K. (eds.) The Traveling Salesman Problem: A Case Study in Local Optimization, pp. 215–310. John Wiley and Sons, Chichester (1997)
Christofides, N.: Graph Theory - An Algorithmic Approach, New York, London. Academic Press, San Francisco (1975)
Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: The Traveling Salesman Problem. Wiley, New York (1985)
Gutin, G., Punnen, A.P.: The traveling salesman problem and its variations. Kluwer, Dordrecht (2002)
Graham, S.M., Joshi, A., Pizlo, Z.: The travelling salesman problem: A hierarchical model. Memory and Cognition 28, 1191–1204 (2000)
MacGregor, J.N., Ormerod, T.C., Chronicle, E.P.: A model of human performance on the traveling salesperson problem. Memory and Cognition 28, 1183–1190 (2000)
Pizlo, Z., Li, Z.: Pyramid algorithms as models of human cognition. In: Proceedings of SPIE-IS&T Electronic Imaging, Computational Imaging. In: SPIE, pp. 1–12 ( 2003)
Jolion, J.M., Rosenfeld, A.: A Pyramid Framework for Early Vision. Kluwer, Dordrecht (1994)
Pizlo, Z., Joshi, A., Graham, S.M.: Problem solving in human beings and computers. Technical Report CSD TR 94-075, Department of Computer Sciences, Purdue University (1994)
Arora, S.: Polynomial-time approximation schemes for euclidean tsp and other geometric problems. Journal of the Association for Computing Machinery 45, 753–782 (1998)
Bister, M., Cornelis, J., Rosenfeld, A.: A critical view of pyramid segmentation algorithms. Pattern Recognition Letters 11, 605–617 (1990)
Montanvert, A., Meer, P., Rosenfeld, A.: Hierarchical image analysis using irregular tesselations. IEEE Transactions on Pattern Analysis and Machine Intelligence 13, 307–316 (1991)
Jolion, J.M., Montanvert, A.: The adaptive pyramid, a framework for 2D image analysis. Computer Vision, Graphics, and Image Processing: Image Understanding 55, 339–348 (1992)
Pizlo, Z., Stefanov, E., Saalweachter, J., Li, Z., Haxhimusa, Y., Kropatsch, W.G.: Traveling salesman problem: a foveating model. Journal of Problem Solving 1, 83–101 (2006)
Watt, R.J.: Scanning from coarse to fine spatial scales in the human visual system after the onset of a stimulus. Journal of the Optical Society of America 4, 2006–2021 (1987)
Pizlo, Z., Rosenfeld, A., Epelboim, J.: An exponential pyramid model of the time-course of size processing. Vision Research 35, 1089–1107 (1995)
Duda, R.O., Hart, P.E., Stork, D.G.: Pattern Classification. John Wiley & Sons, Chichester (2001)
Neštřil, J., Miklovà, E., Neštřilova, H.: Otakar Boro̊vka on minimal spanning tree problem translation of both the 1926 papers, comments, history. Discrete Mathematics 233, 3–36 (2001)
Atallah, M.J. (ed.): Algorithms and Theory of Computational Handbook. CRC Press, Boca Raton (1999)
Prim, R.C.: Shortest connection networks and some generalizations. The. Bell. System Technical Journal 36, 1389–1401 (1957)
Kropatsch, W.G., Haxhimusa, Y., Pizlo, Z., Langs, G.: Vision pyramids that do not grow too high. Pattern Recognition Letters 26, 319–337 (2005)
Papadimitiou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Dover Publication, Mineola (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Haxhimusa, Y., Kropatsch, W.G., Pizlo, Z., Ion, A., Lehrbaum, A. (2007). Approximating TSP Solution by MST Based Graph Pyramid . In: Escolano, F., Vento, M. (eds) Graph-Based Representations in Pattern Recognition. GbRPR 2007. Lecture Notes in Computer Science, vol 4538. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72903-7_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-72903-7_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72902-0
Online ISBN: 978-3-540-72903-7
eBook Packages: Computer ScienceComputer Science (R0)