Question: Prob. 2 There is one depot ( 0 ) and 6 customers with the distances between them as below table. We know that the shortest
Prob. There is one depot and customers with the distances between them as below table.
We know that the shortest path to visit all customers at one time is by solving the TSP
When the demand of each customer is ton and the capacity of the truck is find the best route for
the truck by using the optimal partitioning method.
Cost Matrix
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
