Travelling sales person problem (TSPP) using branch and bound (BB)

TSPP can be solved by using BB, in the following way:

1. Obtain reduced matrix(R) for the given cost matrix.
2. Compute bound(b) for that reduced matrix.
3. Root (E-node=R) consists of all possible paths. Find the edge (i,j) for inclusion.
4. Left child can be obtained by including that particular edge in the solution set.
5. Right child can be obtained by excluding that particular edge from the solution set.
6. Reduce left and right childs and compute bounds.
7. The child with minimum bound becomes E-node for the next iteration.
8. Continue this until either left or right child becomes empty.
9. Then, solution can be obtained by backtracking from that empty child to root.

More explanations for important steps:

1. First, perform row reduction
{Row reduction means subtract every row with minimum element in that row. Row reduction
sum(rrs) can be obtained by adding all these minimum elements in each row.}
Then, for the resulting matrix, perform column reduction
{Column reduction means subtract every column with minimum element in that column. Column
reduction sum(crs) can be obtained by adding all these minimum elements in each column.}
The resulting matrix is called reduced matrix(R)
2. Bound b=rrs+crs
3. For every 0 in R[i,j], compute (i,j).
(i,j).=min in row i + min in col j { except 0 in R[i,j]}
Consider that edge(i,j) for which you get maximum (i,j) for inclusion.
4. If you include a particular edge(i,j) in the solution set, then,
-delete ith row and jth colunmn.
-put

in jth row and ith column

5. If you exclude a particular edge(i,j) in the solution set, then,
-put

in ith row and jth column.

7. Normally, in every step we will be considering only left child and hence only left child becomes
empty eventually.
9. Write down all edges while you backtrack and find path by connecting them.

Example: Find solution to TSPP using BB, for the following cost matrix.