Service Delivery in the Field Vehicle Routing Service Delivery in the Field

Clarke-Wright Algorithm Objective: Create a route that minimizes distance (time) traveled from a depot to several customers. Net savings Sij by linking two locations I and j. Routes can be constrained (e.g. vehicle capacity) or unconstrained.

Steps in C-W Algorithm Construct a shortest-distance half-matrix. Assign one round-trip to each location. Calculate the net savings for each pair of outlying locations, and enter them in a net savings half-matrix. Enter values for trip indicator T (2 for round trip, 1 for one way, and 0 for no travel) into appropriate cells of the half-matrix. Identify the cell with the maximum net saving and link the locations provided T>0, locations not already on a route, and other constrains are met.