Skip to main content

Deterministic Order—up—to Level Strategies for the Minimization of the Logistic Costs in Distribution Systems

  • Conference paper
New Trends in Distribution Logistics

Abstract

We consider a distribution problem in which a product has to be shipped from a supplier to several retailers on a given time horizon. Shipments from the supplier to the retailers are performed by using a vehicle of given transportation capacity and cost. Each retailer determines a minimum and a maximum level of the inventory of the product. Every time a retailer is visited, the quantity delivered by the supplier is such that the maximum level of the inventory is reached at the retailer; in other words, a deterministic order-up-to level strategy is applied. The problem is to determine for each discrete time instant the retailers to be visited and the route that the vehicle has to travel. Various objective functions are considered which correspond to different decision strategies and possibly to different decision-makers. For this problem we present a heuristic algorithm and compare the solutions obtained with different objective functions on a set of randomly generated problem instances.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Anily, S. / Federgruen, A. (1990): One Warehouse Multiple Retailer Systems with Vehicle Routing Costs. in: Management Science 36, 1990, 92–114

    Article  Google Scholar 

  • Bertazzi, L. / Speranza, M.G. / Ukovich, W. (1997): Minimization of Logistic Costs with Given Frequencies. in: Transportation Research B31, 327–340

    Google Scholar 

  • Blumenfeld, D.E. / Burns, L.D. / Diltz, J.D. / Daganzo, CF. (1985): Analyzing trade-offs between transportation, inventory and production costs on freight networks. in: Transportation Research 19B, 361–380

    Google Scholar 

  • Bramel, J. / Simchi-Levi, D. (1997): The Logic of Logistics. Springer, New York

    Book  Google Scholar 

  • Burns, L.D. / Hall, R.W. / Blumenfeld, D.E. / Daganzo, CF. (1985): Distribution Strategies that Minimize Transportation and Inventory Cost. in: Operations Research 33, 469–490

    Article  Google Scholar 

  • Christofides, N. (1985): Vehicle Routing. in: The Travelling Salesman Problem, (Lawler, E.L., Lenstra, J.K. Rinnooy Kan, A.H.G. and Shmoys, D.B., eds.), Wiley, New York

    Google Scholar 

  • Dror, M. / Ball, M. (1987): Inventory/Routing: Reduction from an annual to a short-period problem. in: Naval Research Logistics Quarterly 34, 891–905

    Article  Google Scholar 

  • Federgruen, A. / Simchi-Levi, D. (1995): Analysis of Vehicle Routing and Inventory-Routing Problems. in: Handbooks in Operations Research and Management Science, Vol. 8, (Ball, M.O., Magnanti, T.L., Monma, C.L. and Nemhauser, G.L. Eds.), North Holland, Amsterdam

    Google Scholar 

  • Federgruen, A. / Zipkin, P. (1984): A Combined Vehicle Routing and Inventory Allocation Problem. in: Operations Research 32, 1019–1032

    Article  Google Scholar 

  • Hall, R.W. (1985): Determining vehicle dispatch frequency when shipping frequency differs among suppliers. in: Transportation Research 19B, 421–431

    Google Scholar 

  • Harris, F.W. (1913): How Many Parts to Make at Once. in: Factory, The Magazine of Management 10, 135–136, reprinted in Operations Research 38, 947-950, 1990

    Google Scholar 

  • Hu, T.C. (1982): Combinatorial Algorithms. Addison Wesley.

    Google Scholar 

  • Jackson, P.L. / Maxwell, W.L. / Muckstadt, J.A. (1988): Determining Optimal Reorder Intervals in Capacitated Production-Distribution Systems. in: Management Science 34, 938–958

    Article  Google Scholar 

  • Maxwell, W.L. / Muckstadt, J.A. (1985): Establishing Consistent and Realistic Reorder Intervals in Production-Distribution Systems. in: Operations Research 33, 1316–1341

    Article  Google Scholar 

  • Muckstadt, J.A. / Roundy, R.O. (1993): Analysis of Multistage Production Systems. in: Graves, S.C., Rinnooy Kan, A.H.G. and Zipkin, P.H. (eds.), Handbooks in Operations Research and Management Science, Vol. 4: Logistics of Production and Inventory, North-Holland, 59–131

    Google Scholar 

  • Rosenkrantz, D.J. / Stearns, R.E. / Lewis, P.M. (19T7): An Analysis of Several Heuristics for the Traveling Salesman Problem. in: SIAM J. Comput. 6, 563–581

    Article  Google Scholar 

  • Speranza, M.G./ Ukovich, W. (1994): Minimizing transportation and inventory costs for several products on a single link. in: Operations Research 42, 879–894

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bertazzi, L., Paletta, G., Speranza, M.G. (1999). Deterministic Order—up—to Level Strategies for the Minimization of the Logistic Costs in Distribution Systems. In: Speranza, M.G., Stähly, P. (eds) New Trends in Distribution Logistics. Lecture Notes in Economics and Mathematical Systems, vol 480. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58568-5_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-58568-5_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66617-2

  • Online ISBN: 978-3-642-58568-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics