Robust inventory routing under demand uncertainty

Transportation Science

Volumn 46, Issue 3, 2012, Pages 327-340

  Solyali, Oǧuz ^a   Cordeau, Jean François ^b   Laporte, Gilbert ^b  

^a MIDDLE EAST TECHNICAL UNIVERSITY   (Turkey)

^b HEC MONTRÉAL   (Canada)

Author keywords

Branch and cut; Integer programming; Inventory routing problem; Lot sizing; Robust optimization

Indexed keywords

INVENTORY CONTROL; OPTIMIZATION; PROBABILITY DISTRIBUTIONS; SALES; TRANSPORTATION ROUTES;

BRANCH AND CUT; BRANCH-AND-CUT ALGORITHMS; FINITE DISCRETE TIME; INVENTORY MANAGEMENT; INVENTORY ROUTING PROBLEMS; LOT SIZING; MIXED INTEGER PROGRAMMING (MIP); ROBUST OPTIMIZATION;

INTEGER PROGRAMMING;

EID: 84866371094     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1110.0387     Document Type: Article

References (41)

1. Abdelmaguid, T. F., M. Dessouky. 2006. A genetic algorithm approach to the integrated inventory-distribution problem. Int. J. Prod. Res. 44(21) 4445-4464. (Pubitemid 44395463)
2. Abdelmaguid, T. F., M. M. Dessouky, F. Ordóñez. 2009. Heuristic approaches for the inventory-routing problem with backlogging. Comput. Indust. Engrg. 56(4) 1519-1534.
3. Adelman, D. 2004. A price-directed approach to stochastic inventory/routing. Oper. Res. 52(4) 499-514.
4. Aghezzaf, E.-H. 2008. Robust distribution planning for suppliermanaged inventory agreements when demand rates and travel times are stationary. J. Oper. Res. Soc. 59(8) 1055-1065.
5. Andersson, H., A. Hoff, M. Christiansen, G. Hasle, A. Løkketangen. 2010. Industrial aspects and literature survey: Combined inventory management and routing. Comput. Oper. Res. 37(9) 1515-1536.
6. Anily, S., A. Federgruen. 1990. One warehouse multiple retailer systems with vehicle routing costs. Management Sci. 36(1) 92-114.
7. Archetti, A., L. Bertazzi, G. Laporte, M. G. Speranza. 2007. A branch-and-cut algorithm for a vendor-managed inventoryrouting problem. Transportation Sci. 41(3) 382-391.
8. Ben-Tal, A., A. Nemirovski. 1998. Robust convex optimization. Math. Oper. Res. 23(4) 769-805. (Pubitemid 128508557)
9. Ben-Tal, A., A. Nemirovski. 1999. Robust solutions to uncertain programs. Oper. Res. Lett. 25(1) 1-13.
10. Ben-Tal, A., A. Nemirovski. 2000. Robust solutions of linear programming problems contaminated with uncertain data. Math. Programming, Ser. A 88(3) 411-424.
11. Ben-Tal, A., B. Golany, S. Shimrit. 2009. Robust multiechelon multiperiod inventory control. Eur. J. Oper. Res. 199(3) 922-935.
12. Ben-Tal, A., A. Goryashko, E. Guslitzer, A. Nemirovski. 2004. Adjustable robust solutions of uncertain linear programs. Math. Programming, Ser. A 99(2) 351-376. (Pubitemid 40871727)
13. Ben-Tal, A., B. Golany, A. Nemirovski, J.-P. Vial. 2005. Retailersupplier flexible commitments contracts: A robust optimization approach. Manufacturing Service Oper. Management 7(3) 248-271. (Pubitemid 41365608)
14. Bertazzi, L., G. Paletta, M. G. Speranza. 2002. Deterministic orderup- to level policies in an inventory routing problem. Transportation Sci. 36(1) 119-132. (Pubitemid 34268737)
15. Bertsimas, D., M. Sim. 2003. Robust discrete optimization and network flows. Math. Programming, Ser. B 98(1-3) 49-71.
16. Bertsimas, D., M. Sim. 2004. The price of robustness. Oper. Res. 52(1) 35-53. (Pubitemid 40000812)
17. Bertsimas, D., A. Thiele. 2006. A robust optimization approach to inventory theory. Oper. Res. 54(1) 150-168.
18. Bienstock, D., N. Ozbay. 2008. Computing robust basestock levels. Discrete Optim. 5(2) 389-414. (Pubitemid 351443142)
19. Campbell, A. M., M. W. P. Savelsbergh. 2004. A decomposition approach for the inventory routing problem. Transportation Sci. 38(4) 488-502.
20. Campbell, A. M., L. W. Clarke, M. W. P. Savelsbergh. 1998. The inventory routing problem. T. G. Crainic, G. Laporte, eds. Management and Logistics. Kluwer, Boston, 95-113.
21. Campbell, A. M., L. W. Clarke, M. W. P. Savelsbergh. 2002. Inventory routing in practice. P. Toth, D. Vigo, eds. Vehicle Routing Problem. Society for Industrial and Applied Mathematics, Philadelphia, 309-330.
22. Çetinkaya, S., C. T. Lee. 2000. Stock replenishment and shipment scheduling for vendor-managed inventory systems. Management Sci. 46(2) 217-232. (Pubitemid 30594359)
23. Chan, L. M. A., A. Federgruen, D. Simchi-Levi. 1998. Probabilistic analyses and practical algorithms for inventory-routing models. Oper. Res. 46(1) 96-106. (Pubitemid 128665776)
24. Chien, T. W., A. Balakrishnan, R. T. Wong. 1989. An integrated inventory allocation and vehicle routing problem. Transportation Sci. 23(2) 67-76.
25. Dror, M., M. O. Ball. 1987. Inventory/routing: Reduction from an annual to a short-period problem. Naval Res. Logist. 34(6) 891-905. (Pubitemid 18520153)
26. El-Ghaoui, L., H. Lebret. 1997. Robust solutions to least-square problems to uncertain data matrices. SIAM J. Matrix Anal. Appl. 18(4) 1035-1064.
27. El-Ghaoui, L., F. Oustry, H. Lebret. 1998. Robust solutions to uncertain semidefinite programs. SIAM J. Optim. 9(1) 33-52.
28. Federgruen, A., P. Zipkin. 1984. A combined vehicle routing and inventory allocation problem. Oper. Res. 32(5) 1019-1037. (Pubitemid 15424953)
29. Hvattum, L. M., A. Løkketangen. 2009. Using scenario trees and progressive hedging for stochastic inventory routing problems. J. Heuristics 15(6) 527-557.
30. Hvattum, L. M., A. Løkketangen, G. Laporte. 2009. Scenario treebased heuristics for stochastic inventory routing problems. INFORMS J. Comput. 21(2) 268-285.
31. Kleywegt, A. J., V. S. Nori, M. W. P. Savelsbergh. 2002. The stochastic inventory routing problem with direct deliveries. Transportation Sci. 36(1) 94-118. (Pubitemid 34268736)
32. Kleywegt, A. J., V. S. Nori, M. W. P. Savelsbergh. 2004. Dynamic programming approximation for a stochastic inventory routing problem. Transportation Sci. 38(1) 42-70.
33. Laporte, G. 2007. What you should know about the vehicle routing problem. Naval Res. Logist. 54(8) 811-819. (Pubitemid 350189025)
34. Moin, N. H., S. Salhi. 2007. Inventory routing problems: A logistical overview. J. Oper. Res. Soc. 58(9) 1185-1194. (Pubitemid 47229576)
35. Padberg, M. W., G. Rinaldi. 1991. A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev. 33(1) 60-100.
36. Pochet, Y., L. A. Wolsey. 1988. Lot-size models with backlogging: Strong reformulations and cutting planes. Math. Programming 40 317-335. (Pubitemid 18621263)
37. See, C.-T., M. Sim. 2010. Robust approximation to multiperiod inventory management. Oper. Res. 58(3) 583-594.
38. Solyali, O., H. Süral. 2011. A branch-and-cut algorithm using a strong formulation and an a priori tour-based heuristic for an inventory-routing problem. Transportation Sci. 45(3) 335-345.
39. Soyster, A. L. 1973. Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper. Res. 21(5) 1154-1157.
40. Viswanathan, S., K. Mathur. 1997. Integrating routing and inventory decisions in one-warehouse multiretailer multiproduct distribution systems. Management Sci. 43(3) 294-312. (Pubitemid 127582107)
41. Yugang, Y., C. Haoxun, C. Feng. 2008. A new model and hybrid approach for large scale inventory routing problems. Eur. J. Oper. Res. 189(3) 1022-1040.