A new model and hybrid approach for large scale inventory routing problems

European Journal of Operational Research

Volumn 189, Issue 3, 2008, Pages 1022-1040

  Yu, Yugang ^a   Chen, Haoxun ^a   Chu, Feng ^a  

^a UNIVERSITÉ DE TECHNOLOGIE DE TROYES   (France)

Author keywords

Inventory; Inventory routing problem; Lagrangian relaxation; Logistics; Transportation

Indexed keywords

ALGORITHMS; LAGRANGE MULTIPLIERS; LINEAR PROGRAMMING; LOGISTICS; MATHEMATICAL MODELS; PROBLEM SOLVING; TRANSPORTATION;

INVENTORY ROUTING PROBLEM; LAGRANGIAN RELAXATION; LINEAR PROGRAMMING ALGORITHM; MINIMUM COST FLOW ALGORITHM;

INVENTORY CONTROL;

EID: 40849140755     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2007.02.061     Document Type: Article

References (30)

1. Adelman D. A price-directed approach to stochastic inventory/routing. Operations Research 52 4 (2004) 499-514
2. Aghezzaf E.H., Raa B., and Van Landeghem H. Modeling inventory routing problems in supply chains of high consumption products. European Journal of Operational Research 169 3 (2006) 1048-1063
3. Anily S., and Bramel J. An asymptotic 98.5%-effective lower bound on fixed partition policies for the inventory-routing problem. Discrete Applied Mathematics 145 1 (2004) 22-39
4. Belenguer J.M., Martinez M.C., and Mota E. A lower bound for the split delivery vehicle routing problem. Operations Research 48 5 (2000) 801-810
5. Campbell, A., Clarke, L., Savelsbergh, M.W.P., 2002. Inventory routing in practice: The vehicle routing problem. In: P. Toth, D. Viego (Eds)., SIAM Monographs on Discrete Mathematics and Applications, 2002. pp. 309-330.
6. Campbell A.M., and Savelsbergh M.W.P. A decomposition approach for the inventory-routing problem. Transportation Science 38 4 (2004) 488-502
7. Chandra P., and Fisher M.L. Coordination of production and distribution planning. European Journal of Operational Research 72 (1994) 503-517
8. Dell'Amico M., Lodi A., and Martello S. Efficient algorithms and codes for k-cardinality assignment problems. Discrete Applied Mathematics 110 1 (2001) 25-40
9. Dror M., and Ball M. Inventory/routing: Reduction from an annual to a short period problem. Naval Research Logistics Quarterly 34 6 (1987) 891-905
10. Dror M., Ball M., and Golden B. A computational comparison of algorithms for the inventory routing problem. Annals of Operation Research 4 (1985) 3-23
11. Dror M., and Trudeau P. Savings by split delivery routing. Transportation Science 23 (1989) 141-145
12. Dror M., and Trudeau P. Split delivery routing. Naval Research Logistics 37 (1990) 383-402
13. Federgruen A., Prastacos G., and Zipkin P. An allocation and distribution model for perishable products. Operations Research 34 (1986) 75-82
14. Federgruen A., and Zipkin P. A combined vehicle routing and inventory allocation problem. Operation Research 32 (1984) 1019-1037
15. Fumero F., and Vercellis C. Synchronized development of production, inventory, and distribution schedules. Transportation Science 33 3 (1999) 330-340
16. Ho S.C., and Haugland D. A tabu search heuristic for the vehicle routing problem with time windows and split deliveries. Computers & Operations Research 31 12 (2004) 1947-1964
17. Jaillet P., Bard J.F., Huang L., and Dror M. Delivery cost approximations for inventory routing problems in a rolling horizon framework. Transportation Science 36 3 (2002) 292-300
18. Kleywegt A.J., Nori V.S., and Savelsbergh M.W.P. The Stochastic inventory routing problem with direct deliveries. Transportation Science 36 1 (2002) 94-118
19. Kleywegt A.J., Nori V.S., and Savelsbergh M.W.P. Dynamic programming approximations for a stochastic inventory routing problem. Transportation Science 38 1 (2004) 42-70
20. Kumar A., Schwarz L., and Ward J. Risk-pooling along a fixed delivery route using a dynamic inventory-allocation policy. Management Science 41 (1995) 344-362
21. Lee C.G., Epelman M.A., White C.C., and Bozer Y.A. A shortest path approach to the multiple-vehicle routing problem with split pick-ups. Transportation Research Part B-Methodological 40 4 (2006) 265-284
22. Martello S., and Toth P. Linear assignment problems. In: Martello S., Laporte G., Minoux M., and Ribeiro C. (Eds). Surveys in Combinatorial Optimization. Annals of Discrete Mathematics vol. 31 (1987), North-Holland, Amsterdam 259-282
23. Reiman M.I. Heavy traffic analysis of the dynamic stochastic inventory-routing problem. Transportation Science 33 4 (1999) 361-380
24. Schwarz L.B., Ward J., and Zhai X. Joint Transportation-and-Inventory Problems in Supply Chains: A Review (2004), Krannert School of Management, Purdue University
25. Trudeau P., and Dror M. Stochastic inventory routing: route design with stockouts and route failures. Transportation Science 26 3 (1992) 171-184
26. Wolsey L.A. Integer Programming (1998), Wiley, New York pp. 38-40
27. Yu, Y.G., Chen, H.X., Chu, F., 2005. Large scale inventory routing problem with split delivery: A new model and Lagrangian relaxation approach. In: 2005 IEEE International Conference on Service Operations and Logistics, and Informatics, Beijing, China.
28. Yu Y.G., Chu F., and Chen H.X. A note on coordination of production and distribution planning. European Journal of Operational Research 177 1 (2007) 626-629
29. Zhao Q.H., Wang S.Y., and Lai K.K. A partition approach to the inventory/routing problem. European Journal of Operational Research 177 2 (2007) 786-802
30. Zhao X., Luh P.B., and Wang J. Surrogate gradient algorithm for Lagrangian relaxation. Journal of Optimization Theory and Applications 100 3 (1999) 699-712