CLUSTERING PROCESS TO SOLVE EUCLIDEAN TSP
dc.contributor.author | Fajar, Abdullah | |
dc.contributor.author | Abu, Nur Azman | |
dc.contributor.author | Herman, Nanna Suryana | |
dc.date.accessioned | 2011-04-02T01:45:56Z | |
dc.date.accessioned | 2019-10-21T11:45:54Z | |
dc.date.available | 2011-04-02T01:45:56Z | |
dc.date.available | 2019-10-21T11:45:54Z | |
dc.date.issued | 2010-07-10 | |
dc.description.abstract | Human is able to cluster and filter object efficiently. Clustering problem has been approached from diverse domains of knowledge like graph theory, statistics, artificial neural network and so on. There has been growing interest in studying combinatorial optimization problems by clustering approach, with a special emphasis on the Euclidean Traveling Salesman Problem. Classical ETSP appears as a fundamental problem in various problem such as transportation, manufacturing and logistics application. This study will focus on tour construction. Most of methods focus on tour improvement and using nearest neighborhood for tour construction. This paper will use clustering process to decompose ETSP into smaller sub problem. Clustering process hierarchically arrange adjacency and vertices to form clusters. A threshold of edge weight is applied to split one clusters to several sub clusters. Using this approach the running time can be cut into half compared to TSPLib standard time. The main objective is to develop best clustering process to ETSP and produce a near optimal solution within 10% of best known solution in TSPLib. | en_US |
dc.identifier.issn | 978-1-4244-5539-3 | |
dc.identifier.uri | http://repository.widyatama.ac.id/handle/123456789/1393 | |
dc.language.iso | fr | en_US |
dc.publisher | IEEE PRESS | en_US |
dc.relation.ispartofseries | ;KII CD 037 | |
dc.subject | Hierarchical Clustering | en_US |
dc.subject | Euclidean TSP | en_US |
dc.subject | Tour Construction | en_US |
dc.subject | Adjacency | en_US |
dc.title | CLUSTERING PROCESS TO SOLVE EUCLIDEAN TSP | en_US |
dc.title.alternative | Proceedings 2010 3rd IEEE International Conference on Computer Science and information Technology | en_US |
dc.type | Other | en_US |