A Proposed Solution to Travelling Salesman Problem using Branch and Bound

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 st...

Full description

Saved in:
Bibliographic Details
Published in:International journal of computer applications 2013-01, Vol.65 (5)
Main Authors: Rastogi, Archit, Shrivastava, Ankur Kumar, Payal, Nitisha, Singh, Ramander, Sharma, Aditi
Format: Article
Language:English
Subjects:
Mathematical models
Minimum cost
Programming
Tours
Travelling salesperson problem
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0975-8887
0975-8887
DOI:10.5120/10924-5866