An optimization algorithm for the inventory routing problem with continuous moves

Computers and Operations Research

Volumn 35, Issue 7, 2008, Pages 2266-2282

  Savelsbergh, Martin ^a   Song, Jin Hwa ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

Branch and cut; Delivery cover inequalities; Inventory routing

Indexed keywords

ALGORITHMS; INTEGER PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; REAL TIME SYSTEMS;

DELIVERY COVER INEQUALITIES; INVENTORY ROUTING; OPTIMIZATION ALGORITHM;

NETWORK ROUTING;

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

References (28)

1. Savelsbergh MWP, Song J-H. Inventory routing with continuous moves. Computer and Operations Research 2007;34:1744-63.
2. Campbell A.M., Clarke L., Kleywegt A., and Savelsbergh M.W.P. Inventory routing. In: Crainic T., and Laporte G. (Eds). Fleet management and logistics (1998), Kluwer Academic Publishers, Dordrecht
3. Fisher M, Greenfield A, Jaikumar R, Kedia P. Real-time scheduling of a bulk delivery fleet: practical application of Lagrangean relaxation. Technical Report, University of Pennsylvania, Department of Decision Sciences, The Wharton School; 1982.
4. Bell W., Dalberto L., Fisher M., Greenfield A., Jaikumar R., Kedia P., et al. Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer. Interfaces 13 6 (1983) 4-23
5. Campbell A.M., and Savelsbergh M.W.P. A decomposition approach for the inventory routing problem. Transportation Science 38 (2004) 488-502
6. Bard J., Huang L., Jaillet P., and Dror M. A decomposition approach to the inventory routing problem with satellite facilities. Transportation Science 32 (1998) 189-203
7. Gaur V., and Fisher M.L. A periodic inventory routing problem at a supermarket chain. Operations Research 52 (2004) 813-822
8. Dror M., Ball M., and Golden B. A computational comparison of algorithms for the inventory routing problem. Annals of Operations Research 4 1-4 (1985) 3-23
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. Bard J., Huang L., Dror M., and Jaillet P. A branch and cut algorithm for the vrp with satellite facilities. IIE Transactions 30 (1998) 831-834
11. Song J-H, Savelsbergh MWP. Performance measurement for inventory routing. Transportation Science, 2004, to appear.
12. Anily S., and Federgruen A. One warehouse multiple retailer systems with vehicle routing costs. Management Science 36 1 (1990) 92-114
13. Anily S., and Federgruen A. Rejoinder to 'one warehouse multiple retailer systems with vehicle routing costs'. Management Science 37 11 (1991) 1497-1499
14. Gallego G., and Simchi-Levi D. On the effectiveness of direct shipping strategy for the one-warehouse multi-retailer r-systems. Management Science 36 2 (1990) 240-243
15. Bramel J., and Simchi-Levi D. A location based heuristic for general routing problems. Operations Research 43 4 (1995) 649-660
16. Chan L.M., Federgruen A., and Simchi-Levi D. Probabilistic analyses and practical algorithms for inventory-routing models. Operations Research 46 1 (1998) 96-106
17. Minkoff A. A Markov decision model and decomposition heuristic for dynamic vehicle dispatching. Operations Research 41 (1993) 77-90
18. Kleywegt A., Nori V., and Savelsbergh M. The stochastic inventory routing problem with direct deliveries. Transportation Science 36 (2002) 94-118
19. Kleywegt A., Nori V., and Savelsbergh M. Dynamic programming approximations for a stochastic inventory routing problem. Transportation Science 38 (2004) 42-70
20. Adelman D. Price-directed replenishment of subsets: methodology and its application to inventory routing, Manufacturing and Service Operations Management 2003;5:348-71.
21. Adelman D. A price-directed approach to stochastic inventory/routing. Operations Research 52 (2004) 499-514
22. Crainic T.G., and Laporte G. Planning models for freight transportation. European Journal of Operations Research 97 (1997) 409-438
23. Powell W. Dynamic models of transportation operations. In: de Kok A.G., and Graves S.C. (Eds). Supply chain management: design, coordination and operation (2003), Wiley, New York
24. Naddef D., and Rinaldi G. Branch-and-cut algorithms for the capacitated VRP (2002), SIAM monographs on discrete mathematics and applications
25. Ralphs TK, Kopman L, Pulleyblank WR, Trotter LE. On the capacitated vehicle routing problem. Mathematical Programming 2003; 94(2-3):343-59.
26. Lysgaard J., Letchford A.N., and Eglese R.W. A new branch-and-cut algorithm for the capacitated vehicle routing problem. Mathematical Programming 100 (2004) 423-445
27. Augera P, Belenguer JM, Benavent E, Corberán A, Naddef D, Rinaldi G. Computational results with a branch and cut code for the capacitated vehicle routing problem. Technical Report rr 949-m, Université Joseph Fourier, Grenoble, France; 1995.
28. Beale E.M.L., and Forrest J.J.H. Global optimization using special ordered sets. Mathematical Programming 10 (1976) 52-69