(a) Using the Clark and Wright savings heuristic, construct a tour for the data given in the distance matrix in Table 1. Assume node 1 is the depot node.

(b) Provide an alternative solution to multi-vehicle routing problems with a basic solution algorithm using Industrial Engineering software such as Minitab, POM, excel solver, Python, etc.). Discuss the results between (a) and (b)

 

FROM NODE 1233 4 5 6 7 8 - 2.2 5.8 4.0 5.0 8.5 3.6 3.6 2.2 - 4.1 3.6 5.8 9.4 5.0 5.8 3 5.8 4.1 - 3.2 6.1 9.0 6.7 9.2 Table 1 DISTANCE TO NODE (IN MILES) 4 5 4.0 5.0 3.6 5.8 3.2 6.1 - 3.0 3.0 - 3.6 6.3 3.6 6.7 2.0 6.0 6 8.5 9.4 9.0 6.3 3.6 3.6 8.5 7 3.6 5.0 6.7 3.6 2.0 3.6 4.0 8 3.6 5.8 9.2 6.7 6.0 8.5 4.0 -