Scribd
Upload
57 views28 pages

Lab Week 7 PT4008 Christofides Algorithm, Branch and Bound: Presented By: Davoud Hosseinnezhad

The document discusses the Christofides algorithm and branch and bound algorithm for solving the travelling salesman problem. It provides step-by-step examples of applying the Christofides algorithm to find an approximate solution. It also demonstrates applying branch and bound to find the optimal solution, including calculating the lower bound, branching on nodes, and pruning branches that exceed the lower bound. Finally, it explains how branch and bound can be applied to the vehicle routing problem with backhauls by solving the linear programming relaxation and branching on variables.

Uploaded by

Kaneki Ken
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
57 views28 pages

Lab Week 7 PT4008 Christofides Algorithm, Branch and Bound: Presented By: Davoud Hosseinnezhad

The document discusses the Christofides algorithm and branch and bound algorithm for solving the travelling salesman problem. It provides step-by-step examples of applying the Christofides algorithm to find an approximate solution. It also demonstrates applying branch and bound to find the optimal solution, including calculating the lower bound, branching on nodes, and pruning branches that exceed the lower bound. Finally, it explains how branch and bound can be applied to the vehicle routing problem with backhauls by solving the linear programming relaxation and branching on variables.

Uploaded by

Kaneki Ken
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/ 28

Lab Week 7 PT4008

Christofides Algorithm, Branch and Bound

Presented By: Davoud Hosseinnezhad


Email: Davoud.Hosseinnezhad@ul.ie
Q 1: Christofides Algorithm for Travelling Salesman Problem:
 The Christofides algorithm is an algorithm for finding approximate solutions to the travelling salesman
problem, where the distances form a metric space
Q 1: Christofides Algorithm for Travelling Salesman Problem:
 The Christofides algorithm is an algorithm for finding approximate solutions to the travelling salesman
problem, where the distances form a metric space.
 The Travelling Salesman Problem (TSP) is the challenge of finding the shortest yet most efficient route for a
person to take given a list of specific destinations:
■ Find a minimum spanning tree T for (G, c).
■ M ← min cost perfect matching of odd degree nodes in T
■ G’ ← union of spanning tree and matching edges.
■ E ← Eulerian tour in G’.
■ H ← short-cut version of Eulerian tour in E
Q 1: Christofides Algorithm for Travelling Salesman Problem:
Step 1: Calculate the minimum spanning tree of the following graph. The distance between two
vertical or horizontal lines is 1 m.
Q 1: Christofides Algorithm for Travelling Salesman Problem:
Step 2: M ← min cost perfect matching of odd degree nodes in T:
We see that B,C,H,F, E, and G are odd degree nodes. By matching those nodes by using matching lines that
minimize distances between two odd degree nodes, we have:
Q 1: Christofides Algorithm for Travelling Salesman Problem:
Step 3: G’ ← union of spanning tree and matching edges.
Q 1: Christofides Algorithm for Travelling Salesman Problem:
Step 4: E ← Eulerian tour in G’.
Q 1: Christofides Algorithm for Travelling Salesman Problem:
Step 5: H ← short-cut version of Eulerian tour in E.

 The tour was A-B-C-B-H-F-E-G-E-D-A   In Hamiltonian Tour, each node must have even degree.
 The tour is A-B-C-H-F-E-G-D-A
 with length of (4+) = 15.54.
Q 2: Branch and Bound Algorithm: Find an optimum solution (minimum distance) using Branch and bound.
Q 2: Branch and Bound Algorithm: Find an optimum solution (minimum distance) using Branch and bound.

 Branch and bound is an algorithm design paradigm for discrete

and combinatorial optimization problems, as well as

mathematical optimization.
Q 2: Branch and Bound Algorithm: Find an optimum solution (minimum distance) using Branch and bound.
Step 1: First we find the problem lower bound according to nearest neighbour algorithm:

Total Minimum Distance =Sum of Row Minima = 7 + 5 + 8 + 5 + 6 = 31


Lower Bound =31
That a person should surely travel. Our cost of optimal solution should be surely greater than or equal to 31.
Q 2: Branch and Bound Algorithm: Find an optimum solution (minimum distance) using Branch and bound.
Step 2: Branch and Bound step:
Q 2: Branch and Bound Algorithm: Find an optimum solution (minimum distance) using Branch and bound.
Step 2: Branch and Bound step:
Q 2: Branch and Bound Algorithm: Find an optimum solution (minimum distance) using Branch and bound.
Step 2: The next branch calculation:

  For = 8 + 5 + 6 +6+ 5 = 32
Q 2: Branch and Bound Algorithm: Find an optimum solution (minimum distance) using Branch and bound.
Step 2: The next branch calculation:

  For = 9 + 6 + 8 + 5 +6 = 34
 
Q 2: Branch and Bound Algorithm: Find an optimum solution (minimum distance) using Branch and bound.
Step 2: The next node is :

  For = 7+5+8+5+6=31
Q 2: Branch and Bound Algorithm: Find an optimum solution (minimum distance) using Branch and bound.
Step 3: Next we further branch from Node 5 as follows:
Q 2: Branch and Bound Algorithm: Find an optimum solution (minimum distance) using Branch and bound.
Step 3: Next we further branch from Node 5 as follows:
Q 2: Branch and Bound Algorithm: Find an optimum solution (minimum distance) using Branch and bound.
Step 3: The next branch:
Q 2: Branch and Bound Algorithm: Find an optimum solution (minimum distance) using Branch and bound.
Step 3: The next branch:
Q 2: Branch and Bound Algorithm: Find an optimum solution (minimum distance) using Branch and bound.
Q 2: Branch and Bound Algorithm: Find an optimum solution (minimum distance) using Branch and bound.
Q 2: Branch and Bound Algorithm: Find an optimum solution (minimum distance) using Branch and bound.
Q 3: Branch and Bound (VRPB): Explain how to apply branch and bound algorithm in vehicle routing problem
with backhauls (VRPB).
The Vehicle Routing Problem with Backhauls is a pickup/delivery problem where on each route all deliveries
must be made before any pickups. A two-phased solution methodology is proposed. In the first phase, a high
quality initial feasible solution is generated based on space filling curves.
Q 3: Branch and Bound (VRPB):
Suppose we have the following problem formulation of VRPB.
Q 3: Branch and Bound (VRPB):
Use Excel solver to find LP relaxation of the problem as follows:
Q 3: Branch and Bound (VRPB):
By changing the last equation of integrality constraints ({0,1}) to (<= 1) we will be able to find LP relaxation of
the problem and step by step, re-introducing integrality constraint for each variables.
Q 3: Branch and Bound (VRPB):
For Example: Make two branches for x23, x23 >=1, and x23<=0, by adding two constraints. Then we have the
following:

X23<=0 X23>=1

Using the same procedure, we continue the computation until all variables are either zero or one.

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