Supply Chain Management - Vehical Routing Problem. The clarke wright algortihm requires the savings matrix to be built from the distance matrix. The Baroda Union case study provides the distance matrix for all villages, then requires saving matrix for 6 subsets of villages. This code allows us to divide the villages into societies and solve for each savings matrix.