Robust Inventory Routing Under Demand Uncertainty

References

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