International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 65 - Number 5 |
Year of Publication: 2013 |
Authors: Archit Rastogi, Ankur Kumar Shrivastava, Nitisha Payal, Ramander Singh |
10.5120/10924-5866 |
Archit Rastogi, Ankur Kumar Shrivastava, Nitisha Payal, Ramander Singh . A Proposed Solution to Travelling Salesman Problem using Branch and Bound. International Journal of Computer Applications. 65, 5 ( March 2013), 44-49. DOI=10.5120/10924-5866
Travelling salesperson problem is a well-known problem. In this problem the minimum cost tour of few cities is needed, which are connected. The cost of different paths is given. The tour should be started from a given node and after completing the tour the travelling salesman has to return to the starting node. The earlier method is given by Greedy programming. In this paper Branch & Bound method is used to solve this problem.