Loading...
Please wait, while we are loading the content...
Survey of Methods of Solving TSP along with its Implementation using Dynamic Programming Approach
| Content Provider | Semantic Scholar |
|---|---|
| Author | Chauhan, Chetan Gupta, Ravindra Pathak, Kshitij |
| Copyright Year | 2012 |
| Abstract | The Traveling salesperson problem is one of the problem in mathematics and computer science which haddrown attention as it is easy to understand and difficult to solve. In this paper, we survey the various methods/techniques available to solve traveling salesman problem and analyze it to make critical evaluation of their time complexities. An implementation of the traveling salesman problem using dynamic programming is also presented in this paper which generates optimal answer and tested with 25 cities and it executes in reasonable time. |
| Starting Page | 12 |
| Ending Page | 19 |
| Page Count | 8 |
| File Format | PDF HTM / HTML |
| DOI | 10.5120/8189-1550 |
| Volume Number | 52 |
| Alternate Webpage(s) | http://research.ijcaonline.org/volume52/number4/pxc3881550.pdf |
| Alternate Webpage(s) | https://doi.org/10.5120/8189-1550 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |