A stochastic inventory routing problem with stock-out

Transportation Research Part C: Emerging Technologies

Volumn 27, Issue , 2013, Pages 89-107

  Bertazzi, Luca ^a   Bosco, Adamo ^b   Guerriero, Francesca ^b   Laganà, Demetrio ^b  

^a UNIVERSITY OF BRESCIA   (Italy)

^b UNIVERSITY OF CALABRIA   (Italy)

Author keywords

Branch and cut; Hybrid algorithms; Inventory routing; Rollout algorithms; Stochastic demand

Indexed keywords

INTEGER PROGRAMMING; SALES;

BRANCH AND CUT; HYBRID ALGORITHMS; INVENTORY ROUTING; ROLLOUT ALGORITHMS; STOCHASTIC DEMAND;

STOCHASTIC SYSTEMS;

ALGORITHM; COST; INVENTORY; PERFORMANCE ASSESSMENT; ROUTING; SHIPPING; STOCHASTICITY; STRATEGIC APPROACH;

EID: 84873744862     PISSN: 0968090X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trc.2011.06.003     Document Type: Article

References (38)

1. Adelman D. A price-directed approach to stochastic inventory/routing. Operations Research 2004, 52:499-514.
2. Andersson H., Hoff A., Christiansen M., Hasle G., L∅kketangen A. Industrial aspects and literature survey: combined inventory management and routing. Computers and Operations Research 2010, 37:1515-1536.
3. Anily S., Federgruen A. One warehouse multiple retailer systems with vehicle routing costs. Management Science 1990, 36:92-114.
4. 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:382-391.
5. Bertazzi L., Paletta G., Speranza M.G. Deterministic order-up-to level policies in an inventory routing problem. Transportation Science 2002, 36:119-132.
6. Bertazzi L., Savelsbergh M., Speranza M.G. Inventory routing. The Vehicle Routing Problem, Latest Advances and New Challenges 2008, 49-72. Springer. B. Golden, S. Raghavan, E. Wasil (Eds.).
7. Bertazzi L., Speranza M.G., Ukovich W. Minimization of logistic costs with given frequencies. Transportation Research B 1997, 31:327-340.
8. Bertsekas D.P. Dynamic Programming and Optimal Control 2007, vol. 1. Athena Scientific, Belmont, MA.
9. Bertsekas D.P., Castanõn D.A. Rollout algorithms for stochastic scheduling problems. Journal of Heuristics 1998, 5:89-108.
10. Bertsekas D.P., Tsitsiklis J.N. Neuro-Dynamic Programming 1996, Athena Scientific, Belmont, MA.
11. Birge J.R., Louveaux F. Introduction to Stochastic Programming 1997, Springer.
12. Campbell A.M., Clarke L., Kleywegt A., Savelsbergh M.W.P. The inventory routing problem. Fleet Management and Logistics 1998, 95-113. Kluwer, Boston. T.G. Crainic, G. Laporte (Eds.).
13. Campbell A.M., Savelsbergh M.W.P. Delivery volume optimization. Transportation Science 2004, 38:210-223.
14. Chan L.M.A., Simchi-Levi D. Probabilistic analyses and algorithms for three-level distribution systems. Management Science 1998, 44:1562-1576.
15. Cordeau, J.-F., Laporte, G., Savelsbergh, M.W.P., Vigo, D., 2007. Short-haul routing. In: Laporte, G., Barnhart, C. (Eds.), Handbooks in Operations Research and Management Science: Transportation, vol. 14, pp. 367-428.
16. Dror M., Ball M. Inventory/routing: reduction from an annual to a short-period problem. Naval Research Logistics Quarterly 1987, 34:891-905.
17. Federgruen A., Simchi-Levi D. Analysis of vehicle routing and inventory-routing problems. Handbooks in Operations Research and Management Science 1995, vol. 8:297-373. North-Holland.
18. Federgruen A., Zipkin P. A combined vehicle routing and inventory allocation problem. Operations Research 1984, 32:1019-1032.
19. Fischetti M., Salazar-González J.J., Toth P. Solving the orienteering problem through branch and cut. INFORMS Journal of Computing 1998, 10:133-148.
20. Gendreau M., Laporte G., Semet F. A branch-and-cut algorithm for the undirected selective traveling salesman problem. Networks 1998, 32:263-273.
21. Harris F.W. How many parts to make at once. Factory, The Magazine of Management 1913, 10:135-136. reprinted in Operations Research 38 (1990) 947-950.
22. Hvattum L.M., L∅kketangen A. Using scenario trees and progressive hedging for stochastic inventory routing problems. Journal of Heuristics 2009, 15:527-557.
23. Hvattum L.M., L∅kketangen A., Laporte G. Scenario tree based heuristics for stochastic inventory routing problems. INFORMS Journal on Computing 2009, 21:268-285.
24. Jaillet P., Bard J.F., Huang L., Dror M. Delivery cost approximations for inventory routing problems in a rolling horizon framework. Transportation Science 2002, 36:292-300.
25. Kleywegt A.J., Nori V.S., Savelsbergh M.W.P. The stochastic inventory routing problem with direct deliveries. Transportation Science 2002, 36:94-118.
26. Kleywegt A.J., Nori V.S., Savelsbergh M.W.P. Dynamic programming approximations for a stochastic inventory routing problem. Transportation Science 2004, 38:42-70.
27. Moin N.H., Salhi S. Inventory routing problems: a logistical overview. Journal of Operational Research Society 2007, 58:1185-1194.
28. Padberg M., Rinaldi G. A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Review 1991, 33:60-100.
29. Powell W.B. Approximate Dynamic Programming 2007, John Wiley and Sons.
30. Savelsbergh M.W.P., Song J.-H. Inventory routing with continuous moves. Computers and Operations Research 2006, 34:1744-1763.
31. Secomandi N. Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands. Computers and Operations Research 2000, 27:1201-1225.
32. Secomandi N. A rollout policy for the vehicle routing problem with stochastic demands. Operations Research 2001, 49:796-802.
33. Secomandi N. Analysis of a rollout approach to sequencing problems with stochastic routing applications. Journal of Heuristics 2003, 9:321-352.
34. Simchi-Levi D., Chen X., Bramel J. The Logic of Logistics 2005, Springer, New York.
35. Sutton R., Barto A.S. Reinforcement Learning 1998, MIT Press, Cambridge, MA.
36. Tesauro G., Galperin G.R. On-line policy improvement using Monte Carlo search. Advances in Neural Information Processing Systems 1997, 9:1068-1074.
37. Yu Yu., Chen H., Chu F. A new model and hybrid approach for large scale inventory routing problems. European Journal of Operational Research 2008, 189:1022-1040.
38. Yu, Yu, Chu, C., Chen, H., Chu, F., in press. Large scale stochastic inventory routing problems with split delivery and service level constraints. Annals of Operational Research, doi:. doi:10.1007/s10479-010-0772-4.