Excel solution would be very nice if possible.

Consider the following instance of the Capacitated Vehicle Routing Problem Location 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 X coordinate 40 22 36 21 45 55 33 50 55 26 40 55 35 62 62 62 21 33 9 62 66 Y coordinate 40 22 26 45 35 20 34 50 45 59 66 65 51 35 57 24 36 44 56 48 14 Demand 0 18 26 11 30 21 19 15 16 29 26 37 16 12 31 8 19 20 13 15 22 The above data should be interpreted as follows: 0 40 40 O means that the depot is located at (40, 40) with 0 demand required, 1 22 22 18 location 1 is located at (22, 22) and has demand equal to 18 and so on. The total demand over all locations is equal to 404 units, therefore we will be trying to route four heterogeneous vehicles with capacities 220, 120, 70, 60. Using the Savings routing algorithm, (1) Calculate the distance matrix and the matrix of savings. (2) Find feasible routes (if possible) for every vehicle using the Clark and Wright savings method