A survey on the inventory-routing problem with stochastic lead times and demands

Journal of Applied Logic

Volumn 24, Issue , 2017, Pages 15-24

  Roldán, Raúl F ^a,b   Basagoiti, Rosa ^a   Coelho, Leandro C ^c  

^a MONDRAGON UNIVERSITY   (Spain)

^b Engineering Faculty   (Colombia)

^c INTERUNIVERSITY RESEARCH CENTRE ON ENTERPRISE NETWORKS   (Canada)

Author keywords

Inventory policy; Inventory routing problem; Stochastic demand; Stochastic lead time; Survey

Indexed keywords

INFORMATION MANAGEMENT; INVENTORY CONTROL; STOCHASTIC CONTROL SYSTEMS; SUPPLY CHAINS; SURVEYING; SURVEYS;

COORDINATION LEVELS; DISTRIBUTION MANAGEMENT; INVENTORY POLICIES; INVENTORY ROUTING PROBLEMS; STOCHASTIC DEMAND; STOCHASTIC LEAD TIME; STOCHASTIC LEAD-TIMES; STOCHASTIC PROBLEMS;

STOCHASTIC SYSTEMS;

EID: 85007043788     PISSN: 15708683     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jal.2016.11.010     Document Type: Article

References (66)

1. Agra, A., Christiansen, M., Delgado, A., Simonetti, L., Hybrid heuristics for a short sea inventory routing problem. Eur. J. Oper. Res. 236:3 (2014), 924–935.
2. Archetti, C., Bertazzi, L., Laporte, G., Speranza, M.G., A branch-and-cut algorithm for a vendor-managed inventory-routing problem. Transp. Sci. 41:3 (2007), 382–391.
3. Archetti, C., Bertazzi, L., Hertz, A., Speranza, M.G., A hybrid heuristic for an inventory routing problem. INFORMS J. Comput. 24:1 (2012), 101–116.
4. Archetti, C., Doerner, K.F., Tricoire, F., A heuristic algorithm for the free newspaper delivery problem. Eur. J. Oper. Res. 230:2 (2013), 245–257.
5. Axsäter, S., Evaluation of installation stock based (r,q)-policies for two-level inventory systems with Poisson demand. Oper. Res. 43:3 suppl. 1 (1998), 135–145.
6. Axsäter, S., Inventory Control. International Series in Operations Research & Management Science, vol. 225, 2015, Springer International Publishing, Lund.
7. Berling, P., Marklund, J., Multi-echelon inventory control: an adjusted normal demand model for implementation in practice. Int. J. Prod. Res. 52:11 (2014), 3331–3347.
8. Bertazzi, L., Savelsbergh, M., Speranza, M.G., Inventory routing. Oper. Res./Comput. Sci. Interfaces Ser. 43 (2008), 49–72.
9. Bertazzi, L., Bosco, A., Guerriero, F., Lagana, D., A stochastic inventory routing problem with stock-out. Transp. Res., Part C, Emerg. Technol. 27 (2013), 89–107.
10. Bertazzi, L., Bosco, A., Laganà, D., Managing stochastic demand in an inventory routing problem with transportation procurement. Omega 56 (2015), 112–121.
11. Beyer, D., Cheng, F., Sethi, S.P., Taksar, M., Markovian Demand Inventory Models. International Series in Operations Research & Management Science, vol. 108, 2009, Springer, New York.
12. Chao, X., Zhou, S.X., Joint inventory-and-pricing strategy for a stochastic continuous-review system. IIE Trans. 38:5 (2006), 401–408.
13. Cheng, C.-B., Wang, K.-P., Solving a vehicle routing problem with time windows by a decomposition technique and a genetic algorithm. Expert Syst. Appl. 36:4 (2009), 7758–7763.
14. Chopra, S., Meindl, P., Supply Chain Management: Strategy, Planning, and Operation. 2015, Pearson Education, New York.
15. 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.
16. Coelho, L.C., Laporte, G., A branch-and-cut algorithm for the multi-product multi-vehicle inventory-routing problem. Int. J. Prod. Res. 51:23–24 (2013), 7156–7169.
17. Coelho, L.C., Laporte, G., Improved solutions for inventory-routing problems through valid inequalities and input ordering. Int. J. Prod. Econ. 155 (2014), 391–397.
18. Coelho, L.C., Follmann, N., Rodriguez, C.M.T., The bullwhip effect in the supply chain – an indicator proposal. Gest. Prod. 16:4 (2009), 571–583.
19. Coelho, L.C., Cordeau, J.-F., Laporte, G., The inventory-routing problem with transshipment. Comput. Oper. Res. 39:11 (2012), 2537–2548.
20. Coelho, L.C., Cordeau, J.-F., Laporte, G., Thirty years of inventory routing. Transp. Sci. 48:1 (2014), 1–19.
21. Coelho, L.C., Cordeau, J.-F., Laporte, G., Heuristics for dynamic and stochastic inventory-routing. Comput. Oper. Res. 52 (Part A) (2014), 55–67.
22. Desaulniers, G., Rakke, J.G., Coelho, L.C., A branch-price-and-cut algorithm for the inventory-routing problem. Transp. Sci., 2015, 10.1287/trsc.2015.0635 forthcoming.
23. Farvid, M., Rosling, K., The discounted (r,q) inventory model – the shrewd accountant's heuristic. Int. J. Prod. Econ. 149 (2014), 17–27.
24. Gavirneni, S., Kapuscinski, R., Tayur, S., Value of information in capacitated supply chains. Manag. Sci. 45:1 (1999), 16–24.
25. Giard, V., Sali, M., The bullwhip effect in supply chains: a study of contingent and incomplete literature. Int. J. Prod. Res. 51:13 (2013), 3880–3893.
26. Guasch, J.L., Logistic Costs in Latin America and Caribbean. Technical report, 2008, Banco Mundial, Washington, DC.
27. Guasch, J.L., Kogan, J., Inventories and logistic costs in developing countries: levels and determinants – a red flag for competitiveness and growth. Rev. Competencia Prop. Intel., 1(1), 2005.
28. Harris, F.W., How many parts to make at once. Oper. Res. 38:6 (1990), 947–950.
29. He, Y., Miao, W., Xie, R., Shi, Y., A tabu search algorithm with variable cluster grouping for multi-depot vehicle routing problem. Proceedings of the 2014 IEEE 18th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2014, 2014, 12–17.
30. Javid, A.A., Azad, N., Incorporating location, routing and inventory decisions in supply chain network design. Transp. Res., Part E, Logist. Transp. Rev. 46:5 (2010), 582–597.
31. Jensen, P.A., Bard, J.F., Operations Research Models and Methods. Operations Research: Models and Methods, vol. 1, 2003, Wiley, New York.
32. Kleywegt, A.J., Nori, V.S., Savelsbergh, M.W.P., The stochastic inventory routing problem with direct deliveries. Transp. Sci. 36:1 (2002), 94–118.
33. Kleywegt, A.J., Non, V.S., Savelsbergh, M.W.P., Dynamic programming approximations for a stochastic inventory routing problem. Transp. Sci. 38:1 (2004), 42–70.
34. Labadie, N., Prins, C., Vehicle routing nowadays: compact review and emerging problems. Production Systems and Supply Chain Management in Emerging Countries: Best Practices, 2012, Springer, Berlin, Heidelberg, 141–166.
35. Larsen, C., Turkensteen, M., A vendor managed inventory model using continuous approximations for route length estimates and Markov chain modeling for cost estimates. Int. J. Prod. Econ. 157 (2014), 120–132.
36. Li, Y., Guo, H., Wang, L., Fu, J., A hybrid genetic-simulated annealing algorithm for the location-inventory-routing problem considering returns under e-supply chain environment. Sci. World J., 2013, 2013.
37. Li, K., Chen, B., Sivakumar, A.I., Wu, Y., An inventory-routing problem with the objective of travel time minimization. Eur. J. Oper. Res. 236:3 (2014), 936–945.
38. Liu, S.-C., Lee, W.-T., A heuristic method for the inventory routing problem with time windows. Expert Syst. Appl. 38:10 (2011), 13223–13231.
39. Liu, S.-C., Lin, C.C., A heuristic method for the combined location routing and inventory problem. Int. J. Adv. Manuf. Technol. 26:4 (2005), 372–381.
40. Luo, J., Chen, M.-R., Improved shuffled frog leaping algorithm and its multi-phase model for multi-depot vehicle routing problem. Expert Syst. Appl. 41:5 (2014), 2535–2545.
41. Luo, J., Chen, M.-R., Multi-phase modified shuffled frog leaping algorithm with extremal optimization for the MDVRP and the MDVRPTW. Comput. Ind. Eng. 72:1 (2014), 84–97.
42. Moin, N.H., Salhi, S., Inventory routing problems: a logistical overview. J. Oper. Res. Soc. 58:9 (2007), 1185–1194.
43. Nananukul, N., Clustering model and algorithm for production inventory and distribution problem. Appl. Math. Model. 37:24 (2013), 9846–9857.
44. Papageorgiou, D., Nemhauser, G., Sokol, J., Cheon, M.-S., Keha, A., MIRPLib – a library of maritime inventory routing problem instances: survey, core model, and benchmark results. Eur. J. Oper. Res. 235:2 (2013), 350–366.
45. Psaraftis, H.N., Dynamic vehicle routing: status and prospects. Ann. Oper. Res. 61:1 (1995), 143–164.
46. Qin, L., Miao, L., Ruan, Q., Zhang, Y., A local search method for periodic inventory routing problem. Expert Syst. Appl. 41:2 (2014), 765–778.
47. Reiman, M.I., Rubio, R., Wein, L.M., Heavy traffic analysis of the dynamic stochastic inventory-routing problem. Transp. Sci. 4:33 (1999), 361–380.
48. Saffari, M., Haji, R., Queueing system with inventory for two-echelon supply chain. International Conference on Computers and Industrial Engineering, Troyes, 2009, 835–838.
49. Saffari, M., Haji, R., Hassanzadeh, F., A queueing system with inventory and mixed exponentially distributed lead times. Int. J. Adv. Manuf. Technol. 53:9–12 (2011), 1231–1237.
50. Saffari, M., Asmussen, S., Haji, R., The M/M/1 queue with inventory, lost sale, and general lead times. Queueing Syst. 75:1 (2013), 65–77.
51. Sajjadi, S.R., Cheraghi, S.H., Multi-products location-routing problem integrated with inventory under stochastic demand. Int. J. Ind. Syst. Eng. 7:4 (2011), 454–476.
52. Sapna Isotupa, K.P., Samanta, S.K., A continuous review (s,Q) inventory system with priority customers and arbitrarily distributed lead times. Math. Comput. Model. 57:5–6 (2013), 1259–1269.
53. Schwarz, M., Sauer, C., Daduna, H., Kulik, R., Szekli, R., M/M/1 queueing systems with inventory. Queueing Syst. 54:1 (2006), 55–78.
54. Simic, D., Simic, S., Evolutionary approach in inventory routing problem. Lect. Notes Comput. Sci. 7903 LNCS (Part 2) (2013), 395–403.
55. Song, J.-S., Effect of leadtime uncertainty in a simple stochastic inventory model. Manag. Sci. 40:5 (1994), 603–613.
56. Song, J.-S., Zipkin, P., Inventories with multiple supply sources and networks of queues with overflow bypasses. Manag. Sci. 55:3 (2009), 362–372.
57. Stodola, P., Mazal, J., Ant colony optimization algorithm for multi-depot vehicle routing problem with time windows. 1st International Conference on Engineering and Applied Sciences Optimization, Proceedings, OPT-i 2014, 2014, 184–192.
58. Stodola, P., Mazal, J., Tactical models based on a multi-depot vehicle routing problem using the ant colony optimization algorithm. Int. J. Math. Models Methods Appl. Sci. 9 (2015), 330–337.
59. Timme, S.G., Williams-Timme, C., The real cost of holding inventory. Supply Chain Manag. Rev. 7 (2003), 30–37.
60. Wagner, M., Inventory Routing: A Strategic Management Accounting Perspective. 2011, Hanken School of Economics.
61. Wang, X., Continuous review inventory model with variable lead time in a fuzzy random environment. Expert Syst. Appl. 38:9 (2011), 11715–11721.
62. Wensing, T., Periodic review inventory systems. Lect. Notes Econ. Math. Syst., 651, 2011.
63. Xu, D., Xiao, R., An improved genetic clustering algorithm for the multi-depot vehicle routing problem. Int. J. Wirel. Mob. Comput. 9:1 (2015), 1–7.
64. You, F., Pinto, J.M., Grossmann, I.E., Megan, L., Optimal distribution-inventory planning of industrial gases – MINLP models and algorithms for stochastic cases. Ind. Eng. Chem. Res. 50:5 (2011), 2928–2945.
65. Yücenur, G.N., Demirel, N.C., A new geometric shape-based genetic clustering algorithm for the multi-depot vehicle routing problem. Expert Syst. Appl. 38:9 (2011), 11859–11865.
66. Zeng, W., He, Y.L., Zheng, X.J., An ant colony algorithm with memory grouping list for multi-depot vehicle routing problem. Adv. Mater. Res. 926–930 (2014), 3354–3358.