Min-Max exact and heuristic policies for a two-echelon supply chain with inventory and transportation procurement decisions

Transportation Research Part E: Logistics and Transportation Review

Volumn 93, Issue , 2016, Pages 57-70

  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; Matheuristic algorithms; Min Max policies; Transportation procurement; Uncertain demand

Indexed keywords

ALGORITHM; INVENTORY; LOGISTICS; OPTIMIZATION; SUPPLY CHAIN MANAGEMENT; TRANSPORTATION;

EID: 84969919783     PISSN: 13665545     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tre.2016.05.008     Document Type: Article

References (27)

1. 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:1515-1536.
2. Archetti C., Bertazzi L., Laporte G., Speranza M. A branch-and-cut algorithm for a vendor-managed inventory-routing problem. Transp. Sci. 2007, 41(3):382-391.
3. Ben-Tal A., El Ghaoui L., Nemirovski A. Robust Optimization 2009, Princeton University Press.
4. Bertazzi L., Speranza M. Matheuristics for inventory routing problems. Hybrid Algorithms for Service, Computing and Manufacturing Systems: Routing and Scheduling Solutions 2011, 1-14. IGI Global, Hershey.
5. Bertazzi L., Speranza M. Inventory routing problems: an introduction. EURO J. Transp. Logist. 2012, 1:307-326.
6. Bertazzi L., Speranza M. Inventory routing with multiple customers. EURO J. Transp. Logist. 2013, 2:255-275.
7. Bertazzi L., Savelsbergh M., Speranza M. Inventory routing. The Vehicle Routing Problem, Latest Advances and New Challenges 2008, Springer. B. Golden, S. Raghavan, E. Wasil (Eds.).
8. Bertazzi L., Bosco A., Guerriero F., Laganà D. A stochastic inventory routing problem with stock-out. Transp. Res. Part C: Emerg. Technol. 2013, 27:89-107.
9. Bertazzi L., Bosco A., Laganà D. Managing stochastic demand in an inventory routing problem with transportation procurement. Omega 2015, 56:112-121.
10. Bertsekas D. Dynamic Programming and Optimal Control 2005, Athena Scientific.
11. Bertsimas D., Sim M. Robust discrete optimization and network flows. Math. Program. Ser. B 2003, 98:49-71.
12. Bertsimas D., Sim M. The price of robustness. Oper. Res. 2004, 52(1):35-53.
13. Campbell A., Clarke L., Kleywegt A., Savelsbergh M. The inventory routing problem. Fleet Management and Logistics 1998, Kluwer. T.G. Crainic, G. Laporte (Eds.).
14. Clark A.J., Scarf H. Optimal policies for a multi-echelon inventory problem. Manage. Sci. 1960, 6:475-490.
15. Coelho L., Cordeau J., Laporte G. Thirty years of inventory-routing. Transp. Sci. 2013, 48:1-19.
16. Cordeau J.-F., Laganà D., Musmanno R., Vocaturo F. A decomposition-based heuristic for the multiple-product inventory-routing problem. Comput. Oper. Res. 2015, 55:153-166.
17. Desaulniers G., Rakke J., Coelho L. A branch-price-and-cut algorithm for the inventory-routing problem. Transp. Sci. 2015, 10.1287/trsc.2015.0635.
18. Eruguz A.S., Sahin E., Jemai Z., Dallery Y. A comprehensive survey of guaranteed-service models for multi-echelon inventory optimization. Int. J. Prod. Econ. 2016, 172:110-125.
19. Huang S.-H., Lin P.-C. A modified ant colony optimization algorithm for multi-item inventory routing problems with demand uncertainty. Transp. Res. Part E: Logist. Transp. Rev. 2010, 46:598-611.
20. Javid A., Azad N. Incorporating location, routing and inventory decisions in supply chain network design. Transp. Res. Part E: Logist. Transp. Rev. 2010, 46:582-597.
21. Jothi Basu R., Subramanian N., Cheikhrouhou N. Review of full truckload transportation service procurement. Transp. Rev. 2015, 35:599-621.
22. Klosterhalfen S., Minner S. Safety stock optimisation in distribution systems: a comparison of two competing approaches. Int. J. Logist.: Res. Appl. 2010, 13:99-120.
23. Niakan F., Rahimi M. A multi-objective healthcare inventory routing problem; a fuzzy possibilistic approach. Transp. Res. Part E: Logist. Transp. Rev. 2015, 80:74-94.
24. Powell W. Approximate Dynamic Programming: Solving the Curses of Dimensionality 2011, John Wiley & Sons, Inc.
25. Shapiro A. A dynamic programming approach to adjustable robust optimization. Oper. Res. Lett. 2011, 39:83-87.
26. Simpson J., Kenneth F. In-process inventories. Oper. Res. 1958, 6:863-873.
27. Solyali O., Cordeau J.-F., Laporte G. Robust inventory routing under demand uncertainty. Transp. Sci. 2012, 46:327-340.