IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v60y2013i7p525-540.html
   My bibliography  Save this article

Asymptotic analysis of periodic policies for the inventory routing problem

Author

Listed:
  • Lap Mui Ann Chan
  • M. Grazia Speranza
  • Luca Bertazzi

Abstract

In this article, a distribution system is studied where the sum of transportation and inventory costs is to be minimized. The inventory holding cost is assumed to be the same for all retailers. A fixed partition (FP) periodic policy is proposed with tight asymptotic worst‐case performance of 3/2 with respect to the best possible policy. This bound cannot be improved in the class of FP periodic policies. In partition‐based PB policies, the retailers are first partitioned into sets and then the sets are grouped in such a way that sets of retailers within a group are served together at selected times. A PB periodic, policy is presented with tight worst‐case asymptotic performance of 11−46≈1.202 with respect to the best possible policy. This latter performance improves the worst‐case asymptotic performance of 2 of the previously best known policy for this problem. We also show that the proposed PB periodic policy has the best worst‐case asymptotic performance within the class of PB policies. Finally, practical heuristics inspired by the analyzed policies are designed and tested. The asymptotic worst–case performances of the heuristics are shown to be the same of those of the analyzed policies. Computational results show that the heuristics suggested are less than 6.4% on average from a lower bound on the optimal cost when 50 or more retailers are involved. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 00: 000–000, 2013

Suggested Citation

  • Lap Mui Ann Chan & M. Grazia Speranza & Luca Bertazzi, 2013. "Asymptotic analysis of periodic policies for the inventory routing problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(7), pages 525-540, October.
  • Handle: RePEc:wly:navres:v:60:y:2013:i:7:p:525-540
    DOI: 10.1002/nav.21550
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.21550
    Download Restriction: no

    File URL: https://libkey.io/10.1002/nav.21550?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Ann Melissa Campbell & Martin W. P. Savelsbergh, 2004. "A Decomposition Approach for the Inventory-Routing Problem," Transportation Science, INFORMS, vol. 38(4), pages 488-502, November.
    2. Shoshana Anily & Julien Bramel, 2004. "A probabilistic analysis of a fixed partition policy for the inventory‐routing problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(7), pages 925-948, October.
    3. Julien Bramel & David Simchi-Levi, 1995. "A Location Based Heuristic for General Routing Problems," Operations Research, INFORMS, vol. 43(4), pages 649-660, August.
    4. William L. Maxwell & John A. Muckstadt, 1985. "Establishing Consistent and Realistic Reorder Intervals in Production-Distribution Systems," Operations Research, INFORMS, vol. 33(6), pages 1316-1341, December.
    5. Claudia Archetti & Luca Bertazzi & Gilbert Laporte & Maria Grazia Speranza, 2007. "A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem," Transportation Science, INFORMS, vol. 41(3), pages 382-391, August.
    6. Luca Bertazzi & Lap Mui Ann Chan & Maria Grazia Speranza, 2007. "Analysis of practical policies for a single link distribution system," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(5), pages 497-509, August.
    7. Luca Bertazzi & Giuseppe Paletta & M. Grazia Speranza, 2002. "Deterministic Order-Up-To Level Policies in an Inventory Routing Problem," Transportation Science, INFORMS, vol. 36(1), pages 119-132, February.
    8. Lawrence D. Burns & Randolph W. Hall & Dennis E. Blumenfeld & Carlos F. Daganzo, 1985. "Distribution Strategies that Minimize Transportation and Inventory Costs," Operations Research, INFORMS, vol. 33(3), pages 469-490, June.
    9. Maria Grazia Speranza & Walter Ukovich, 1994. "Minimizing Transportation and Inventory Costs for Several Products on a Single Link," Operations Research, INFORMS, vol. 42(5), pages 879-894, October.
    10. Bertazzi, Luca & Speranza, Maria Grazia & Ukovich, Walter, 1997. "Minimization of logistic costs with given frequencies," Transportation Research Part B: Methodological, Elsevier, vol. 31(4), pages 327-340, August.
    11. S. Anily & A. Federgruen, 1990. "One Warehouse Multiple Retailer Systems with Vehicle Routing Costs," Management Science, INFORMS, vol. 36(1), pages 92-114, January.
    12. Claudia Archetti & Luca Bertazzi & Alain Hertz & M. Grazia Speranza, 2012. "A Hybrid Heuristic for an Inventory Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 24(1), pages 101-116, February.
    13. Blumenfeld, Dennis E. & Burns, Lawrence D. & Diltz, J. David & Daganzo, Carlos F., 1985. "Analyzing trade-offs between transportation, inventory and production costs on freight networks," Transportation Research Part B: Methodological, Elsevier, vol. 19(5), pages 361-380, October.
    14. Luca Bertazzi & Maria Grazia Speranza, 2002. "Continuous and Discrete Shipping Strategies for the Single Link Problem," Transportation Science, INFORMS, vol. 36(3), pages 314-325, August.
    15. Vishal Gaur & Marshall L. Fisher, 2004. "A Periodic Inventory Routing Problem at a Supermarket Chain," Operations Research, INFORMS, vol. 52(6), pages 813-822, December.
    16. Lap Mui Ann Chan & Awi Federgruen & David Simchi-Levi, 1998. "Probabilistic Analyses and Practical Algorithms for Inventory-Routing Models," Operations Research, INFORMS, vol. 46(1), pages 96-106, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Raa, Birger & Aouam, Tarik, 2023. "A shortfall modelling-based solution approach for stochastic cyclic inventory routing," European Journal of Operational Research, Elsevier, vol. 305(2), pages 674-684.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Leandro C. Coelho & Jean-François Cordeau & Gilbert Laporte, 2014. "Thirty Years of Inventory Routing," Transportation Science, INFORMS, vol. 48(1), pages 1-19, February.
    2. Paweł Hanczar, 2014. "Solving IRP using location based heuristics," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 24(2), pages 81-96.
    3. Luca Bertazzi, 2008. "Analysis of Direct Shipping Policies in an Inventory-Routing Problem with Discrete Shipping Times," Management Science, INFORMS, vol. 54(4), pages 748-762, April.
    4. Bertazzi, Luca & Moezi, Sarem Deilami & Maggioni, Francesca, 2021. "The value of integration of full container load, less than container load and air freight shipments in vendor–managed inventory systems," International Journal of Production Economics, Elsevier, vol. 241(C).
    5. Song, Ruidian & Zhao, Lei & Van Woensel, Tom & Fransoo, Jan C., 2019. "Coordinated delivery in urban retail," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 126(C), pages 122-148.
    6. Ali Ekici & Okan Örsan Özener & Gültekin Kuyzu, 2015. "Cyclic Delivery Schedules for an Inventory Routing Problem," Transportation Science, INFORMS, vol. 49(4), pages 817-829, November.
    7. Bertazzi, Luca & Speranza, Maria Grazia, 2005. "Improved rounding procedures for the discrete version of the capacitated EOQ problem," European Journal of Operational Research, Elsevier, vol. 166(1), pages 25-34, October.
    8. Luca Bertazzi & Lap Mui Ann Chan, 2014. "Analysis of the Best Double Frequency Policy in the Single Link Problem with Discrete Shipping Times," Journal of Optimization Theory and Applications, Springer, vol. 163(1), pages 286-309, October.
    9. N H Moin & S Salhi, 2007. "Inventory routing problems: a logistical overview," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(9), pages 1185-1194, September.
    10. Luca Bertazzi & Lap Mui Ann Chan & Maria Grazia Speranza, 2007. "Analysis of practical policies for a single link distribution system," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(5), pages 497-509, August.
    11. Divsalar, Ali & Vansteenwegen, Pieter, 2016. "A two-phase algorithm for the cyclic inventory routing problemAuthor-Name: Chitsaz, Masoud," European Journal of Operational Research, Elsevier, vol. 254(2), pages 410-426.
    12. Hadi Jahangir & Mohammad Mohammadi & Seyed Hamid Reza Pasandideh & Neda Zendehdel Nobari, 2019. "Comparing performance of genetic and discrete invasive weed optimization algorithms for solving the inventory routing problem with an incremental delivery," Journal of Intelligent Manufacturing, Springer, vol. 30(6), pages 2327-2353, August.
    13. Jaeheon Jung & Kamlesh Mathur, 2007. "An Efficient Heuristic Algorithm for a Two-Echelon Joint Inventory and Routing Problem," Transportation Science, INFORMS, vol. 41(1), pages 55-73, February.
    14. Luca Bertazzi & Maria Grazia Speranza, 1999. "Minimizing logistic costs in multistage supply chains," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(4), pages 399-417, June.
    15. Baita, Flavio & Ukovich, Walter & Pesenti, Raffaele & Favaretto, Daniela, 1998. "Dynamic routing-and-inventory problems: a review," Transportation Research Part A: Policy and Practice, Elsevier, vol. 32(8), pages 585-598, November.
    16. Luca Bertazzi & Maria Grazia Speranza & Walter Ukovich, 2000. "Exact and Heuristic Solutions for a Shipment Problem with Given Frequencies," Management Science, INFORMS, vol. 46(7), pages 973-988, July.
    17. Diabat, Ali & Bianchessi, Nicola & Archetti, Claudia, 2024. "On the zero-inventory-ordering policy in the inventory routing problem," European Journal of Operational Research, Elsevier, vol. 312(3), pages 1024-1038.
    18. Mohd Kamarul Irwan Abdul Rahim & El-Houssaine Aghezzaf & Veronique Limère & Birger Raa, 2016. "Analysing the effectiveness of vendor-managed inventory in a single-warehouse, multiple-retailer system," International Journal of Systems Science, Taylor & Francis Journals, vol. 47(8), pages 1953-1965, June.
    19. Bertazzi, Luca & Speranza, Maria Grazia & Ukovich, Walter, 1997. "Minimization of logistic costs with given frequencies," Transportation Research Part B: Methodological, Elsevier, vol. 31(4), pages 327-340, August.
    20. Oğuz Solyalı & Jean-François Cordeau & Gilbert Laporte, 2012. "Robust Inventory Routing Under Demand Uncertainty," Transportation Science, INFORMS, vol. 46(3), pages 327-340, August.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:navres:v:60:y:2013:i:7:p:525-540. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.