Loading...
Please wait, while we are loading the content...
Similar Documents
Implementation of Heuristics for Solving Travelling Salesman Problem Using Nearest Neighbour and Minimum Spanning Tree Algorithms
| Content Provider | Semantic Scholar |
|---|---|
| Author | Karkory, Fatma A. Abudalmola, Ali A. |
| Copyright Year | 2013 |
| Abstract | The travelling salesman problem (TSP) is a combinatorial optimization problem in which the goal is to find the shortest path between different cities that the salesman takes. In other words, the problem deals with finding a route covering all cities so that total distance and execution time is minimized. This paper adopts the nearest neighbor and minimum spanning tree algorithm to solve the well-known travelling salesman problem. The algorithms were implemented using java programming language. The approach is tested on three graphs that making a TSP tour instance of 5-city, 10 – city, and 229–city. The computation results validate the performance of the proposed algorithm. Keywords—Heuristics, minimum spanning tree algorithm, Nearest Neighbor, Travelling Salesman Problem (TSP). |
| Starting Page | 1524 |
| Ending Page | 1534 |
| Page Count | 11 |
| File Format | PDF HTM / HTML |
| Volume Number | 7 |
| Alternate Webpage(s) | http://waset.org/publications/17101/implementation-of-heuristics-for-solving-travelling-salesman-problem-using-nearest-neighbour-and-minimum-spanning-tree-algorithms |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
