Scribd
Upload
6 views5 pages

Branch & Bound - TSP

DAA4

Uploaded by

nhce.chempa2023
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 views5 pages

Branch & Bound - TSP

DAA4

Uploaded by

nhce.chempa2023
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/ 5

Branch & Bound - TSP

• We will be able to apply the branch-and-bound technique to


instances of the TSP if we come up with a reasonable lower
bound on tour lengths.
• One very simple lower bound can be obtained by finding the
smallest element in the intercity distance matrix D and
multiplying it by the number of cities n.
• But there is a less obvious and more informative lower bound
for instances with symmetric matrix D
• For each city i, 1≤ i ≤ n,
– Find si – sum of the distances from city i to the 2 nearest
cities;
– compute s, the sum of si i=1..n, divide the result
by 2
1
Branch & Bound – TSP - Example

2
Branch & Bound - TSP
To reduce the amount of potential work, we take
advantage of two observations.
1. First, without loss of generality, we can consider only
tours that start at a.
2. Second, because our graph is undirected, we can
generate only tours in which b is visited before c.
(Why?)

3
TSP
3. In addition, after visiting n−1= 4 cities, a tour has
no choice but to visit the remaining unvisited city
and return to the starting one
• The state-space tree tracing the
algorithm’s application is given in Figure

4
54

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy