Shortest Path problem 1 - Derive the shortest path from node 44 to node 2.
Shortest Path problem 2 - Coordinates of the Nodes are provided below. Based on these coordinates, compute the rectilinear distance between the nodes. If you do not know rectilinear distance, check with google.
Vehicle Routing Problem 3 - Based on the provided coordinates, compute the rectilinear distance between the nodes. All nodes have to be served in one day by several trucks.
Find optimal routing for the trucks with the least total distance, by applying any of the methods presented in the class.
Attachment:- Assignment.rar