Vehicle Routing Data a) Sweep Method 1) Find the lower bound on number of routes 2) Use the sweep method to group points. (generate multiple solutions, at least three) 3) Solve the TSP problems in each sector using the visual method. 4) Graph (draw to scale) the solution b) Clarke-Wright Savings Method 1) Use the Clarke-Wright method to find a heuristic solution (you will first need to calculate the Euclidean distances between all pairs of points) 2) Graph (draw to scale) the solution c) Comparison 1) Find the total route distance of the best solution you found with the Sweep Method 2) Find the total route distance of the Clarke Wright solution 3) Which one has the lower total distance? 4) Which solution (sweep or Clarke Wright ) has more balanced loads among its routes? Vehicle Routing Data a) Sweep Method 1) Find the lower bound on number of routes 2) Use the sweep method to group points. (generate multiple solutions, at least three) 3) Solve the TSP problems in each sector using the visual method. 4) Graph (draw to scale) the solution b) Clarke-Wright Savings Method 1) Use the Clarke-Wright method to find a heuristic solution (you will first need to calculate the Euclidean distances between all pairs of points) 2) Graph (draw to scale) the solution c) Comparison 1) Find the total route distance of the best solution you found with the Sweep Method 2) Find the total route distance of the Clarke Wright solution 3) Which one has the lower total distance? 4) Which solution (sweep or Clarke Wright ) has more balanced loads among its routes