Summary
In this chapter, we introduce inventory routing problems. Inventory routing problems are among the more important and more challenging extensions of vehicle routing problems, in which inventory control and routing decisions have to be made simultaneously. The objective is to determine distribution policies that minimize the total cost, i.e., the sum of inventory holding and transportation costs, while avoiding stock-outs and respecting storage capacity limitations. All inventory routing problems have some common characteristics, but they may also have a number of significantly different characteristics. As a result, a variety of solution approaches has been developed. We discuss the various characteristics of inventory routing problems in order to create an understanding of and instill an appreciation for the complexities of inventory routing problems.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Adelman, D. (2003), Price-directed Replenishment of Subsets: Methodology and its Application to Inventory Routing,Manufacturing & Service Operations Management 5, 348-371.
Adelman, D. (2004), A Price-directed Approach to Stochastic Inventory/Routing,Operations Research 52, 499-514.
Anily, S., Federgruen, A. (1990), One Warehouse Multiple Retailer Systems with Vehicle Routing Costs,Management Science 36, 92-114.
Anily, S., Federgruen, A. (1991), Rejoinder to ‘One Warehouse Multiple Retailer Systems with Vehicle Routing Costs’,Management Science 37, 1497-1499.
Anily, S., Federgruen, A. (1993), Two–Echelon Distribution Systems with Vehicle Routing Costs and Central Inventories,Operations Research 41, 37-47.
Anily, S. (1994), The General Multi–Retailer EOQ Problem with Vehicle Routing Costs,European Journal of Operational Research 79, 451-473.
Archetti, C., Bertazzi, L., Laporte, G., Speranza, M.G. (2007), A Branch-and-Cut Algorithm for a Vendor Managed Inventory Routing Problem,Transportation Science, to appear.
Bard, J., Huang, L., Jaillet, P., Dror, M. (1998), A Decomposition Approach to the Inventory Routing Problem with Satellite Facilities,Transportation Science 32, 189-203.
Bell, W., Dalberto, L., Fisher, M., Greenfield, A., Jaikumar, R., Kedia, P., Mack, R., Prutzman, P. (1983), Improving the Distribution of Industrial Gases with an On-line Computerized Routing and Scheduling Optimizer,Interfaces 13, 4-23.
Bertazzi, L. (2006), Analysis of Direct Shipping Policies in an Inventory Routing Problem with Discrete Shipping Times, Tecnical Report n. 265, Department of Quantitative Methods, University of Brescia (under second revision inManagement Science).
Bertazzi, L., Chan, L.M.A., Speranza, M.G. (2007), Analysis of Practical Policies for the Single Link Distribution System,Naval Research Logistics, to appear.
Berman, O., Larson, R.C. (2001), Deliveries in an Inventory/Routing Problem Using Stochastic Dynamic Programming,Transportation Science 35, 192-213.
Bertazzi, L., Paletta, G., Speranza, M.G. (2002), Deterministic Order-up-to Level Policies in an Inventory Routing Problem,Transportation Science 36, 119-132.
Bertazzi, L., Paletta, G., Speranza, M.G. (2005), Minimizing the Total Cost in an Integrated Vendor–Managed Inventory System,Journal of Heuristics 11, 393-419.
Bertazzi, L., Speranza, M.G. (2002), Continuous and Discrete Shipping Strategies for the Single Link Problem,Transportation Science 36, 314-325.
Bertazzi, L., Speranza, M.G. (2005), Worst-case Analysis of the Full Load Policy in the Single Link Shipping Problem,International Journal of Production Economics 93-94C, 217-224.
Bertazzi, L., Speranza, M.G., Ukovich, W. (1997), Minimization of Logistic Costs with Given Frequencies,Transportation Research B 31, 327-340.
Bertazzi, L., Speranza, M.G., Ukovich, W. (2000), Exact and Heuristic Solutions for a Shipment Problem with Given Frequencies,Management Science 46, 973-988.
Blumenfeld, D.E., Burns, L.D. Diltz, J.D., Daganzo, C.F. (1985), Analyzing Trade-offs between Transportation, Inventory and Production Costs on Freight Networks,Transportation Research B 19, 361-380.
Burns, L.D., Hall, R.W., Blumenfeld, D.E., Daganzo, C.F. (1985), Distribution Strategies that Minimize Transportation and Inventory Cost,Operations Research 33, 469-490.
Campbell, A.M., Clarke, L., Kleywegt, A., Savelsbergh, M.W.P. (1998), The Inventory Routing Problem, in:Fleet Management and Logistics, T.G. Crainic and G. Laporte (eds), 95-113, Kluwer, Boston.
Campbell, A.M., Hardin, J. (2005), Vehicle Minimization for Periodic Deliveries,European Journal of Operational Research 165, 668-684.
Campbell, A.M., Savelsbergh, M.W.P. (2004), A Decomposition Approach for the Inventory–Routing Problem,Transportation Science 38, 488-502.
Campbell, A.M., Savelsbergh, M.W.P. (2004), Delivery Volume Optimization,Transportation Science 38, 210–223.
Campbell, A.M., Savelsbergh, M.W.P. (2004), Efficiently Handling Practical Complexities in Insertion Heuristics,Transportation Science 38, 369-378.
Chan, L.M.A., Federgruen, A., Simchi-Levi, D. (1998), Probabilistic Analyses and Practical Algorithms for Inventory–Routing Models,Operations Research 46, 96-106.
Chan, L.M.A., Muriel, A., Shen, Z.J.M., Simchi-Levi, D., Teo, C.P. (2002), Effective Zero–Inventory–Ordering Policies for the Single–Warehouse Multiretailer Problem with Piecewise Linear Cost Structures,Management Science 48, 1446-1460.
Chan, L.M.A., Simchi-Levi, D. (1998), Probabilistic Analyses and Algorithms for Three-Level Distribution Systems,Management Science 44, 1562-1576.
Chien, T., Balakrishnan, A., Wong, R. (1989), An Integrated Inventory Allocation and Vehicle Routing Problem,Transportation Science 23, 67-76.
Cordeau, J.-F., Laporte, G., Savelsbergh, M.W.P., Vigo, D. (2007), Short-Haul Routing, inHandbooks in Operations Research and Management Science: Transportation G. Laporte and C. Barnhart (eds.). Forthcoming.
Cousineau-Ouimet, K. (2002), A Tabu Search Heuristic for the Inventory Routing Problem, inProceedings of 37th Annual ORSNZ Conference.
Dror, M., Ball, M. (1987), Inventory/Routing: Reduction from an Annual to a Short-Period Problem,Naval Research Logistics Quarterly 34, 891-905.
Dror, M., Ball, M., Golden, B. (1985), A Computational Comparison of Algorithms for the Inventory Routing Problem,Annals of Operations Research 4, 3-23.
Federgruen, A., Simchi–Levi, D. (1995), Analysis of Vehicle Routing and Inventory–Routing Problems, in:Handbooks in Operations Research and Management Science (Ball, M.O., Magnanti, T.L., Monma, C.L. and Nemhauser, G.L., eds.), Vol. 8, 297-373, North–Holland.
Federgruen, A., Zipkin, P. (1984), A Combined Vehicle Routing and Inventory Allocation Problem,Operations Research 32, 1019-1032.
Fisher, M., Greenfield, A., Jaikumar, R., Kedia, P. (1982), Real-time Scheduling of a Bulk Delivery Fleet: Practical Application of Lagrangean Relaxation. Technical report, The Wharton School, University of Pennsylvania, Department of Decision Sciences.
Gallego, G., Simchi–Levi, D. (1990), On the Effectiveness of Direct Shipping Strategy for the One-Warehouse Multi-Retailer R-Systems,Management Science 36, 240-243.
Gallego, G., Simchi–Levi, D. (1994), Rejoinder to "A Note on Bounds for Direct Shipping Costs",Management Science 40, 1393.
Gaur, V., Fisher, M. (2004), A Periodic Inventory Routing Problem at a Supermarket Chain,Operations Research 52, 813-822.
Golden, B., Assad, A., Dahl, R. (1984), Analysis of a Large Scale Vehicle Routing Problem with an Inventory Component,Large Scale Systems 7, 181-190.
Hall, R.W. (1985), Determining Vehicle Dispatch Frequency when Shipping Frequency Differs among Suppliers,Transportation Research B 19, 421-431.
Hall, R.W. (1992), A Note on Bounds for Direct Shipping Costs,Management Science 38, 1212-1214.
Herer, Y., Roundy, R. (1997), Heuristic for One–Warehouse Multiretailer Distribution Problem with Performance Bounds,Operations Research 45, 102-115.
Jaillet, P., Bard, J., Huang, L., Dror, M. (2002), Delivery Costs Approximations for Inventory Routing Problems in Rolling Horizon Framework,Transportation Science 36, 292-300.
Kleywegt, A.J., Nori, V.S., Savelsbergh, M.W.P (2002), The Stochastic Inventory Routing Problem with Direct Deliveries,Transportation Science 36, 94-118.
Kleywegt, A.J., Nori, V.S., Savelsbergh, M.W.P (2004), Dynamic Programming Approximations for a Stochastic Inventory Routing Problem,Transportation Science 38, 42–70.
Lau, H.C., Liu, Q., Ono, H. (2002), Integrating Local Search and Network Flow to Solve the Inventory Routing Problem,American Association for Artificial Intelligence 2, 9-14.
Minkoff, A. (1993), A Markov Decision Model and Decomposition Heuristic for Dynamic Vehicle Dispatching,Operations Research 41, 77-90.
Rabah, M.Y., Mahmassani, H.S. (2002), Impact of Electronic Commerce on Logistics Operations: A Focus on Vendor Managed Inventory (VMI) Strategies, Technical Report N. SWUTC/02/167227–1, Center for Transportation Research, University of Texas at Austin.
Reiman, M.I., Rubio, R., Wein, L.M. (1999), Heavy Traffic Analysis of the Dynamic Stochastic Inventory-Routing Problem,Transportation Science 33, 361-380.
Savelsbergh, M.W.P., Song, J.-H. (2006), Inventory Routing with Continuous Moves,Computers and Operations Research 34, 1744-1763.
Savelsbergh, M.W.P., Song, J.-H. (2007), An Optimization Algorithm for Inventory Routing with Continuous Moves,Computers and Operations Research, to appear.
Song, J.-H., Savelsbergh, M.W.P. (2006), Performance Measurements for Inventory Routing,Transportation Science, to appear.
Speranza, M.G., Ukovich, W. (1994), Minimizing Transportation and Inventory Costs for Several Products on a Single Link,Operations Research 42, 879-894.
Speranza, M.G., Ukovich, W. (1996), An Algorithm for Optimal Shipments with Given Frequencies,Naval Research Logistics 43, 655-671.
Trudeau, P., Dror, M. (1992), Stochastic Inventory Routing: Route Design with Stockouts and Route Failures,Transportation Science 26, 171-184.
Viswanathan, S., Mathur, K. (1997), Integrating Routing and Inventory Decisions in One Warehouse Multiretailer Multiproduct Distribution System,Management Science 43, 294-312.
Webb, I.R., Larson, R.C. (1995), Period and Phase of Customer Replenishment: A New Approach to the Strategic Inventory/Routing Problem,European Journal of Operational Research 85, 132-148.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Bertazzi, L., Savelsbergh, M., Speranza, M.G. (2008). Inventory Routing. In: Golden, B., Raghavan, S., Wasil, E. (eds) The Vehicle Routing Problem: Latest Advances and New Challenges. Operations Research/Computer Science Interfaces, vol 43. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-77778-8_3
Download citation
DOI: https://doi.org/10.1007/978-0-387-77778-8_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-77777-1
Online ISBN: 978-0-387-77778-8
eBook Packages: Business and EconomicsBusiness and Management (R0)