Data-driven assignment of delivery patterns with handling effort considerations in retail

Computers and Operations Research

Volumn 100, Issue , 2018, Pages 379-393

  Taube, F ^a   Minner, S ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Handling effort; Hierarchical decomposition; Inventory; Joint replenishment; Retail

Indexed keywords

GENETIC ALGORITHMS; INTEGER PROGRAMMING; SALES; STOCHASTIC SYSTEMS; SUPPLY CHAINS; WAREHOUSES;

HANDLING EFFORT; HIERARCHICAL DECOMPOSITIONS; INVENTORY; JOINT REPLENISHMENT; RETAIL;

COSTS;

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

References (54)

1. Abdelmaguid, T.F., Dessouky, M.M., A genetic algorithm approach to the integrated inventory-distribution problem. Int. J. Prod. Econ. 44:21 (2006), 4445–4464.
2. Agrawal, N., Smith, S.A., Estimating negative binomial demand for retail inventory management with unobservable lost sales. Nav. Res. Logist. 43:6 (1996), 839–861.
3. Aksoy, Y., Erenguc, S.S., Multi-item inventory models with co-ordinated replenishments: a survey. Int. J. Oper. Prod. Manage. 8:1 (1988), 63–73.
4. Ban, G.-Y., Rudin, C., The big data newsvendor: practical insights from machine learning. MIT Sloan School of Management Working Paper Series 5032-13 (2014), 1–52.
5. Bertazzi, L., Paletta, G., Speranza, M.G., Minimizing the total cost in an integrated vendor-Managed inventory system. J. Heuristics 11:5–6 (2005), 393–419.
6. Bertsimas, D., Thiele, A., A robust optimization approach to inventory theory. Oper. Res. 54:1 (2006), 150–168.
7. Bertsimas, D., Thiele, A., Robust and data-Driven optimization: modern decision making under uncertainty. INFORMS Tutorials in Operations Research, 2014, 95–122.
8. Beutel, A.-L., Minner, S., Safety stock planning under causal demand forecasting. Int. J. Prod. Econ. 140:2 (2012), 637–645.
9. Boctor, F.F., Laporte, G., Renaud, J., Models and algorithms for the dynamic-demand joint replenishment problem. Int. J. Prod. Res. 42:13 (2004), 2667–2678.
10. Bookbinder, J.H., Tan, J.-Y., Strategies for the probabilistic lot-Sizing problem with service-Level constraints. Manage Sci. 34:9 (1988), 1096–1108.
11. Braglia, M., Castellano, D., Song, D., Distribution-free approach for stochastic Joint-Replenishment Problem with backorders-lost sales mixtures, and controllable major ordering cost and lead times. Comput. Oper. Res. 79 (2017), 161–173.
12. Campbell, A.M., Savelsbergh, M.W.P., A decomposition approach for the inventory-Routing problem. Transp. Sci. 38:4 (2004), 488–502.
13. Cárdenas-Barrón, L.E., González-Velarde, J.L., Treviño-Garza, G., A new approach to solve the multi-product multi-period inventory lot sizing with supplier selection problem. Comput. Oper. Res. 64 (2015), 225–232.
14. Chen, V.C.P., Tsui, K.-L., Barton, R.R., Meckesheimer, M., A review on design, modeling and applications of computer experiments. IIE Trans. 38:4 (2006), 273–291.
15. Chiang, C., Optimal ordering policies for periodic-review systems with replenishment cycles. Eur. J. Oper. Res. 170:1 (2006), 44–56.
16. Coelho, L.C., Cordeau, J.-F., Laporte, G., The inventory-routing problem with transshipment. Comput. Oper. Res. 39:11 (2012), 2537–2548.
17. Coelho, L.C., Cordeau, J.-F., Laporte, G., Thirty years of inventory routing. Transp. Sci. 48:1 (2013), 1–19.
18. Cordeau, J.-F., Laganà D., Musmanno, R., Vocaturo, F., A decomposition-based heuristic for the multiple-product inventory-routing problem. Comput. Oper. Res. 55 (2014), 153–166.
19. Curşeu, A., Van Woensel, T., Fransoo, J.C., Van Donselaar, K.H., Broekmeulen, R.A.C.M., Modelling handling operations in grocery retail stores: an empirical analysis. J. Oper. Res. Soc. 60:2 (2008), 200–214.
20. DeHoratius, N., Ton, Z., The Role of Execution in Managing Product Availability. Agrawal, N.M., Smith, S.A., (eds.) Retail supply chain management, 2009, Springer, New York, 53–77.
21. Drummond, L., Ochi, L.S., Vianna, D.S., An asynchronous parallel metaheuristic for the period vehicle routing problem. Future Gen. Comput. Syst. 17 (2001), 379–386.
22. Ehmke, J.F., Campbell, A.M., Thomas, B.W., Data-driven approaches for emissions-minimized paths in urban areas. Comput. Oper. Res. 67 (2016), 34–47.
23. Gao, L.L., Altay, N., Robinson, E.P., A comparative study of modeling and solution approaches for the coordinated lot-size problem with dynamic demand. Math. Comput. Model. 47:11–12 (2008), 1254–1263.
24. Gaur, V., Fisher, M.L., A periodic inventory routing problem at a supermarket chain. Oper. Res. 52:6 (2004), 813–822.
25. Groer, C., Golden, B., Wasil, E., The Consistent Vehicle Routing Problem. Manuf. Serv. Oper. Manage. 11:4 (2009), 630–643.
26. Hua, Z., Yang, J., Huang, F., Xu, X., A static-dynamic strategy for spare part inventory systems with nonstationary stochastic demand. J. Oper. Res. Soci. 60:9 (2009), 1254–1263.
27. Hübner, A., Schaal, K., Effect of replenishment and backroom on retail shelf-space planning. Bus. Res. 10:1 (2017), 123–156.
28. Iyer, A.V., Schrage, L.E., Analysis of the deterministic (s, S) inventory problem. Manage Sci. 38:9 (1992), 1299–1313.
29. Jaillet, P., Bard, J.F., Huang, L., Dror, M., Delivery cost approximations for inventory routing problems in a rolling horizon framework. Transp. Sci. 36:3 (2002), 292–300.
30. Khouja, M., Goyal, S.K., A review of the joint replenishment problem literature: 1989–2005. Eur. J. Oper. Res. 186:1 (2008), 1–16.
31. Kiesmüller, G.P., Broekmeulen, R.A.C.M., The benefit of VMI strategies in a stochastic multi-product serial two echelon system. Comput. Oper. Res. 37:2 (2010), 406–416.
32. Kirca, O., A primal-dual algorithm for the dynamic lotsizing problem with joint set-up costs. Nav. Res. Logist. 42:5 (1995), 791–806.
33. Kovacs, A.A., Parragh, S.N., Hartl, R.F., A template-based adaptive large neighborhood search for the consistent vehicle routing problem. Networks 63:1 (2014), 60–81.
34. Law, A.M., Simulation Modeling and Analysis, 5th, 2015, Mc Graw Hill, New York.
35. Löhndorf, N., Minner, S., Simulation optimization for the stochastic economic lot scheduling problem. IIE Trans. 45:7 (2013), 796–810.
36. Martel, A., Diaby, M., Boctor, F.F., Multiple items procurement under stochastic nonstationary demands. Eur. J. Oper. Res. 87:1 (1995), 74–92.
37. Mehrotra, M., Dawande, M., Gavirneni, S., Demirci, M., Tayur, S., OR PRACTICE–Production Planning with patterns: a problem from processed food manufacturing. Oper. Res. 59:2 (2011), 267–282.
38. Michalewicz, Z., Schmidt, M., Adaptive Business Intelligence. 2007, Springer, Berlin, Heidelberg, New York.
39. Minner, S., A comparison of simple heuristics for multi-product dynamic demand lot-sizing with limited warehouse capacity. Int. J. Prod. Econ. 118 (2009), 305–310.
40. Moin, N.H., Salhi, S., Inventory routing problems: a logistical overview. J. Oper. Res. Soc. 58:9 (2006), 1185–1194.
41. Moin, N.H., Salhi, S., Aziz, N.A.B., An efficient hybrid genetic algorithm for the multi-product multi-period inventory routing problem. Int. J. Prod. Econ. 133:1 (2011), 334–343.
42. Raa, B., Aghezzaf, E.-H., A practical solution approach for the cyclic inventory routing problem. Eur. J. Oper. Res. 192:2 (2009), 429–441.
43. Reiner, G., Teller, C., Kotzab, H., Analyzing the efficient execution of in-Store logistics processes in grocery retailing-The case of dairy products. Prod. Oper. Manage. 22:4 (2013), 924–939.
44. Sachs, A.-L., Minner, S., The data-driven newsvendor with censored demand observations. Int. J. Prod. Econ. 149 (2014), 28–36.
45. Saliby, E., Descriptive sampling: a better approach to monte carlo simulation. J. Oper. Res. Soc. 41:12 (1990), 1133–1142.
46. Santner, T.J., Williams, B.J., Notz, W.I., The Design and Analysis of Computer Experiments. 2003, Springer, New York.
47. Sternbeck, M.G., Kuhn, H., An integrative approach to determine store delivery patterns in grocery retailing. Transp. Res. Part E: Logistics and Transportation Review 70 (2014), 205–224.
48. Tempelmeier, H., Hilger, T., Linear programming models for a stochastic dynamic capacitated lot sizing problem. Comput. Oper. Res. 59 (2015), 119–125.
49. Van Donselaar, K.H., Gaur, V., Van Woensel, T., Broekmeulen, R.A.C.M., Fransoo, J.C., Ordering behavior in retail stores and implications for automated replenishment. Manage. Sci. 56:5 (2010), 766–784.
50. Van Woensel, T., Erkip, N., Curşeu, A., Fransoo, J.C., Lost sales inventory models with batch ordering and handling costs. Beta Working Paper series. Eindhoven, 421, 2013.
51. Van Zelst, S., Van Donselaar, K.H., Van Woensel, T., Broekmeulen, R.A.C.M., Fransoo, J.C., Logistics drivers for shelf stacking in grocery retail stores: potential for efficiency improvement. Int. J. Prod. Econ. 121:2 (2009), 620–632.
52. Vidal, T., Crainic, T.G., Gendreau, M., Lahrichi, N., Rei, W., A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Oper. Res. 60:3 (2012), 611–624.
53. White, K.P., An effective truncation heuristic for bias reduction in simulation output. Simulation 69:6 (1997), 323–334.
54. Zipkin, P., Critical number policies for inventory models with periodic data. Manage. Sci. 35:1 (1989), 71–80.