Inbound Logistic Planning: Minimizing Transportation and Inventory Cost

Published Online:https://doi.org/10.1287/trsc.1050.0130

References

  • Aykin T. Networking policies for hub-and-spoke systems with application to the air transportation system. Transportation Sci. (1995) 29:201–221LinkGoogle Scholar
  • Baita F., Ukovich W., Pesenti R., Favaretto D. Dynamic routing-and-inventory problems: A review. Transportation Res. Part B (1998) 32(8):585–598Google Scholar
  • Beasley J. E., Reeves C. R. Lagrangian relaxation. Modern Heuristic Techniques for Combinatorial Problems (1993) (John Wiley & Sons, New York) 243–303Google Scholar
  • Bertazzi L., Speranza M. G. Models and algorithms for the minimization of inventory and transportation costs: A survey. Lecture Notes Econom. Math. Systems (1999) 480:137–157CrossrefGoogle Scholar
  • Bertazzi L., Speranza M. G. Worst-case analysis of the full load policy in the single link problem. Internat. J. Production Econom. (2005) 93–94:217–224CrossrefGoogle Scholar
  • Blumenfeld D. E., Burns L. D., Diltz J. D., Daganzo C. F. Analyzing trade-offs between transportation, inventory and production costs on freight networks. Transportation Res. Part B (1985) 19(5):361–380CrossrefGoogle Scholar
  • Blumenfeld D. E., Burns L. D., Daganzo C. F., Frick M. C., Hall R. W. Reducing logistics costs at General Motors. Interfaces (1987) 17(1):26–37LinkGoogle Scholar
  • Bookbinder J. H., Fox N. S. Intermodal routing of Canada-Mexico shipments under NAFTA. Transportation Res. Part E (1998) 34(4):289–303CrossrefGoogle Scholar
  • Burns L. D., Hall R. W., Blumenfeld D. E., Daganzo C. F. Distribution strategies that minimize transportation and inventory costs. Oper. Res. (1985) 33(3):469–490LinkGoogle Scholar
  • Campbell J. F. One-to-many distribution with transshipments: An analytic model. Transportation Sci. (1993) 27(4):330–340LinkGoogle Scholar
  • Campbell J. F. Hub location and the p-hub median problem. Oper. Res. (1996) 44:923–935LinkGoogle Scholar
  • Cetinkaya S., Lee C. Y. Stock replenishment and shipment scheduling for vendor-managed inventory systems. Management Sci. (2000) 46(2):217–232LinkGoogle Scholar
  • Chan L. M. A., Muriel A., Shen Z. J. M., Simchi-Levi D., Teo C. P. Effective zero-inventory-ordering policies for the single-warehouse multiretailer problem with piecewise linear cost structures. Management Sci. (2002) 48:1446–1460LinkGoogle Scholar
  • Daganzo C. F.Logistics Systems Analysis (1999) 3rd ed.(Springer, Heidelberg, Germany) CrossrefGoogle Scholar
  • Lapierre S. D., Ruiz A. B., Soriano P. Designing distribution networks: Formulations and solution heuristic. Transportation Sci. (2004) 38(2):174–187LinkGoogle Scholar
  • Liu J. Y., Li C. L., Chan C. Y. Mixed truck delivery systems with both hub-and-spoke and direct shipment. Transportation Res. Part E (2003) 39:325–339CrossrefGoogle Scholar
  • O’Kelly M. E., Bryan D. L. Hub location with flow economies of scale. Transportation Res. Part B (1998) 32:605–616CrossrefGoogle Scholar
  • Popken D. A. An algorithm for the multiattribute, multicommodity flow problem with freight consolidation and inventory costs. Oper. Res. (1994) 42:274–286LinkGoogle Scholar
  • Shen Z. J., Coullard C., Daskin M. S. A joint location-inventory model. Transportation Sci. (2003) 37:40–55LinkGoogle Scholar
  • Snyder L. V., Daskin M. S., Teo C. P. The stochastic location model with risk pooling. Eur. J. Oper. Res. (2006) . ForthcomingGoogle Scholar
  • Speranza M. G., Ukovich W. Minimizing transportation and inventory costs for several products on a single link. Oper. Res. (1994) 42:879–894LinkGoogle Scholar
  • Zhao Q. H., Wang S. Y., Lai K. K., Xia G. P. Model and algorithm of an inventory problem with the consideration of transportation cost. Comput. Indust. Engrg. (2004) 46:389–397CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.