HIERARCHICAL APPROACH IN CLUSTERING TO EUCLIDEAN TRAVELING SALESMAN PROBLEM
dc.contributor.author | Fajar, Abdullah | |
dc.contributor.author | Herman, Nanna Suryana | |
dc.contributor.author | Abu, Nur Azman | |
dc.contributor.author | Shahib, Sahrin | |
dc.date.accessioned | 2013-07-25T01:39:15Z | |
dc.date.accessioned | 2019-10-21T11:54:08Z | |
dc.date.available | 2013-07-25T01:39:15Z | |
dc.date.available | 2019-10-21T11:54:08Z | |
dc.date.issued | 2013-07-25 | |
dc.description | - | en_US |
dc.description.abstract | There has been growing interest in studying combinatorial optimization problem 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 bi 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. | en_US |
dc.description.sponsorship | - | en_US |
dc.identifier.isbn | 978-3-642-20366-4 | |
dc.identifier.uri | http://repository.widyatama.ac.id/handle/123456789/2104 | |
dc.language.iso | en | en_US |
dc.publisher | Wuhan University of Science and Technology | |
dc.relation.ispartofseries | KII.HC.067; | |
dc.subject | Hierarchical Approach | en_US |
dc.subject | Clustering | en_US |
dc.subject | Dendogram | en_US |
dc.subject | Tour Construction Euclidean TSP | en_US |
dc.title | HIERARCHICAL APPROACH IN CLUSTERING TO EUCLIDEAN TRAVELING SALESMAN PROBLEM | en_US |
dc.type | Presentation | en_US |