Domino’s Pizza delivery driver has four customer orders to d…
Domino’s Pizza delivery driver has four customer orders to deliver. The distances between Domino’s Pizza and all other destinations are given below. Fill in the net savings matrix and solve the traveling salesman problem using the Clarke-Wright Algorithm. Show each step of the algorithm. Instruction: For “Nodes Joined” column enter values using this format: smaller customer number-larger customer number, example: 1-4 For “Route” column enter values using this format: Example of a route with 2 nodes: D-1-4-D Example of a route with four nodes: D-2-4-3-1-D For routes with unacceptable joints put: X H-2 H-3 H-4 H-1 [1] [2] [3] H-2 0 [4] [5] H-3 – 0 [6] Nodes Joined Savings Route [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24] What are the total miles of the route? [25]
Read Details