Hierarchical Approach in Clustering to Euclidean Traveling Salesman Problem
- 1.7k Downloads
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.
KeywordsHierarchical Approach Clustering Dendogram Tour Construction Euclidean TSP
Unable to display preview. Download preview PDF.
- 1.Haxhimusa, Y., Krospatch, W.G., Pizlo, Z., Ion, A.: Approximate Graph Pyramid Solution of the E-TSP. Image and Vision Computing Journal (2008)Google Scholar
- 2.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)Google Scholar
- 5.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)Google Scholar
- 6.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)Google Scholar
- 7.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)Google Scholar