Loading...
Please wait, while we are loading the content...
Similar Documents
A New Approach Based on K-means Clustering and Shuffled Frog Leaping Algorithm to Solve Travelling Salesman Problem
| Content Provider | Semantic Scholar |
|---|---|
| Author | Karakoyun, Murat |
| Copyright Year | 2019 |
| Abstract | The Travelling Salesman Problem (TSP), which is a combinatorial NP-hard problem, aims to find the shortest possible path while visiting all cities (only once) in a given list and returns to the starting point. In this paper, an approach, which is based on k-means clustering and Shuffled Frog Leaping Algorithm (SFLA), is used to solve the TSP. The proposed approach consists of three parts: separate the cities into k clusters, find the shortest path for each cluster and merge the clusters. Experimental results have shown that the algorithm get better results as the number of cluster increase for problems that have a large number of cities. |
| Starting Page | 446 |
| Ending Page | 453 |
| Page Count | 8 |
| File Format | PDF HTM / HTML |
| DOI | 10.33793/acperpro.02.03.31 |
| Volume Number | 2 |
| Alternate Webpage(s) | https://acperpro.com/papers/articles/ISITES2019ID31.pdf |
| Alternate Webpage(s) | https://doi.org/10.33793/acperpro.02.03.31 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
