Question: One moming the DC manager at Webvan has orders from 13 different customers that are to be delivered. They have four trucks, each truck is

One moming the DC manager at Webvan has orders

One moming the DC manager at Webvan has orders

One moming the DC manager at Webvan has orders

One moming the DC manager at Webvan has orders from 13 different customers that are to be delivered. They have four trucks, each truck is capable of carrying up to 200 units. Initially each customer is served exclusively by one truck The distance between the warehouse and between each pair of customers are given in Table below a) (2.5) Find the savings that can be obtained if two customers can be combined on the same truck route. Identify the Savings matrix b) (10) Prepare a matrix similar to the one that you have seen in your lecture notes such that the highest saving is at the bottom right hand side of the matrix. Use Clark and Wright Savings Algorithm to find the best vehicle routes as well as the number of trucks to be used. Cust1 DC Cust2 Cust4 Cust Cust Cust 6 Cust Cust7 Cust9 Cust 8 Cust 10 Cu 11 Cust 12 13 Cast 1 12 0 Cust2 $ 9 0 Cust 3 17 10 0 Cust4 15 9 $ 4 0 Cust5 15 17 9 14 11 Cust 6 20 23 15 20 16 6 0 Cust 17 22 13 20 16 5 4 0 Cust 8 17 00 9 19 16 11 14 0 10 Cust 9 6 18 12 22 20 17 20 16 6 0 16 23 14 19 22 9 0 8 4 8 Cust 10 14 21 28 26 18 22 11 7 5 6 13 19 0 Cust 11 11 22 21 14 14 24 16 13 12 0 $ 7 9 Cust 12 22 15 30 0 8 9 28 20 20 23 20 12 22 16 Cust 13 One moming the DC manager at Webvan has orders from 13 different customers that are to be delivered. They have four trucks, each truck is capable of carrying up to 200 units. Initially each customer is served exclusively by one truck The distance between the warehouse and between each pair of customers are given in Table below a) (2.5) Find the savings that can be obtained if two customers can be combined on the same truck route. Identify the Savings matrix b) (10) Prepare a matrix similar to the one that you have seen in your lecture notes such that the highest saving is at the bottom right hand side of the matrix. Use Clark and Wright Savings Algorithm to find the best vehicle routes as well as the number of trucks to be used. Cust1 DC Cust2 Cust4 Cust Cust Cust 6 Cust Cust7 Cust9 Cust 8 Cust 10 Cu 11 Cust 12 13 Cast 1 12 0 Cust2 $ 9 0 Cust 3 17 10 0 Cust4 15 9 $ 4 0 Cust5 15 17 9 14 11 Cust 6 20 23 15 20 16 6 0 Cust 17 22 13 20 16 5 4 0 Cust 8 17 00 9 19 16 11 14 0 10 Cust 9 6 18 12 22 20 17 20 16 6 0 16 23 14 19 22 9 0 8 4 8 Cust 10 14 21 28 26 18 22 11 7 5 6 13 19 0 Cust 11 11 22 21 14 14 24 16 13 12 0 $ 7 9 Cust 12 22 15 30 0 8 9 28 20 20 23 20 12 22 16 Cust 13

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!