Please solve the highlighted problem and show work. 2. Clients who demand servic
ID: 333857 • Letter: P
Question
Please solve the highlighted problem and show work.
2. Clients who demand service are located in nodes 2 to 6. The depot is located in node 1. The distances between all pairs of nodes are given in the following table 12 3 4 56 I21 13 17 25 9 221-14 19 21 27 3 13 14- 8 18 20 417 19 829 17 5 25 21 18 2915 6 9 27 20 17 15_ All vehicles that participate in the service have the same capacity. The vehicle capacity equals V-15 Th e quantities of goods per node are: Node i Demand v Using Clarke-Wright's savings algorithms, generate the set of vehicle routes. 3. Solve the Traveling Salesman Problem for the case given in Problem 2. Use Clarke-Wright's algorithm. 4. Solve the Traveling Salesman Problem for the case given in Problem 2. Use the Nearest Neighbor algorithm.Explanation / Answer
So we have to develop a model for the same.
How it works is we need to see which is the nearest stage from node 1 , which in this case comes out to be 6 with a distance of 9 .so
It looks like this an arrow mark from 1 to 6 with 9 written on top which indicated the distance.
After reaching 6 it will look at nearest position from 6 apart from 1 which is 5 .So we will draw a n arow conecting 6 to 5 and so onThe final solution looks like the following