Scribd
Upload
26 views

5.10 - Assignment Problem

Uploaded by

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

5.10 - Assignment Problem

Uploaded by

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

Branch and Bound is another method to systematically search a solution space.

Just like
backtracking, we will use bounding functions to avoid generating subtrees that do not contain
an answer node.

Branch and Bound differs from backtracking in two important points:

∙ It has a branching function, which can be a depth first search, breadth first search or
based on bounding function.

∙ It has a bounding function, which goes far beyond the feasibility test as a mean to
prune efficiently the search tree.

Branch and Bound refers to all state space search methods in which all children of the E-node
are generated before any other live node becomes the E-node.

∙ Live node is a node that has been generated but whose children have not yet been
generated.

∙ E-node is a live node whose children are currently being explored. In other words, an
E-node is a node currently being expanded.

∙ Dead node is a generated node that is not to be expanded or explored any further.
All children of a dead node have already been expanded.

∙ Branch-an-bound refers to all state space search methods in which all children of an
E-node are generated before any other live node can become the E-node.

Assignment Problem
Assigning n people to n jobs so that the total cost of the assignment is as small as possible.
Select one element in each row of the matrix so that no two selected elements are in the same
column and their sum is the smallest possible.

Let there be N workers and N jobs. Any worker can be assigned to perform any job, incurring
some cost that may vary depending on the job assignment. It is required to perform all jobs
by assigning exactly one worker to each job and exactly one job to each agent in such a way
that the total cost of the assignment is minimized.

Lb= the sum of the smallest elements in each of the matrix’s rows.
10
For the instance here, this sum is 2 + 3 + 1 + 4 = 10.
The lower-bound value for the root, denoted lb, is 10. The nodes on the first level of the tree
correspond to selections of an element in the first row of the matrix, i.e., a job for person a

The most promising of them is node 2 because it has the smallest lower bound value.We
branch out from that node first by considering the three different ways of selecting an
element from the second row and not in the second column the three different jobs that can be
assigned to person b.

11
Traveling Sale Person Problem:
Example: Find the LC branch and bound solution for the traveling sale person problem whose cost
matrix is as follows

∞ 20 30 10 11
15 ∞ 16 4 2
35∞24
19 6 18 ∞ 3
16 4 7 16 ∞

Step 1: Find the reduced cost matrix.

Apply row reduction method:


Deduct 10 (which is the minimum) from all values in the 1st row.

Deduct 2 (which is the minimum) from all values in the 2nd row.
12

You might also like