Heuristics for dynamic and stochastic inventory-routing

Computers and Operations Research

Volumn 52, Issue PART A, 2014, Pages 55-67

  Coelho, Leandro C ^a,b   Cordeau, Jean François ^a,c   Laporte, Gilbert ^a,c  

^a INTERUNIVERSITY RESEARCH CENTRE ON ENTERPRISE NETWORKS   (Canada)

^b UNIVERSITÉ LAVAL   (Canada)

^c HEC MONTRÉAL   (Canada)

Author keywords

Dynamic demand; Heuristic; Inventory routing; Rolling horizon algorithm; Stochastic demand

Indexed keywords

COMBINATORIAL OPTIMIZATION; HEURISTIC ALGORITHMS; INVENTORY CONTROL; OPTIMIZATION;

DYNAMIC DEMAND; HEURISTIC; INVENTORY ROUTING; ROLLING-HORIZON ALGORITHMS; STOCHASTIC DEMAND;

STOCHASTIC SYSTEMS;

EID: 84905820359     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2014.07.001     Document Type: Article

References (55)

1. D. Adelman A price-directed approach to stochastic inventory/routing Oper Res 52 4 2004 499 514
2. D. Adelman, and D. Klabjan Computing near-optimal policies in generalized joint replenishment INFORMS J Comput 24 1 2012 148 164
3. Y. Adulyasak, J.-F. Cordeau, and R. Jans Optimization-based adaptive large neighborhood search for the production routing problem Transp Sci 48 1 2014 20 45
4. H. Andersson, A. Hoff, M. Christiansen, G. Hasle, and A. Løkketangen Industrial aspects and literature survey combined inventory management and routing Comput Oper Res 37 9 2010 1515 1536
5. C. Archetti, L. Bertazzi, G. Laporte, and M.G. Speranza A branch-and-cut algorithm for a vendor-managed inventory-routing problem Transp Sci 41 3 2007 382 391
6. C. Archetti, L. Bertazzi, A. Hertz, and M.G. Speranza A hybrid heuristic for an inventory routing problem INFORMS J Comput 24 1 2012 101 116
7. K.J. Arrow, T. Harris, and J. Marschak Optimal inventory policy Econometrica 19 3 1951 250 272
8. Avella P, Boccia M, Wolsey LA. Single item reformulations for a vendor managed inventory routing problem: computational experience with benchmark instances. Technical Report 2013/45, CORE, Louvain-la-Neuve, Belgium; 2013.
9. S. Axsäter Inventory control - international series in operations research & management science vol. 90 2006 Springer New York
10. J.F. Bard, and N. Nananukul A branch-and-price algorithm for an integrated production and inventory routing problem Comput Oper Res 37 12 2010 2202 2217
11. P. Bartodziej, U. Derigs, D. Malcherek, and U. Vogel Models and algorithms for solving combined vehicle and crew scheduling problems with rest constraints an application to road feeder service planning in air cargo transportation OR Spectr 31 2 2009 405 429
12. G. Berbeglia, J.-F. Cordeau, and G. Laporte Dynamic pickup and delivery problems Eur J Oper Res 202 1 2010 8 15
13. L. Bertazzi, G. Paletta, and M.G. Speranza Deterministic order-up-to level policies in an inventory routing problem Transp Sci 36 1 2002 119 132 (Pubitemid 34268737)
14. L. Bertazzi, M. Savelsbergh, and M.G. Speranza Inventory routing B.L. Golden, S. Raghavan, E.A. Wasil, The Vehicle Routing Problem 2008 Springer New York 49 72
15. L. Bertazzi, A. Bosco, F. Guerriero, and D. Laganà A stochastic inventory routing problem with stock-out Transp Res Part C: Emerg Technol 27 1 2013 89 107
16. D.P. Bertsekas Dynamic programming and optimal control vol. 2 2012 Athena Scientific Belmont, MA
17. R. Bhatnagar, and C.-C. Teo Role of logistics in enhancing competitive advantage a value chain framework for global supply chains Int J Phys Distrib Logist Manag 39 3 2009 202 226
18. A.M. Campbell, L. Clarke, A.J. Kleywegt, and M.W.P. Savelsbergh The inventory routing problem T.G. Crainic, G. Laporte, Fleet management and logistics pages 1998 Springer Boston 95 113
19. A.S. Caplin The variability of aggregate demand with (S,s) inventory policies Econometrica 53 6 1985 1395 1409
20. L.C. Coelho, and G. Laporte The exact solution of several classes of inventory-routing problems Comput Oper Res 40 2 2013 558 565
21. L.C. Coelho, and G. Laporte A branch-and-cut algorithm for the multi-product multi-vehicle inventory-routing problem Int J Prod Res 51 23-24 2013 7156 7169
22. Coelho LC, Laporte G. Improved solutions for inventory-routing problems through valid inequalities and input ordering. Int J Prod Econ forthcoming, 2014. http://dx.doi.org/10.1016/j.ijpe.2013.11.019.
23. L.C. Coelho, J.-F. Cordeau, and G. Laporte The inventory-routing problem with transshipment Comput Oper Res 39 11 2012 2537 2548
24. L.C. Coelho, J.-F. Cordeau, and G. Laporte Consistency in multi-vehicle inventory-routing Transp Res Part C: Emerg Technol 24 1 2012 270 287
25. L.C. Coelho, J.-F. Cordeau, and G. Laporte Thirty years of inventory-routing Transp Sci 48 1 2014 1 19
26. B. Dezso, A. Jüttner, and P. Kovács LEMON - an open source C++ graph template library Electron Notes Theor Comput Sci 264 5 2011 23 45
27. Eddelbuettel D, François R. RInside: C++ classes to embed R in C++ applications; 2012. URL:(http://CRAN.R-project.org/package=RInside ). R Package Version 0.2.6.
28. G. Ghiani, F. Guerriero, G. Laporte, and R. Musmanno Real-time vehicle routing solutions concepts, algorithms and parallel computing strategies Eur J Oper Res 151 1 2003 1 11
29. M. Goetschalckx Supply chain engineering, International series in operations research & management science, vol. 161 2011 Springer New York
30. P. Goodwin, D. Önkal, and M. Thomson Do forecasts expressed as prediction intervals improve production planning decisions? Eur J Oper Res 205 1 2010 195 201
31. M. Hewitt, G.L. Nemhauser, and M.W.P. Savelsbergh Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem INFORMS J Comput 22 2 2010 314 325
32. L.M. Hvattum, A. Løkketangen, and G. Laporte Scenario tree-based heuristics for stochastic inventory-routing problems INFORMS J Comput 21 2 2009 268 285
33. R.J. Hyndman, and Y. Khandakar Automatic time series forecasting the forecast package for R J Stat Softw 27 3 2008 1 22
34. R.J. Hyndman, A.B. Koehler, J.K. Ord, and R.D. Snyder Forecasting with exponential smoothing: the state space approach 2008 Springer-Verlag Berlin
35. Hyndman RJ, Razbash S, Schmidt D. Forecast: forecasting functions for time series and linear models, 2012. URL:(http://CRAN.R-project.org/package= forecast ). R Package Version 3.19.
36. P. Jaillet, J.F. Bard, L. Huang, and M. Dror Delivery cost approximations for inventory routing problems in a rolling horizon framework Transp Sci 36 3 2002 292 300 (Pubitemid 34963892)
37. A.J. Kleywegt, V.S. Nori, and M.W.P. Savelsbergh The stochastic inventory routing problem with direct deliveries Transp Sci 36 1 2002 94 118 (Pubitemid 34268736)
38. A.J. Kleywegt, V.S. Nori, and M.W.P. Savelsbergh Dynamic programming approximations for a stochastic inventory routing problem Transp Sci 38 1 2004 42 70
39. G. Laporte, R. Musmanno, and F. Vocaturo An adaptive large neighbourhood search heuristic for the capacitated arc-routing problem with stochastic demands Transp Sci 44 1 2010 125 135
40. H.L. Lee, and W. Seungjin The whose, where and how of inventory control design Supply Chain Manag Rev 12 8 2008 22 29
41. S.G. Makridakis, S.C. Wheelwright, and R.J. Hyndman Forecasting: methods and applications 1998 Wiley New York
42. V. Maniezzo, T. Stützle, and S. Voß Matheuristics: hybridizing metaheuristics and mathematical programming 2009 Springer New York
43. L.M. Nonås, and K. Jörnsten Optimal solution in the multi-location inventory system with transshipments J Math Model Algorithms 6 1 2007 47 75
44. Ö. Özer Inventory management information, coordination, and rationality K.G. Kempf, P. Keskinocak, R. Uzsoy, Planning production and inventories in the extended enterprise, International series in operations research & management science, vol. 151 2011 Springer New York 321 365
45. C. Paterson, G. Kiesmüller, R. Teunter, and K. Glazebrook Inventory models with lateral transshipments a review Eur J Oper Res 210 2 2011 125 136
46. A.-S. Pepin, G. Desaulniers, A. Hertz, and D. Huisman A comparison of five heuristics for the multiple depot vehicle scheduling problem J Sched 12 1 2009 17 30
47. W.B. Powell Approximate dynamic programming, Wiley series in probability and statistics 2007 Wiley New Jersey
48. H.N. Psaraftis Dynamic vehicle routing problems B.L. Golden, A.A. Assad, Vehicle routing methods and studies 1998 North-Holland Amsterdam 223 248
49. R Development Core Team. R: a language and environment for statistical computing. R Foundation for Statistical Computing, Vienna, Austria, 2011. URL:(http://www.R-project.org ).
50. D. Rey, and M. Neuhäuser Wilcoxon-signed-rank test M. Lovric, International encyclopedia of statistical science 2011 Springer Berlin 1658 1659
51. S. Ropke, and D. Pisinger An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows Transp Sci 40 4 2006 455 472 (Pubitemid 44746135)
52. Shaw P. A new local search algorithm providing high quality solutions to vehicle routing problems. Technical report, University of Strathclyde, Glasgow; 1997.
53. E.A. Silver, D.F. Pyke, and R. Peterson Inventory management and production planning and scheduling 1998 Wiley New York
54. O. SolyalI, and H. Süral A branch-and-cut algorithm using a strong formulation and an a priori tour based heuristic for an inventory-routing problem Transp Sci 45 3 2011 335 345
55. A. Toriello, G.L. Nemhauser, and M.W.P. Savelsbergh Decomposing inventory routing problems with approximate value functions Nav Res Logist 57 8 2010 718 727