An algorithm for the routing problem with split deliveries and time windows (sdvrptw) applied on retail sme distribution activities

Abstract

In this paper, particular conditions of retail trade SMEs was analyzed, identifying not enough financial resources for using powerful tools for solve vehicle routing problem (VRP). On the other hand, in literature revised could not be identified studies about application of current approaches for solving VRP in SMEs. Additionally because of high cost, commercial software do not fit investment budget of those companies. Through a simple insertion heuristic for VRP with split deliveries and time windows (SDVRPTW), developed on an accessible technology platform like Microsoft® Excel™, was validated that SDVRPTW is an appropriate approach for solving vehicle routing problem on retail trade SMEs. Computational results show that the heuristic proposed can reduce about 50% the fleet size.