Hierarchical Approach in Clustering to Euclidean Traveling Salesman Problem
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...
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2011
|
| Subjects: | |
| Online Access: | http://eprints.utem.edu.my/id/eprint/339/ |
| _version_ | 1848886930483183616 |
|---|---|
| author | Fajar, A. Herman, N. S. Abu, N. A. Sahib, S. |
| author_facet | Fajar, A. Herman, N. S. Abu, N. A. Sahib, S. |
| author_sort | Fajar, A. |
| building | UTeM Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-15T19:46:19Z |
| format | Conference or Workshop Item |
| id | utem-339 |
| institution | Universiti Teknikal Malaysia Melaka |
| institution_category | Local University |
| last_indexed | 2025-11-15T19:46:19Z |
| publishDate | 2011 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | utem-3392012-01-03T01:06:18Z http://eprints.utem.edu.my/id/eprint/339/ Hierarchical Approach in Clustering to Euclidean Traveling Salesman Problem Fajar, A. Herman, N. S. Abu, N. A. Sahib, S. HE Transportation and Communications 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. 2011-04-16 Conference or Workshop Item PeerReviewed Fajar, A. and Herman, N. S. and Abu, N. A. and Sahib, S. (2011) Hierarchical Approach in Clustering to Euclidean Traveling Salesman Problem. In: International Conference on Advanced Research on Electronic Commerce, Web Application and Communication (ECWAC 2011), 16-17 April 2011, Guangzhou. |
| spellingShingle | HE Transportation and Communications Fajar, A. Herman, N. S. Abu, N. A. Sahib, S. Hierarchical Approach in Clustering to Euclidean Traveling Salesman Problem |
| title | Hierarchical Approach in Clustering to Euclidean Traveling Salesman Problem |
| title_full | Hierarchical Approach in Clustering to Euclidean Traveling Salesman Problem |
| title_fullStr | Hierarchical Approach in Clustering to Euclidean Traveling Salesman Problem |
| title_full_unstemmed | Hierarchical Approach in Clustering to Euclidean Traveling Salesman Problem |
| title_short | Hierarchical Approach in Clustering to Euclidean Traveling Salesman Problem |
| title_sort | hierarchical approach in clustering to euclidean traveling salesman problem |
| topic | HE Transportation and Communications |
| url | http://eprints.utem.edu.my/id/eprint/339/ |