Hierarchical Approach in Clustering to Euclidean Traveling Salesman Problem

  • Abdulah Fajar
  • Nanna Suryana Herman
  • Nur Azman Abu
  • Sahrin Shahib
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 143)


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.


Hierarchical Approach Clustering Dendogram Tour Construction Euclidean TSP 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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. 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
  3. 3.
    Graham, S.M., Joshi, A., Pizlo, Z.: The Traveling Salesman Problem: a Hierarchical Model. Journal of Memory and Cognition 28(7), 1191–1204 (2000)CrossRefGoogle Scholar
  4. 4.
    Vickers, D., Butavicius, M., Lee, M., Medvedev, A.: Human Performance on Visually Presented Traveling Salesman problems. Journal of Psychological Research 65, 34–45 (2001)CrossRefGoogle Scholar
  5. 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. 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. 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
  8. 8.
    Guha, S.: ROCK: A Robust Clustering Algorithm for Categorical Attributes. Journal of Information System 25(5), 345–366 (2000)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Reinelt, G.: TSPLIB–A Traveling Salesman Problem Library. Informs Journal on Computing 3, 376–384 (1991)CrossRefzbMATHGoogle Scholar
  10. 10.
    Golden, B., Bodin, L., Doyle, T., Stewart, W.: Approximate travelling salesman algorithms. Operations Research 28, 694–711 (1980)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Abdulah Fajar
    • 1
    • 2
  • Nanna Suryana Herman
    • 2
  • Nur Azman Abu
    • 2
  • Sahrin Shahib
    • 2
  1. 1.Faculty of EngineeringUniversitas WidyatamaBandungIndonesia
  2. 2.Faculty of Information and Communication TechnologyUniversiti Teknikal MalaysiaDurian Tunggal MelakaMalaysia

Personalised recommendations