A bakery makes daily deliveries to four stores from a central kitchen. The distances between the...

  

Transcribed Image Text:

A bakery makes daily deliveries to four stores from a central kitchen. The distances between the facilities are given below. Fill in the net savings matrix and solve the traveling salesman problem using the Clarke-Wright Algorithm. What are the total miles of the route? Show each step of the algorithm. Distance Matrix Kitchen St-1 St-2 St-3 St- 1 St- 2 St-1 St-2 St-3 8 15 8 12 9 0 6 Net Saving Matrix (S = Col + Coj - Cij) St- 3 St-2 0 0 St-3 St-4 7 13 8 6 0 St-4 Nodes Joined Savings . Route Instruction: . For "Nodes Joined" column enter values using this format: smaller store number-larger store number, example: 1-4 For "Route" column enter values using this format (lowercase k): Example of a route with 2 nodes: k-1-4-k o Example of a route with four nodes: k-2-4-3-1-k • For routes with unacceptable joints put: X A bakery makes daily deliveries to four stores from a central kitchen. The distances between the facilities are given below. Fill in the net savings matrix and solve the traveling salesman problem using the Clarke-Wright Algorithm. What are the total miles of the route? Show each step of the algorithm. Distance Matrix Kitchen St-1 St-2 St-3 St- 1 St- 2 St-1 St-2 St-3 8 15 8 12 9 0 6 Net Saving Matrix (S = Col + Coj - Cij) St- 3 St-2 0 0 St-3 St-4 7 13 8 6 0 St-4 Nodes Joined Savings . Route Instruction: . For "Nodes Joined" column enter values using this format: smaller store number-larger store number, example: 1-4 For "Route" column enter values using this format (lowercase k): Example of a route with 2 nodes: k-1-4-k o Example of a route with four nodes: k-2-4-3-1-k • For routes with unacceptable joints put: X

Answer rating: 100% (QA)

Nodes Joined Savings Route 12 6 k12k 23 6 k23k 34 8 k34k 14 12 k14k Total Miles of the Route 24 The ClarkeWright Algorithm is an algorithm used to sol... View the full answer