A Periodic Inventory Routing Problem at a Supermarket Chain

References

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