A vendor managed inventory model using continuous approximations for route length estimates and Markov chain modeling for cost estimates

International Journal of Production Economics

Volumn 157, Issue 1, 2014, Pages 120-132

  Larsen, Christian ^a   Turkensteen, Marcel ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

Continuous approximation; Joint replenishment policies; Markov chain modeling

Indexed keywords

CHAINS; COST ESTIMATING; COSTS; MARKOV PROCESSES; SALES; SPECIFICATIONS; TRANSPORTATION; WAREHOUSES;

CONTINUOUS APPROXIMATIONS; JOINT REPLENISHMENT; JOINT REPLENISHMENT PROBLEM; MARKOV CHAIN APPROACHES; MARKOV CHAIN MODELS; MONITOR AND CONTROL; TRANSPORTATION COST; VENDOR MANAGED INVENTORY;

COST BENEFIT ANALYSIS;

EID: 85027917562     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2014.08.001     Document Type: Conference Paper

References (29)

1. Andersson, H., Hoff, A., Christiansen, M., Hasle, G., Løkketangen, A., 2010. Industrial aspects and literature survey: combined inventory management and routing. Comput. Oper. Res. 37, 1515-1536.
2. Anily, S., Federgruen, A., 1990. One warehouse multiple retailer systems with vehicle routing costs. Manage. Sci. 36, 92-114.
3. Atkins, D.R., Iyogun, P.O., 1988. Periodic versus "can order" policies for coordinated multi-item inventory systems. Manage. Sci. 34, 791-796.
4. Baita, F., Ukovich, W., Pesenti, R., Favaretto, D., 1998. Dynamic routing-and-inventory problems: a review. Transp. Res.: Part A: Policy Pract. 8, 585-598.
5. Balinfy, J.L., 1964. On a class of multi-item inventory problems. Manage. Sci. 10, 287-297.
6. Burns, L.D., Hall, R.W., Blumenfeld, D.E., Daganzo, C.F., 1985. Distribution strategies that minimize transportation and inventory costs. Oper. Res. 33, 469-490.
7. Chopra, S., Meindl, P., 2007. Supply Chain Management: Strategy, Planning & Operation, third ed. Prentice Hall, Upper Saddle River, NJ, USA.
8. Daganzo, C., 2004. Logistics Systems Analysis, fourth ed. Springer Verlag, Berlin.
9. Federgruen, A., Groenevelt, H., Tijms, H., 1984. Coordinated replenishments in a multi-item inventory system with compound Poisson demands. Manage. Sci. 30, 344-357.
10. Figliozzi, M.A., 2009. Planning approximations to the average length of vehicle routing problems with time window constraints. Transp. Res.: Part B: Methodological 43, 438-447.
11. Gürbuz, M.C., Moinzadeh, K., Zhou, Y.-P., 2007. Coordinated replenishment strategies in inventory/distribution systems. Manage. Sci. 53, 293-307.
12. Hvattum, L.M., Løkketangen, A., 2009. Using scenario trees and progressive hedging for stochastic inventory routing problems. J. Heuristics 15, 527-557.
13. Johansen, S.G., Melchiors, P., 2003. Can-order policy for the periodic review joint replenishment problem. J. Oper. Res. Soc. 54, 283-290.
14. Kelton, W.D., Sadowski, R.P., Sturrock, D.T., 2007. Simulation with Arena, fourth ed. McGraw Hill, New York, NY, USA.
15. Kleywegt, A.J., Nori, V.S., Savelsbergh, M.W.P., 2004. Dynamic programming approximations for a stochastic inventory routing problem. Transp. Sci. 38, 42-70.
16. Larsen, C., 2009. The Q(s,S) control policy for the joint replenishment problem extended to the case of correlation among item-demands. Int. J. Prod. Econ. 118, 292-297.
17. Melchiors, P., 2002. Calculating can-order policies for the joint replenishment problem by the compensation approach. Eur. J. Oper. Res. 141, 587-595.
18. Nielsen, C., Larsen, C., 2005. An analytical study of the Q(s,S) policy applied to the joint replenishment problem. Eur. J. Oper. Res. 163, 721-732.
19. Pantumsinchai, P., 1992. A comparison of three joint ordering inventory policies. Decis. Sci. 23, 111-127.
20. Renberg, B., Planche, R., 1969. Un modèle pour la gestion simultanée des n articles d'un stock. Rev. Fr. Inf. Rech. Opér. 6, 47-59.
21. Rodrigue, J.P., Comtois, C., Slack, B., 2006. The Geography of Transport Systems. Routledge.
22. Rosling, K., 2002. Inventory cost rate functions with nonlinear shortage costs. Oper. Res. 50, 1007-1017.
23. Schultz, H., Johansen, S.G., 1999. Can-order policies for coordinated inventory replenishment with Erlang distributed times between ordering. Eur. J. Oper. Res. 113, 30-41.
24. Silver, E.A., 1981. Establishing reorder points in the (S,c,s) coordinated control system under a compound Poisson demand. Int. J. Prod. Res. 19, 743-750.
25. Tijms, H., 2003. A First Course in Stochastic Models. John Wiley.
26. Turkensteen, M., Klose, A., 2012. Demand dispersion and logistics costs in one-to-many distribution systems. Eur. J. Oper. Res. 223, 499-507.
27. Viswanathan, S., 1996. A new optimal algorithm for the joint replenishment problem. J. Oper. Res. Soc. 47, 936-944.
28. Viswanathan, S., 1997. Periodic review (s,S) policies for joint replenishment inventory problems. Manage. Sci. 43, 1447-1454.
29. Wildeman, R.E., Frenk, J.B.G., Dekker, R., 1997. An efficient optimal solution for the joint replenishment problem. Eur. J. Oper. Res. Vol 99, 433-444.