Question

solve following travelling salesman problem using branch and bound and show matrix and graph at each step

5 locations : a, b, c, d, e

from a to remaining places = [infinity, 4, 7, 3, 4]

from b to remaining places = [4, infinity, 6, 3, 4]

from c to remaining = [7, 6, infinity, 7, 5]

from d to remaining = [3, 3, 7, infinty, 7]

from e to remaining = [4, 4, 5, 7, infinity]

PLEASE show ALL steps in detail and give final path returning to starting position and also give cost....

using branch and bound

Answer 1

Hello, I've solved the problem using least cost branch and bound method. Please fine the step-by-step solution to the problem.

P.S: The number written in red ink - top right corner denotes the sequence of images