A periodic inventory routing problem at a supermarket chain

Operations Research

Volumn 52, Issue 6, 2004, Pages 813-822

  Gaur, Vishal ^a   Fisher, Marshall L ^b  

^a NEW YORK UNIVERSITY   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Inventory: inventory routing; Networks, matchings: application to inventory routing; Transportation, vehicle routing: algorithm and implementation

Indexed keywords

AHOLD CORPORATION (CO); ALGORITHM AND IMPLEMENTATION; INVENTORY ROUTING; MATCHINGS: APPLICATION TO INVENTORY ROUTING; SUPPLY CHAIN MANAGEMENT; VEHICLE ROUTING;

ALGORITHMS; CONSTRAINT THEORY; DECISION MAKING; LOGISTICS; MARKETING; ONLINE SYSTEMS; PROBLEM SOLVING; SCHEDULING; TRANSPORTATION;

INVENTORY CONTROL;

EID: 12344296838     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.1040.0150     Document Type: Article

References (29)

1. Anily, S., A. Federgruen. 1990. One warehouse multiple retailer systems with vehicle routing. Management Sci. 36 92-114.
2. Bard, J. F., L. Huang, P. Jaillet, M. Dror. 1998. A decomposition approach to the inventory routing problem with satellite facilities. Transportation Sci. 32 189-203.
3. Barnes-Schuster, D., Y. Bassok. 1997. Direct shipping and the dynamic single-depot/multi-retailer inventory system. Eur. J. Oper. Res. 101 509-518.
4. Bell, W. J., L. M. Dalberto, M. L. Fisher, A. J. Greenfield, R. Jaikumar, P. Kedia, Robert G. Mack, Paul J. Prutzman. 1983. Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer. Interfaces 13 4-23.
5. Bramel, J., D. Simchi-Levi. 1995. A location based heuristic for general routing problems. Oper. Res. 43 649-660.
6. Bramel, J., D. Simchi-Levi. 1997. The Logic of Logistics. Springer Series in Operations Research, Springer, New York.
7. Campbell, A., L. Clarke, M. W. P. Savelsbergh. 2002. Inventory routing in practice. P. Toth, D. Vigo, eds. The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, PA, 309-330.
8. Chan, L. M. A., A. Federgruen, D. Simchi-Levi. 1998. Probabilistic analyses and practical algorithms for inventory-routing models. Oper. Res. 46 96-106.
9. Chien, T. W., A. Balakrishnan, R. T. Wong. 1989. An integrated inventory allocation and vehicle routing problem. Transportation Sci. 23 67-76.
10. Christofides, N. 1985. Vehicle routing. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys, eds. The Traveling Salesman Problem: A. Guided Tour of Combinatorial Optimization. Wiley, New York, 431-448.
11. Christofides, N., S. Eilon. 1969. An algorithm for the vehicle dispatching problems. Oper. Res. 20 309-318.
12. Cordeau, J., M. Gendreau, G. Laporte. 1997. A tabu search heuristic for period and multi-depot vehicle routing problems. Networks 30 105-119.
13. Dror, M., M. Ball. 1987. Inventory/routing: Reduction from an annual to a short-period problem. Naval Res. Logist. 34 891-905.
14. Dror, M., M. Ball, B. Golden. 1985. A computational comparison of algorithms for the inventory routing problem. Ann. Oper. Res. 4 3-23.
15. Federgruen, A., D. Simchi-Levi. 1995. Analytical analysis of vehicle routing and inventory management problems. M. O. Ball, T. L. Magnanti, C. L. Monma, G. L. Nemhauser, eds. Network Routing. Handbooks in OR and MS, Vol. 8. North-Holland, Amsterdam, The Netherlands, 297-373.
16. Fisher, M. L. 1994. Optimal solution of vehicle routing problems using minimum k-trees. Oper. Res. 42 626-642.
17. Gabow, H. N., R. E. Tarjan. 1991. Faster scaling algorithms for general graph matching problems. J. Assoc. Comput. Machinery 38 815-853.
18. Galil, Z., S. Micali, H. N. Gabow. 1986. An O(EV log V) algorithm for finding a maximal weighted matching in general graphs. SIAM J. Comput. 15 120-130.
19. Gallego, G., D. Simchi-Levi. 1990. On the effectiveness of direct shipping strategy for the one-warehouse multi-retailer R-systems. Management Sci. 36 240-243.
20. Gaur, V. 2001. Essays in retail operations management. Unpublished Ph.D. dissertation, The Wharton School, University of Pennsylvania, Philadelphia, PA.
21. Golden, B., A. Assad, R. Dahl. 1984. Analysis of a large scale vehicle routing problem with an inventory component. Large Scale Systems 7 181-190.
22. Kleywegt, A., V. Nori, M. Savelsbergh. 2002. The stochastic inventory routing problem with direct deliveries. Transportation Sci. 36 94-118.
23. Laporte, G., F. Semet. 2002. Classical heuristics for the capacitated VRP. P. Toth, D. Vigo, eds. The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, PA, 109-128.
24. Larson, R. 1988. Transporting sludge to the 106-mile site: An inventory/routing model for fleet size and logistics system design. Transportation Sci. 22 186-198.
25. Lawler, E. L. 1976. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York.
26. Lin, S., B. Kernighan. 1973. An effective heuristic algorithm for the traveling salesman problem. Oper. Res. 21 498-516.
27. Papadimitriou, C. H., K. Steiglitz. 1982. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, NJ.
28. Toth, P., D. Vigo. 2002. The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, PA.
29. Webb, I., R. Larson. 1995. Period and phase of customer replenishment: A new approach to the strategic inventory/routing problem. Eur. J. Oper. Res. 85 132-148.