An Efficient Heuristic Algorithm for a Two-Echelon Joint Inventory and Routing Problem

References

• Anily S., Federgruen A. One warehouse multiple retailer systems with vehicle routing costs. Management Sci. (1990a) 36:92–114Link, Google Scholar
• Anily S., Federgruen A. A class of Euclidean routing problems with general route cost functions. Math. Oper. Res. (1990b) 15:268–285Link, Google Scholar
• Anily S., Federgruen A. Two-echelon distribution system with vehicle routing cost and central warehouse. Oper. Res. (1993) 41:37–47Link, Google Scholar
• Bazaraa M. S., Shetty C. M.Nonlinear Programming: Theory and Algorithms (1979) (John Wiley and Sons, New York) Google Scholar
• Blumenfeld D. E., Burns L. D., Diltz J. D. Analyzing trade-offs between transportation, inventory and production costs on freight network. Transportation Res. Part B (1985) 19:361–380Crossref, Google Scholar
• Bramel J., Simchi-Levi D. A location-based heuristic for general routing problems. Oper. Res. (1995) 43:649–660Link, Google Scholar
• Burns L. D., Hall R. W., Blumenfeld D. E. Distribution strategy that minimize transportation and inventory costs. Oper. Res. (1985) 33:469–490Link, Google Scholar
• Campbell A., Clarke L., Kleywegt A., Savelsbergh M., Crainic T. G., Laporte G. The inventory routing problem. Fleet Management and Logistics (1998) (Kluwer Academic Publishers Group, Boston, MA) 95–113Crossref, Google Scholar
• Chan L. M. A., Federgruen A., Simchi-Levi D. Probabilistic analyses and practical algorithms for inventory-routing problem. Oper. Res. (1998) 46:96–106Link, 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) (John Wiley and Sons, New York) 431–448Google Scholar
• Daganzo C. F., Newell G. F. Configuration of physical distribution networks. Networks (1986) 16:113–132Crossref, Google Scholar
• Federgruen A., Zheng Y.-S. The joint replenishment problem with general joint cost structure: General solution methods and performance bounds. Oper. Res. (1992) 40:384–404Link, Google Scholar
• Gallego G., Simchi-Levi D. On the effectiveness of direct shipping strategy for the one warehouse multi-retailer systems. Management Sci. (1990) 36:240–243Link, Google Scholar
• Gillet B. E., Miller L. E. A heuristic algorithm for the vehicle dispatching problem. Oper. Res. (1974) 22:340–349Link, Google Scholar
• Herer Y., Roundy R. Heuristic for a one-warehouse multiretailer distribution problem with performance bound. Oper. Res. (1997) 45:102–115Link, Google Scholar
• Jung J. A joint inventory and routing problem. (2001) . Doctoral dissertation, Department of Operations, Case Western Reserve University, Cleveland, OHGoogle Scholar
• Mathur K., Salkin H. M., Morito S. An effective algorithm for the general multiple-choice knapsack problem (GMKP). Ann. Oper. Res. (1985) 41:253–283Crossref, Google Scholar
• Maxwell W. L., Muckstadt J. A. Establishing consistent and realistic reorder intervals in production-distribution systems. Oper. Res. (1985) 33:1316–1341Link, Google Scholar
• Roundy R. 98% Effective integer-ratio lot-sizing for one warehouse multiretailer systems. Management Sci. (1985) 31:1416–1429Link, Google Scholar
• Schwarz L. B. Simple continuous review deterministic one warehouse N retailer inventory problem. Management Sci. (1973) 19:555–566Link, Google Scholar
• Silver E. A., Pyke D. F., Peterson R.Inventory Management and Production Planning and Scheduling (1998) 3rd ed.(John Wiley and Sons, New York) Google Scholar
• Viswanathan S., Mathur K. Integrating routing and inventory decisions in one warehouse multiretailer multiproduct distribution systems. Management Sci. (1997) 43:294–312Link, Google Scholar
• Zipkin P. H.Fundamentals of Inventory Management (2000) (McGraw-Hill, New York) Google Scholar