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

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.

[1]  Martín Darío Arango Serna,et al.  COMMODITIES DISTRIBUTION USING ALTERNATIVE TYPES OF TRANSPORT. A STUDY IN THE COLOMBIAN BREAD SME`S , 2010 .

[2]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[3]  M. Dror,et al.  Split delivery routing , 1990 .

[4]  Xavier Vilajosana,et al.  Using Agent-based Simulation and Distributed Computing to solve Vehicle Routing Problems , 2010 .

[5]  J. W. Giffin,et al.  The split delivery vehicle scheduling problem with time windows and grid network distances , 1995, Comput. Oper. Res..

[6]  Guy Desaulniers,et al.  Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows , 2008, Oper. Res..

[7]  Moshe Dror,et al.  Split-delivery routeing heuristics in livestock feed distribution , 1997 .

[8]  Moshe Dror,et al.  Savings by Split Delivery Routing , 1989, Transp. Sci..

[9]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.

[10]  T. M. Cavalier,et al.  A Construction Heuristic for the Split Delivery Vehicle Routing Problem , 2012 .

[11]  Mwp Martin Savelsbergh,et al.  VEHICLE ROUTING WITH TIME WINDOWS: OPTIMIZATION AND APPROXIMATION. VEHICLE ROUTING: METHOD AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16 , 1987 .

[12]  Alejandro Garcia del Valle,et al.  ELOCONS: UN ALGORITMO DE CONSTRUCCIÓN DE RUTAS EFICIENTE PARA LA PEQUEÑA Y MEDIANA EMPRESA DE DISTRIBUCIÓN , 2012 .

[13]  Angel A. Juan,et al.  Combining Constraint Programming, Lagrangian Relaxation and Probabilistic Algorithms to solve the Vehicle Routing Problem , 2010, RCRA@CPAIOR.

[14]  Martin W. P. Savelsbergh,et al.  An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem , 2008, Transp. Sci..

[15]  Jonas Hagen,et al.  The Benefits of Cargo Bikes in Rio de Janeiro: A Case Study , 2013 .

[16]  Dag Haugland,et al.  A tabu search heuristic for the vehicle routing problem with time windows and split deliveries , 2004, Comput. Oper. Res..

[17]  Guy Desaulniers,et al.  Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows , 2009, Transp. Sci..

[18]  Maria Grazia Speranza,et al.  Vehicle routing problems with split deliveries , 2012, Int. Trans. Oper. Res..

[19]  Matteo Salani,et al.  Branch and price for the vehicle routing problem with discrete split deliveries and time windows , 2011, Eur. J. Oper. Res..

[20]  Michel Gendreau,et al.  Vehicle Routing with Time Windows and Split Deliveries , 2003 .

[21]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .