A hybrid grouping genetic algorithm for the inventory routing problem with multi-tours of the vehicle

In this paper we analyze the inventory routing model as described recently by Aghezaff et al. in which the work of each vehicle can be organized in multi-tours: a vehicle comes back to the depot after the delivery of some-sales points and before visiting other sales-points. We propose a grouping genetic algorithm with a specific crossover operator adapted to this model; this algorithm is hybridized at each iteration with a local search. A large number of numerical experiments is done to show the efficiency of the proposed algorithm.

[1]  Feng Chu,et al.  A new model and hybrid approach for large scale inventory routing problems , 2008, Eur. J. Oper. Res..

[2]  Awi Federgruen,et al.  One warehouse multiple retailer systems with vehicle routing costs , 1990 .

[3]  Martin W. P. Savelsbergh,et al.  An optimization algorithm for the inventory routing problem with continuous moves , 2008, Comput. Oper. Res..

[4]  Shu-Chu Liu,et al.  A heuristic method for the vehicle routing problem with backhauls and inventory , 2009, J. Intell. Manuf..

[5]  David Simchi-Levi,et al.  A Location Based Heuristic for General Routing Problems , 1995, Oper. Res..

[6]  Martin W. P. Savelsbergh,et al.  Worst-Case Analysis for Split Delivery Vehicle Routing Problems , 2006, Transp. Sci..

[7]  Emanuel Falkenauer,et al.  The Grouping Genetic Algorithm , 1996 .

[8]  Lap Mui Ann Chan,et al.  Probabilistic Analyses and Practical Algorithms for Inventory-Routing Models , 1998, Oper. Res..

[9]  Maged M. Dessouky,et al.  Heuristic approaches for the inventory-routing problem with backlogging , 2009, Comput. Ind. Eng..

[10]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[11]  Feng Chu,et al.  Performance evaluation of distribution strategies for the inventory routing problem , 2010, Eur. J. Oper. Res..

[12]  Martin W. P. Savelsbergh,et al.  Inventory routing with continuous moves , 2007, Comput. Oper. Res..

[13]  Martin W. P. Savelsbergh,et al.  Performance Measurement for Inventory Routing , 2007, Transp. Sci..

[14]  El Houssaine Aghezzaf.  Robust distribution planning for supplier-managed inventory agreements when demand rates and travel times are stationary , 2008, J. Oper. Res. Soc..

[15]  Richard C. Larson,et al.  Transporting Sludge to the 106-Mile Site: An Inventory/Routing Model for Fleet Sizing and Logistics System Design , 1988, Transp. Sci..

[16]  Christian Prins,et al.  A reactive GRASP and path relinking for a combined production-distribution problem , 2007, Comput. Oper. Res..

[17]  Arne Løkketangen,et al.  Using scenario trees and progressive hedging for stochastic inventory routing problems , 2009, J. Heuristics.

[18]  Jonathan F. Bard,et al.  The integrated production–inventory–distribution–routing problem , 2009, J. Sched..

[19]  Kin Keung Lai,et al.  Replenishment routing problems between a single supplier and multiple retailers with direct delivery , 2008, Eur. J. Oper. Res..

[20]  El Houssaine Aghezzaf,et al.  Production , Manufacturing and Logistics A practical solution approach for the cyclic inventory routing problem , 2008 .

[21]  Christian Prins,et al.  A memetic algorithm with dynamic population management for an integrated production-distribution problem , 2009, Eur. J. Oper. Res..

[22]  Martin W. P. Savelsbergh,et al.  A Decomposition Approach for the Inventory-Routing Problem , 2004, Transp. Sci..

[23]  Moshe Dror,et al.  A computational comparison of algorithms for the inventory routing problem , 1985 .

[24]  Saïd Salhi,et al.  Inventory routing problems: a logistical overview , 2007, J. Oper. Res. Soc..

[25]  Hendrik Van Landeghem,et al.  Modeling inventory routing problems in supply chains of high consumption products , 2006, Eur. J. Oper. Res..

[26]  Evelyn C. Brown,et al.  CF-GGA: A grouping genetic algorithm for the cell formation problem , 2001 .

[27]  Gilbert Laporte,et al.  Scenario Tree-Based Heuristics for Stochastic Inventory-Routing Problems , 2009, INFORMS J. Comput..

[28]  M. Savelsbergh,et al.  The Inventory Routing Problem , 1998 .

[29]  Shuang Chen,et al.  Model and algorithm for inventory/routing decision in a three-echelon logistics system , 2008, Eur. J. Oper. Res..

[30]  Gilbert Laporte,et al.  A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars , 2010, Eur. J. Oper. Res..

[31]  N. S. Barnett,et al.  Private communication , 1969 .

[32]  Emanuel Falkenauer,et al.  A hybrid grouping genetic algorithm for bin packing , 1996, J. Heuristics.

[33]  Awi Federgruen,et al.  A Combined Vehicle Routing and Inventory Allocation Problem , 1984, Oper. Res..

[34]  H. Neil Geismar,et al.  The Integrated Production and Transportation Scheduling Problem for a Product with a Short Lifespan , 2008, INFORMS J. Comput..

[35]  R. Superina.  To split or not to split: That is the question , 2012, Liver transplantation : official publication of the American Association for the Study of Liver Diseases and the International Liver Transplantation Society.

[36]  Martin W. P. Savelsbergh,et al.  Production , Manufacturing and Logistics Vendor managed inventory for environments with stochastic product usage , 2009 .

[37]  El-Houssaine Aghezzaf,et al.  Cyclic scheduling of multiple tours with multiple frequencies for a single vehicle , 2009 .

[38]  Martin W. P. Savelsbergh,et al.  Inventory Routing in Practice , 2002, The Vehicle Routing Problem.

[39]  Daniel Adelman,et al.  Price-Directed Replenishment of Subsets: Methodology and Its Application to Inventory Routing , 2003, Manuf. Serv. Oper. Manag..

[40]  Kevin D. Glazebrook,et al.  Indexability and Index Heuristics for a Simple Class of Inventory Routing Problems , 2009, Oper. Res..