Stochastic mathematical model for vehicle routing problem in collecting perishable products

In this paper a model for the vehicle routing problem with stochastic components of demand, service time and delivery time for perishable products is presented. The purpose of the paper is to present an alternative to the problem of collecting the flower industry, using a model that reflects the stochastic behavior in collecting flowers, required by companies in Colombia. The model incorporates three stochastic components and a restriction not reported earlier by other authors. The solution method includes clusters for collection points, route design, allocation to truck routes, Monte Carlo simulation and a regression model to obtain the equation of the total system cost and optimal point of replenishment.

[1]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[2]  Albert Madansky.  New Methods in Mathematical Programming---Methods of Solution of Linear Programs Under Uncertainty , 1961 .

[3]  Libardo Antonio Londoño Ciro,et al.  Metodología de la investigación holística. Una propuesta integradora desde las sociedades fragmentadas , 2012 .

[4]  Jens Lysgaard,et al.  A Column Generation Approach to the Capacitated Vehicle Routing Problem with Stochastic Demands , 2006 .

[5]  Albert Madansky.  METHODS OF SOLUTION OF LINEAR PROGRAMS UNDER UNCERTAINTY. NOTES ON LINEAR PROGRAMMING AND EXTENSIONS. PART 56 , 1961 .

[6]  Lidija Zadnik Stirn,et al.  A vehicle routing algorithm for the distribution of fresh vegetables and similar perishable food , 2008 .

[7]  Frederick S. Hillier,et al.  Introducción a la investigación de operaciones , 2015 .

[8]  Wayne L. Winston.  Investigacion de Operaciones: Aplicaciones y Algoritmos , 2006 .

[9]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers , 1996, Oper. Res..

[10]  Gilbert Laporte,et al.  A Priori Optimization of the Probabilistic Traveling Salesman Problem , 1994, Oper. Res..

[11]  Hui-Chieh Li,et al.  Vehicle routing problem with time-windows for perishable food delivery , 2007 .

[12]  A. Charnes,et al.  Chance-Constrained Programming , 1959 .

[13]  Michel Gendreau,et al.  A Hybrid Monte Carlo Local Branching Algorithm for the Single Vehicle Routing Problem with Stochastic Demands , 2010, Transp. Sci..

[14]  Kay Chen Tan,et al.  Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation , 2007, Eur. J. Oper. Res..

[15]  Mei-Shiang Chang,et al.  Production scheduling and vehicle routing with time windows for perishable food products , 2009, Comput. Oper. Res..

[16]  Pedro Amorim,et al.  The impact of food perishability issues in the vehicle routing problem , 2014, Comput. Ind. Eng..

[17]  Nicolas Jozefowiez,et al.  The vehicle routing problem: Latest advances and new challenges , 2007 .

[18]  Víctor Yepes Piqueras.  Optimización heurística económica aplicada a las redes de transporte del tipo VRPTW. , 2011 .

[19]  Gilbert Laporte,et al.  The Vehicle Routing Problem with Stochastic Travel Times , 1992, Transp. Sci..

[20]  E. B. Pineda,et al.  Metodología de la investigación , 2008 .

[21]  Robin Hanson,et al.  Impact of unit load size on in-plant materials supply efficiency , 2011 .

[22]  Antonio Guasch Petit,et al.  Modelado y simulación : aplicación a procesos logísticos de fabricación y servicios , 2003 .

[23]  Michel Gendreau,et al.  An Approximation Algorithm for the Traveling Salesman Problem with Backhauls , 1997, Oper. Res..

[24]  G. Laporte,et al.  A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times , 2012 .

[25]  Martin W. P. Savelsbergh,et al.  The Vehicle Routing Problem with Stochastic Demand and Duration Constraints , 2010, Transp. Sci..