Q37: L.2a) The start solution is obtained by the nearest neighbor heuristic. Write down the tour and to total distance. Tour format: X-y-Z-...

Tour:

Distance:

Question 38:

L.2b) How does the previous tour change when the 2-opt approach is used on the second and fourth edge?

What is the distance now?

Tour:

Distance:

Question 39

L.2c) Now consider the vehicle routing problem (VRP) and create a savings matrix. Enter your calculated values in the table below.

Q40: L.2d) Again, for the VRP, create a tour by applying the savings heuristic. Write down step by step which

nodes/edges you enter into the tour and in which way. Note: The solution still has to be a final tour that serves all customers with start/end at the depot.

Time left 1:59:21 L.2) The following table shows the distance matrix for planning a round trip with four customers (1,2,3,4) and a depot 0. All customers have to be visited during one tour (traveling salesman problem). Every complete tour starts and ends at the depot. 0 1 2 3 4 4 0 0 8 4 4 1 1 8 3 6 4 2. 2 4 3 0 4 N 3 4 0 1 4 1 4 2 1 Question 39 Not yet L.2c) Now consider the vehicle routing problem (VRP) and create a savings matrix. Enter your calculated values in the table below. 2 3 answered Marked out of 3.00 1 2 Flag question 3 3 Question 40 Not yet answered L2d) Again, for the VRP, create a tour by applying the savings heuristic. Write down step by step which nodes/edges you enter into the tour and in which way. Note: The solution still has to be a final tour that serves all customers with start/end at the depot. Steps tour creation Step 1 Marked out of 3.00 P Flag question Step 2 Step 3 Total distance of the final tour