Solution methods for vehicle-based inventory routing problems

Computers and Chemical Engineering

Volumn 101, Issue , 2017, Pages 259-278

  Dong, Yachao ^a   Maravelias, Christos T ^a   Pinto, Jose M ^b   Sundaramoorthy, Arul ^b  

^a University of Wisconsin Madison   (United States)

^b PRAXAIR INC   (United States)

Author keywords

Decomposition method; Mixed integer programming; Network reduction algorithm; Vendor managed inventory

Indexed keywords

CONTINUOUS TIME SYSTEMS; INTEGER PROGRAMMING; VEHICLE ROUTING; VEHICLES;

COMPUTATIONAL RESULTS; DECOMPOSITION METHODS; INVENTORY ROUTING PROBLEMS; MIXED INTEGER PROGRAMMING; NETWORK REDUCTION; PRE-PROCESSING ALGORITHMS; VEHICLE ROUTING PROBLEMS; VENDOR MANAGED INVENTORY;

ITERATIVE METHODS;

EID: 85015671458     PISSN: 00981354     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.compchemeng.2017.02.036     Document Type: Article

References (42)

1. Adulyasak, Y., Cordeau, J.F., Jans, R., Benders decomposition for production routing under demand uncertainty. Oper. Res. 63:4 (2015), 851–867.
2. Al-Khayyal, F., Hwang, S.J., Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk. Part I: Applications and model. Eur. J. Oper. Res. 176:1 (2007), 106–130.
3. Andersson, H., Hoff, A., Christiansen, M., Hasle, G., Løkketangen, A., Industrial aspects and literature survey: combined inventory management and routing. Comput. Oper. Res. 37:9 (2010), 1515–1536.
4. Archetti, C., Bertazzi, L., Laporte, G., Speranza, M.G., A branch-and-cut algorithm for a vendor-managed inventory-routing problem. Transport. Sci. 41:3 (2007), 382–391.
5. Avella, P., Boccia, M., Wolsey, L.A., Single-item reformulations for a vendor managed inventory routing problem: computational experience with benchmark instances. Networks 65:2 (2015), 129–138.
6. Aziz, N.A.B., Moin, N.H., Genetic algorithm based approach for the multi product multi period inventory routing problem. Proceedings of International Conference on Industrial Engineering and Engineering Management, 2007, 1619–1623.
7. Baita, F., Ukovich, W., Pesenti, R., Favaretto, D., Dynamic routing-and-inventory problems: a review. Transport. Res. A: Pol. 32:8 (1998), 585–598.
8. Bard, J.F., Nananukul, N., A branch-and-price algorithm for an integrated production and inventory routing problem. Comput. Oper. Res. 37:12 (2010), 2202–2217.
9. Campbell, A.M., Savelsbergh, M.W.P., A decomposition approach for the inventory-routing problem. Transport. Sci. 38:4 (2004), 488–502.
10. Coelho, L.C., Cordeau, J.F., Laporte, G., Thirty years of inventory-routing. Transport. Sci. 48:1 (2014), 1–19.
11. Coelho, L.C., Laporte, G., An optimised target-level inventory replenishment policy for vendor-managed inventory systems. Int. J. Prod. Res. 53:12 (2015), 3651–3660.
12. Christiansen, M., Fagerholt, K., Flatberg, T., Haugen, O., Kloster, O., Lund, E.H., Maritime inventory routing with multiple products: a case study from the cement industry. Eur. J. Oper. Res. 208:1 (2011), 86–94.
13. Desaulniers, G., Rakke, J.G., Coelho, L.C., A branch-price-and-cut algorithm for the inventory routing problem. Transport. Sci. 50:3 (2016), 1060–1076.
14. Disney, S.M., Potter, A.T., Gardner, B.M., The impact of vendor managed inventory on transport operations. Transport. Res. E: Log. 39:5 (2003), 363–380.
15. Dong, Y., Pinto, J.M., Sundaramoorthy, A., Maravelias, C.T., MIP model for inventory routing in industrial gases supply chain. Ind. Eng. Chem. Res. 53:44 (2014), 17214–17225.
16. Eppen, G.D., Martin, R.K., Determining safety stock in the presence of stochastic lead time and demand. Manage. Sci. 34:11 (1988), 1380–1390.
17. Gaur, V., Fisher, M.L., A periodic inventory routing problem at a supermarket chain. Oper. Res. 52:6 (2004), 813–822.
18. Goel, A., Vehicle scheduling and routing with drivers’ working hours. Transport. Sci. 43:1 (2009), 17–26.
19. Goel, A., The minimum duration truck driver scheduling problem. EURO J. Transp. Logist. 1:4 (2012), 285–306.
20. Gounaris, C.E., Wiesemann, W., Floudas, C.A., The robust capacitated vehicle routing problem under demand uncertainty. Oper. Res. 61:3 (2013), 677–693.
21. Grønhaug, R., Christiansen, M., Desaulniers, G., Descrosiers, J., A branch-and-price method for a liquefied natural gas inventory routing problem. Transport. Sci. 44:3 (2010), 400–415.
22. Harjunkoski, I., Grossmann, I.E., Decomposition techniques for multistage scheduling problems using mixed-integer and constraint programming methods. Comput. Chem. Eng. 26:11 (2002), 1533–1552.
23. Hewitt, M., Nemhauser, G., Savelsbergh, M., Song, J.H., A branch-and-price guided search approach to maritime inventory routing. Comput. Oper. Res. 40:5 (2013), 1410–1419.
24. Hooker, J.N., Ottosson, G., Thornsteinsson, E.S., Kim, H.-J., A scheme for unifying optimization and constraint satisfaction methods. Knowl. Eng. Rev. 15 (2000), 11–30.
25. Jetlund, A.S., Karimi, I.A., Improving the logistics of multi-compartment chemical tankers. Comput. Chem. Eng. 28:8 (2004), 1267–1283.
26. Jiang, Y., Grossmann, I.E., Alternative mixed-integer linear programming models of a maritime inventory routing problem. Comput. Chem. Eng. 77 (2015), 147–161.
27. Maravelias, C.T., A decomposition framework for the scheduling of single- and multi-stage processes. Comput. Chem. Eng. 30:3 (2006), 407–420.
28. Moin, N.H., Salhi, S., Inventory routing problems: a logistical overview. J. Oper. Res. Soc. 58:9 (2007), 1185–1194.
29. Niakan, F., Rahimi, M., A multi-objective healthcare inventory routing problem; a fuzzy possibilistic approach. Transport. Res. E: Log. 80 (2015), 74–94.
30. Papageorgiou, D.J., Keha, A.B., Nemhauser, G.L., Sokol, J., Two-stage decomposition algorithms for single product maritime inventory routing. INFORMS J. Comput. 26:4 (2014), 825–847.
31. Papageorgiou, D.J., Nemhauser, G.L., Sokol, J., Cheon, M.S., Keha, A.B., MIRPLib – a library of maritime inventory routing problem instances: survey, core model, and benchmark results. Eur. J. Oper. Res. 235:2 (2014), 350–366.
32. Persson, J.A., Göthe-Lundgren, M., Shipment planning at oil refineries using column generation and valid inequalities. Eur. J. Oper. Res. 163:3 (2005), 631–652.
33. Raa, B., Fleet optimization for cyclic inventory routing problems. Int. J. Prod. Econ. 160 (2015), 172–181.
34. Rancourt, M.E., Cordeau, J.F., Laporte, G., Long-haul vehicle routing and scheduling with working hour rules. Transport. Sci. 47:1 (2013), 81–107.
35. Savelsbergh, M., Song, J.H., Inventory routing with continuous moves. Comput. Oper. Res. 34:6 (2007), 1744–1763.
36. Shen, Q., Chu, F., Chen, H., A Lagrangian relaxation approach for a multi-mode inventory routing problem with transshipment in crude oil transportation. Comput. Chem. Eng. 35:10 (2011), 2113–2123.
37. Singh, T., Arbogast, J.E., Neagu, N., An incremental approach using local-search heuristic for inventory routing problem in industrial gases. Comput. Chem. Eng. 80 (2015), 199–210.
38. Siswanto, N., Essam, D., Sarker, R., Solving the ship inventory routing and scheduling problem with undedicated compartments. Comput. Ind. Eng. 61:2 (2011), 289–299.
39. Song, J.H., Furman, K.C., A maritime inventory routing problem: practical approach. Comput. Oper. Res. 40:3 (2013), 657–665.
40. You, F., Pinto, J.M., Capon, E., Grossmann, I.E., Arora, N., Megan, L., Optimal distribution-inventory planning of industrial gases. I. Fast computational strategies for large-scale problems. Ind. Eng. Chem. Res. 50:5 (2011), 2910–2927.
41. Yu, Y., Chu, F., Chen, H., A model and algorithm for large scale stochastic inventory routing problem. Proceedings of Service Systems and Service Management International Conference, 2006, 355–360.
42. Zhang, Q., Sundaramoorthy, A., Grossmann, I.E., Pinto, J.M., Multiscale production routing in multicommodity supply chains with complex production facilities. Comput. Oper. Res. 79 (2017), 207–222.