Abstract
There has been growing interest in studying combinatorial optimization problems by clustering strategy, with a special emphasis on the traveling salesman problem (TSP). TSP naturally arises as a sub problem in much transportation, manufacturing and logistics application, this problem has caught much attention of mathematicians and computer scientists. A clustering approach will decompose TSP into sub graph and form cluster, so it may reduce problem size into smaller problem. Impact of hierarchical approach will be investigated to produce a better clustering strategy that fit into Euclidean TSP. Clustering strategy to Euclidean TSP consist of two main step, there are; clustering and tour construction. The significant of this research is clustering approach solution result has error less than 10% compare to best known solution (TSPLIB) and there is improvement to a hierarchical clustering algorithm in order to fit in such Euclidean TSP solution method.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Haxhimusa, Y., Krospatch, W.G., Pizlo, Z., Ion, A.: Approximate Graph Pyramid Solution of the E-TSP. Image and Vision Computing Journal (2008)
Abu, N.A., Sahib, S., Suryana, N.: A Novel Natural Approach to Euclidean TSP. In: Proceeding of The 3rd International Conference on Mathematics & Statistics (ICoMS) (2008)
Graham, S.M., Joshi, A., Pizlo, Z.: The Traveling Salesman Problem: a Hierarchical Model. Journal of Memory and Cognition 28(7), 1191–1204 (2000)
Vickers, D., Butavicius, M., Lee, M., Medvedev, A.: Human Performance on Visually Presented Traveling Salesman problems. Journal of Psychological Research 65, 34–45 (2001)
Punnen, A.P.: The Traveling Salesman Problem: Application, Formulations and Variations. In: Putin, G., Punnen, A.P. (eds.) The Traveling Salesman Problem and Its Variations, p. 22. Springer, Heidelberg (2007)
Zhang, T., Ramakrishnan, R., Livny, M.: BIRCH: an efficient data clustering method for very large databases. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, Montreal, Canada (1996)
Guha, S., Rastogi, R., Shim, K.: CURE: An Efficient Clustering Algorithm for Large Databases. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, Seatle, WA (1998)
Guha, S.: ROCK: A Robust Clustering Algorithm for Categorical Attributes. Journal of Information System 25(5), 345–366 (2000)
Reinelt, G.: TSPLIB–A Traveling Salesman Problem Library. Informs Journal on Computing 3, 376–384 (1991)
Golden, B., Bodin, L., Doyle, T., Stewart, W.: Approximate travelling salesman algorithms. Operations Research 28, 694–711 (1980)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fajar, A., Herman, N.S., Abu, N.A., Shahib, S. (2011). Hierarchical Approach in Clustering to Euclidean Traveling Salesman Problem. In: Shen, G., Huang, X. (eds) Advanced Research on Electronic Commerce, Web Application, and Communication. ECWAC 2011. Communications in Computer and Information Science, vol 143. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20367-1_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-20367-1_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20366-4
Online ISBN: 978-3-642-20367-1
eBook Packages: Computer ScienceComputer Science (R0)