Scribd
Upload
6 views12 pages

Traveling Salesman Problem

Uploaded by

jagadishmec18
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
6 views12 pages

Traveling Salesman Problem

Uploaded by

jagadishmec18
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 12

TRAVELLING SALESMAN

PROBLEM
Travelling salesman problem

The Traveling Salesman Problem (TSP) is a classic


problem in computer science and optimization. It asks
the following question: given a list of cities and the
distances between each pair of cities, what is the
shortest possible route that visits each city exactly once
and returns to the original city.
Real-life examples of the Traveling Salesman
Problem include:

1.Delivery routes for logistics companies:


Optimizing the routes for delivery trucks to
minimize fuel consumption and time spent on the
road.

2.ALGORITHM:
Traveling Salesman Problem using Branch
And Bound

Given a set of cities and distance between every pair of


cities, the problem is to find the shortest possible tour
that visits every city exactly once and returns to the
starting point.
Note that the cost through a node includes two
costs.

1) Cost of reaching the node from the root (When


we reach a node, we have this cost computed)

2) Cost of reaching an answer from current node to


a leaf (We compute a bound on this cost to decide
whether to ignore subtree with this node or not).

You might also like