A VNS approach to multi-location inventory redistribution with vehicle routing

Computers and Operations Research

Volumn 78, Issue , 2017, Pages 526-536

  Turan, Belma ^a   Minner, Stefan ^b   Hartl, Richard F ^a  

^a UNIVERSITY OF VIENNA   (Austria)

^b TUM SCHOOL OF MANAGEMENT   (Germany)

Author keywords

Inventory allocation; Newsvendor model; Redistribution; Stochastic demand; Transshipment; Variable neighborhood search; VRP with profits

Indexed keywords

COSTS; DYNAMIC PROGRAMMING; OPTIMIZATION; SALES; STOCHASTIC MODELS; STOCHASTIC SYSTEMS; VEHICLE ROUTING;

INVENTORY ALLOCATION; NEWSVENDOR MODELS; REDISTRIBUTION; STOCHASTIC DEMAND; TRANSSHIPMENT; VARIABLE NEIGHBORHOOD SEARCH;

RETAIL STORES;

EID: 84961859400     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2016.02.018     Document Type: Article

References (45)

1. [1] Agrawal, V., Chao, X., Seshadri, S., Dynamic balancing of inventory in supply chains. Eur J Oper Res 159:2 (2004), 296–317.
2. [2] Allen, S., Computation for the redistribution model with set-up charge. Manag Sci 8:4 (1962), 482–489.
3. [3] Allen, S.C., Redistribution of total stock over several user locations. Naval Res Log Q 5:4 (1958), 337–345.
4. [4] Archetti C, Speranza MG, Vigo D. Vehicle routing problems with profits. Technical report. WPDEM2013/3, University of Brescia; 2013.
5. [5] Axsäter, S., Inventory control, springer science & business media. 2nd ed., 2006.
6. [6] Bertrand, L.P., Bookbinder, J.H., Stock redistribution in two-echelon logistics systems. J Oper Res Soc 49:9 (1998), 966–975.
7. [7] Christofides, N., The vehicle routing problem. RAIRO—Oper Res—Rech Opér 10:V1 (1976), 55–70.
8. [8] Christofides N. Combinatorial optimization. In: Christofides, Nicos, editors. A Wiley-Interscience Publication. Based on a series of lectures, given at the Summer School in Combinatorial Optimization, held in Sogesta, vol. 1, Italy, May 30–June 11, 1977. Chichester: Wiley; 1979.
9. [9] Coelho, L.C., Cordeau, J.-F., Laporte, G., Thirty years of inventory routing. Transport Sci 48:1 (2013), 1–19.
10. [10] Coelho, L.C., Cordeau, J.-F., Laporte, G., The inventory-routing problem with transshipment. Comput Oper Res 39:11 (2012), 2537–2548.
11. [11] Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., Schrijver, A., The traveling salesman problem combinatorial optimization. first ed., 2008, 241–271.
12. [12] Das, C., Supply and redistribution rules for two-location inventory systems: one-period analysis. Manag Sci 21:7 (1975), 765–776.
13. [13] Feillet, D., Dejax, P., Gendreau, M., Traveling salesman problems with profits. Transport Sci 39:2 (2005), 188–205.
14. [14] Flood, M.M., The traveling-salesman problem. Oper Res 4:1 (1956), 61–75.
15. [15] Golden, B.L., Raghavan, S., Wasil, E.A., The vehicle routing problem: latest advances and new challenges. 2008, Springer, Berlin, Heidelberg, New York.
16. [16] Gross, D., Centralized inventory control in multilocation supply systems. Multistage inventory models and techniques, 1963, Stanford University Press, Stanford, CA, 47–84.
17. [17] Hansen, P., Mladenović, N., Variable neighborhood search: principles and applications. Eur J Oper Res 130:3 (2001), 449–467.
18. [18] Hansen, P., Mladenović, N., First vs. best improvement: an empirical study. Discrete Appl Math 154:5 (2006), 802–817.
19. [19] Hansen, P., Mladenović, N., Pérez, J.A.M., Variable neighbourhood search: methods and applications. Ann Oper Res 175:1 (2010), 367–407.
20. [20] Hing-Ling Lau, A., Lau, H.S., Decision models for single-period products with two ordering opportunities. Int J Prod Econ 55:1 (1998), 57–70.
21. [21] Jönsson, H., Silver, E.A., Analysis of a two-echelon inventory control system with complete redistribution. Manag Sci 33:2 (1987), 215–227.
22. [22] Karmarkar, U.S., The multiperiod multilocation inventory problem. Oper Res 29:2 (1981), 215–228.
23. [23] Karmarkar, U.S., Patel, N.R., The one-period, n-location distribution problem. Naval Res Log Q 24:4 (1977), 559–575.
24. [24] Kiesmüller G, Minner S. Inventory redistribution for fashion products under demand parameter update. Technical report. Beta Report 275. Eindhoven, The Netherlands: Eindhoven University of Technology; 2009.
25. [25] Laporte, G., The vehicle routing problem: an overview of exact and approximate algorithms. Eur J Oper Res 59:3 (1992), 345–358.
26. [26] Lee, H., Whang, S., The impact of the secondary market on the supply chain. Manag Sci 48:6 (2002), 719–731.
27. [27] Lien, R.W., Iravani, S.M., Smilowitz, K., Tzur, M., An efficient and robust design for transshipment networks. Prod Oper Manag 20:5 (2011), 699–713.
28. [28] Mirzapour Al-e hashem, S.M.J., Rekik, Y., Multi-product multi-period inventory routing problem with a transshipment option: a green approach. Int J Prod Econ 157 (2014), 80–88.
29. [29] Mladenović, N., Hansen, P., Variable neighborhood search. Comput Oper Res 24:11 (1997), 1097–1100.
30. [30] Nonås, L.M., Jörnsten, K., Heuristics in the multi-location inventory system with transshipments. Kotzab, H., Westhaus, M., (eds.) Research methodologies in supply chain management, 2005, Physica-Verlag, Heidelberg, 509–524.
31. [31] Nonås, L.M., Jörnsten, K., Optimal solutions in the multi-location inventory system with transshipments. J Math Model Algorithms 6:1 (2007), 47–75.
32. [32] Paterson, C., Kiesmüller, G., Teunter, R., Glazebrook, K., Inventory models with lateral transshipments: a review. Eur J Oper Res 210:2 (2011), 125–136.
33. [33] Pisinger, D., Ropke, S., A general heuristic for vehicle routing problems. Comput Oper Res 34:8 (2007), 2403–2435.
34. [34] Popović, D., Vidović, M., Radivojević, G., Variable neighborhood search heuristic for the inventory routing problem in fuel delivery. Expert Syst Appl 39:18 (2012), 13390–13398.
35. [35] Reinelt, G., TSPLIB—a traveling salesman problem library. ORSA J Comput 3:4 (1991), 376–384.
36. [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. [37] Smirnov, D., Gerchak, Y., Inventory sharing via circular unidirectional chaining. Eur J Oper Res 237:2 (2014), 474–486.
38. [38] Tagaras, G., Vlachos, D., Effectiveness of stock transshipment under various demand distributions and nonnegligible transshipment times. Prod Oper Manag 11:2 (2002), 183–198.
39. [39] Toth, P., Vigo, D., Vehicle routing: problems, methods, and applications. 2nd ed, 2014, SIAM, Philadelphia.
40. [40] Trick, M.A., A linear relaxation heuristic for the generalized assignment problem. Naval Res Log 39:2 (1992), 137–151.
41. [41] Turan B. Inventory routing problem with perishable products [Ph.D. thesis]; 2016.
42. [42] Turan B, Minner S, Hartl RF. A multi-newsvendor distribution system with resupply and vehicle routing. Working paper presented at NOW conference, La Rochelle, France; May 18–20, 2015.
43. [43] Vansteenwegen, P., Souffriau, W., Vanden Berghe, G., Oudheusden, D.V., A guided local search metaheuristic for the team orienteering problem. Eur J Oper Res 196:1 (2009), 118–127.
44. [44] Vansteenwegen, P., Souffriau, W., Oudheusden, D.V., The orienteering problem: a survey. Eur J Oper Res 209:1 (2011), 1–10.
45. [45] Vansteenwegen, P., Souffriau, W., Berghe, G.V., Van Oudheusden, D., Metaheuristics for tourist trip planning. Geiger, M., Habenicht, W., Sevaux, M., Sörensen, K., (eds.) Metaheuristics in the service industry, 2009, Springer, Berlin, Heidelberg, New York, 15–31.