Distribution Management

In this chapter, we will solve the traveling salesman problem (TSP) and the vehicle routing problem (VRP) via two heuristic solution methodologies, namely, the nearest neighbour procedure (NNP) and the Clarke and Wright savings heuristic (C&W). We will briefly discuss the vehicle scheduling problem (VSP) before we look at one case study to apply distribution management theory and concept to manage the distribution of finished goods orders on different days of the week for a fast-moving consumer good company.