Managing stochastic demand in an Inventory Routing Problem with transportation procurement

Omega (United Kingdom)

Volumn 56, Issue , 2015, Pages 112-121

  Bertazzi, Luca ^a   Bosco, Adamo ^b   Laganà, Demetrio ^c  

^a UNIVERSITY OF BRESCIA   (Italy)

^b Itaca Srl   (Italy)

^c UNIVERSITY OF CALABRIA   (Italy)

Author keywords

Dynamic programming; Inventory routing problem; Matheuristic; Stochastic demand; Transportation procurement

Indexed keywords

COSTS; INTEGER PROGRAMMING; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; SALES; STOCHASTIC SYSTEMS;

INVENTORY COSTS; INVENTORY ROUTING PROBLEMS; MATHEURISTIC; PENALTY COST; PLANNING HORIZONS; PRODUCTION CAPACITY; STOCHASTIC-DEMAND; TOTAL EXPECTED COSTS; TRANSPORTATION PROCUREMENT; TRANSPORTATION SERVICES;

DYNAMIC PROGRAMMING;

EID: 84937951712     PISSN: 03050483     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.omega.2014.09.010     Document Type: Article

References (62)

1. Bertazzi L., Speranza M.G. Inventory routing problems. an introduction. EURO Journal on Transportation and Logistics 2012, 1:307-326.
2. Bertazzi L., Speranza M.G. Inventory routing problems with multiple customers. EURO Journal on Transportation and Logistics 2013, 2:255-275.
3. Coelho L.C., Cordeau J.F., Laporte F. Thirty years of inventory routing. Transportation Science 2013, 48:1-19.
4. Nahmias S. Production and operations analysis 2005, McGraw-Hill, New York.
5. Archetti C., Bertazzi L., Speranza M.G. Polynomial cases of the economic lot sizing problem with cost discounts. European Journal of Operational Research 2014, 237:519-527.
6. Bertazzi L., Savelsbergh M., Speranza M.G. Inventory routing. The vehicle routing problem, latest advances and new challenges 2008, Springer; New York. B. Golden, S. Raghavan, E. Wasil (Eds.).
7. Andersson H., Hoff A., Christiansen M., Hasle G., Løkketangen A. Industrial aspects and literature survey. combined inventory management and routing. Computers & Operations Research 2010, 37:1515-1536.
8. Kim J., Kim Y. A decomposition approach to a multi-period vehicle scheduling problem. Omega 1999, 27(4):421-430.
9. Day J.M., Wright P.D., Schoenherr T., Venkataramanan M., Gaudette K. Improving routing and scheduling decisions at a distributor of industrial gasses. Omega 2009, 37(1):227-237.
10. Kopanos G.M., Puigjaner L., Georgiadis M.C. Simultaneous production and logistics operations planning in semicontinuous food industries. Omega 2012, 40(5):634-650.
11. Federgruen A., Zipkin P.H. A combined vehicle routing and inventory allocation problem. Operations Research 1984, 32:1019-1037.
12. Golden B.L., Assad A., Dahl R. Analysis of a large scale vehicle routing problem with an inventory component. Large Scale Systems 1984, 7:181-190.
13. Dror M., Ball M., Golden B.L. A computational comparison of algorithms for the inventory routing problem. Annals of Operations Research 1985, 4:3-23.
14. Federgruen A., Prastacos G., Zipkin P.H. An allocation and distribution model for perishable products. Annals of Operations Research 1986, 34:75-82.
15. Bassok Y., Ernst R. Dynamic allocations for multi-product distribution. Annals of Operations Research 1995, 29:256-266.
16. Herer Y.T., Levy R. The metered inventory routing problem, an integrative heuristic algorithm. International Journal of Production Economics 1997, 51:69-81.
17. Bard J.F., Huang L., Jaillet P., Dror M. A decomposition approach to the inventory routing problem with satellite facilities. Transportation Science 1998, 32:189-203.
18. Berman O., Larson R.C. Deliveries in an inventory/routing problem using stochastic dynamic programming. Transportation Science 2001, 35:192-213.
19. Bell W.J., Dalberto L.M., Fisher M.L., Greenfield A.J., Jaikumar R., Kedia P., et al. Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer. Interfaces 1983, 13:4-23.
20. Gaur V., Fisher M.L. A periodic inventory routing problem at a supermarket chain. Operations Research 2004, 52:813-822.
21. Dauzère-Pérès S., Nordli A., Olstad A., Haugen K., Koester U., Myrstad P.O., et al. Omya Hustadmarmor optimizes its supply chain for delivering calcium carbonate slurry to European paper manufacturers. Interfaces 2007, 37:39-51.
22. Minkoff A.S. A Markov decision model and decomposition heuristic for a dynamic vehicle dispatching. Operations Research 1993, 41:77-90.
23. Kleywegt A., Nori V., Savelsbergh M. The stochastic inventory routing problem with direct deliveries. Transportation Science 2002, 36:94-118.
24. Kleywegt A., Nori V., Savelsbergh M. Dynamic programming approximations for a stochastic inventory routing problem. Transportation Science 2004, 38:42-70.
25. Adelman D. Price-directed replenishment of subsets. methodology and its application to inventory routing. Manufacturing & Service Operations Management 2003, 5(4):348-371.
26. Adelman D. A price-directed approach to stochastic inventory/routing. Operations Research 2004, 52(4):499-514.
27. Hvattum L.M., Løkketangen A. Using scenario trees and progressive hedging for stochastic inventory routing problems. Journal of Heuristics 2009, 15:527-557.
28. Hvattum L.M., Laporte G., Løkketangen A. Scenario tree-based heuristics for stochastic inventory-routing problems. INFORMS Journal on Computing 2009, 21(2):268-285.
29. Yu Y., Chu C., Chen H., Chu F. Large scale stochastic inventory routing problems with split delivery and service level constraints. Annals of Operational Research 2012, 197:135-158.
30. Bertazzi L., Bosco A., Guerriero F., Laganà D. A stochastic inventory routing problem with stock-out. Transportation Research Part C. Emerging Technologies 2013, 27:89-107.
31. Aguezzoul A. Third-party logistics selection problem. a literature review on criteria and methods. Omega 2014, 49:69-78.
32. Chu C.W. A heuristic algorithm for the truckload and less-than-truckload problem. European Journal of Operational Research 2005, 165:657-667.
33. Clarke G., Wright J.W. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 1964, 12(4):568-581.
34. Bolduc M.C., Renaud J., Boctor F., Laporte G. A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers. International Journal of the Operational Research Society 2008, 59(6):776-787.
35. CÔté J.F., Potvin J.Y. A tabu search heuristic for the vehicle routing problem with private fleet and common carrier. European Journal of Operational Research 2009, 198(2):464-469.
36. Potvin J.Y., Naud M.A. Tabu search with ejection chains for the vehicle routing problem with private fleet and common carrier. International Journal of the Operational Research Society 2011, 62:326-336.
37. Stenger A., Vigo D., Enz S., Schwind M. An adaptive variable neighborhood search algorithm for a vehicle routing problem arising in small package shipping. Transportation Science 2013, 47(1):64-80.
38. Coelho L.C., Cordeau J.F., Laporte G. The inventory-routing problem with transshipment. Computers & Operations Research 2012, 39(11):2537-2548.
39. Pan F., Nagi R. Multi-echelon supply chain network design in agile manufacturing. Omega 2013, 41(6):969-983.
40. Mansini R., Savelsbergh M.W.P., Tocchella B. The supplier selection problem with quantity discounts and truckload shipping. Omega 2012, 40(4):445-455.
41. Sheffi Y. Combinatorial auctions in the procurement of transportation services. Interfaces 2004, 34(4):245-252.
42. Martello S., Toth P. Knapsack problems. algorithms and computer implementations 1990, John Wiley & Sons Inc., New York.
43. Birge J.R., Louveaux F. Introduction to stochastic programming 1997, Springer-Verlag, New York.
44. Bertsekas D.P. Dynamic programming and optimal control 2005, Athena Scientific, Belmont.
45. Powell W.B. Approximate dynamic programming. solving the curses of dimensionality 2011, John Wiley & Sons Inc., Hoboken.
46. Maniezzo V., Stèutzle T., Voss S. Matheuristics. hybridizing metaheuristics and mathematical programming 2009, vol. 10. Springer, New York.
47. Bertazzi L, Speranza MG. Matheuristics for inventory routing problems. In: Montoya-Torres JR, Juan AA, Huatuco LH, Faulin J, Rodriguez-Verjan GL, editors. Hybrid algorithms for service, computing and manufacturing systems: routing, scheduling and availability solutions. IGI Global, Hershey; 2011.
48. Bertazzi L. Minimum and worst-case performance ratios of rollout algorithms. Journal of Optimization Theory and Applications 2012, 152:378-393.
49. Bertsekas D.P., Tsitsiklis J.N. Neuro-dynamic programming 1996, Athena Scientific, Belmont.
50. Tesauro G., Galperin G.R. On-line policy improvement using monte-carlo search. Advances in Neural Information Processing Systems 1997, 9:1068-1074.
51. Sutton R.S., Barto A.G. Reinforcement learning. an introduction 1998, vol. 1. MIT Press, Cambridge.
52. Bertsekas D.P., Castanõn D.A. Rollout algorithms for stochastic scheduling problems. Journal of Heuristics 1999, 5(1):89-108.
53. Secomandi N. Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands. Computers & Operations Research 2000, 27(11-12):1201-1225.
54. Secomandi N. A rollout policy for the vehicle routing problem with stochastic demands. Operations Research 2001, 49:796-802.
55. Secomandi N. Analysis of a rollout approach to sequencing problems with stochastic routing applications. Journal of Heuristics 2003, 9(4):321-352.
56. Novoa C., Storer R. An approximate dynamic programming approach for the vehicle routing problem with stochastic demands. European Journal of Operational Research 2009, 196(2):509-515.
57. Guerriero F., Mancini M. A cooperative parallel rollout algorithm for the sequential ordering problem. Parallel Computing 2003, 29(5):663-677.
58. Guerriero F., Mancini M. Parallelization strategies for rollout algorithms. Computational Optimization and Applications 2005, 31(2):221-244.
59. Bertsekas D.P., Tsitsiklis J.N., Wu C. Rollout algorithms for combinatorial optimization. Journal of Heuristics 1997, 3(3):245-262.
60. Guerriero F. Hybrid rollout approaches for the job shop scheduling problem. Journal of Optimization Theory and Applications 2008, 139(2):419-438.
61. Bertsimas D., Demir R. An approximate dynamic programming approach to multidimensional knapsack problems. Management Science 2002, 48:550-565.
62. Archetti C., Bertazzi L., Laporte G., Speranza M.G. A branch-and-cut algorithm for a vendor-managed inventory-routing problem. Transportation Science 2007, 41(3):382-391.