Consider a central depot and 5 clients. From the depot a single delivery has to be...

  

Transcribed Image Text:

Consider a central depot and 5 clients. From the depot a single delivery has to be made to each one of the clients. The routes that are allowed are shown in the table below. The objective is to determine which truck should go to each client and the routing that minimizes the total distance traveled. Each column in the table represents a possible truck route and the c; represents the total distance of the route. Route 1 2 3 4 Cj 8 10 4 4 1 0 0 0 0 1 0 0 5200 5 6 7 8 9 10 11 12 13 14 10 8 11 12 6 6 5 0 1 1 1 0 0 0 0 0 0 1 0 0 1 1 0 0 0 0 0 1 0 0 0 1 0 0 0 1 1 0 0 0 0 1 0 0 0 0 1 0 1 0 1 0 0 0 0 1 0 0 1 0 1 0 1 1 Start with a solution in which, each client is served by a separate truck, and apply the savings algorithm to improve this solution as much as possible. Break any ties in favor of the lowest indexed trip pattern. Report the route assignments and the total trip distance of the final solution. Consider a central depot and 5 clients. From the depot a single delivery has to be made to each one of the clients. The routes that are allowed are shown in the table below. The objective is to determine which truck should go to each client and the routing that minimizes the total distance traveled. Each column in the table represents a possible truck route and the c; represents the total distance of the route. Route 1 2 3 4 Cj 8 10 4 4 1 0 0 0 0 1 0 0 5200 5 6 7 8 9 10 11 12 13 14 10 8 11 12 6 6 5 0 1 1 1 0 0 0 0 0 0 1 0 0 1 1 0 0 0 0 0 1 0 0 0 1 0 0 0 1 1 0 0 0 0 1 0 0 0 0 1 0 1 0 1 0 0 0 0 1 0 0 1 0 1 0 1 1 Start with a solution in which, each client is served by a separate truck, and apply the savings algorithm to improve this solution as much as possible. Break any ties in favor of the lowest indexed trip pattern. Report the route assignments and the total trip distance of the final solution.