Skip to main content
SpringerLink
Log in

CAR: heuristics for the inventory routing problem

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

Vendor managed inventory (VMI) is a streamlined approach to inventory and order fulfillment and is a system in which vendors continuously and automatically replenish a trading partner’s inventory. Vendors must ensure appropriate quantities of storages at the point of demand and must ensure optimal distribution plans, including routing of the distribution vehicles. This problem is known as the inventory routing problem (IRP) and seeks to integrate the routing of vehicles used for collection and distribution, with conventional inventory management. This paper addresses an IRP with a manufacturer that supplies a product using a fleet of vehicles to a set of warehouses over a defined time horizon. We develop a mixed integer linear program to determine the optimal allocation and the routing schedule for warehouses over the defined time horizon. To solve this problem, we propose a three-phase heuristic approach, called CAR: clustering of receiver nodes, allocation of quantities to these nodes, and routing of delivery vehicles through clusters of nodes. Computational studies are carried out and experimental trials conducted over a large number of data sets provide encouraging results and show usefulness of the solution approaches. The proposed ILP would provide optimal solution to the problem but it demands huge computational effort. However, CAR2, a proposed heuristic, is able to get solutions 7.41% better than the upper bound solutions obtained from CPLEX. These approaches can easily be implemented into existing VMI systems.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  1. Disney, S. M., & Towill, D. R. (2002). A procedure for the optimization of the dynamic response of a vendor managed inventory system. Computers and Industrial Engineering, 43(1), 27–58.

    Google Scholar 

  2. Govindan, K. (2013). Vendor-managed inventory: A review based on dimensions. International Journal of Production Research, 51(13), 3808–3835.

    Google Scholar 

  3. Ramkumar, N., Subramanian, P., Narendran, T. T., & Ganesh, K. (2011). A hybrid heuristic for inventory routing problem. International Journal of Electronic Transport, 1(1), 45–63.

    Google Scholar 

  4. Campbell, A. M., & Savelsbergh, M. W. P. (2004). A decomposition approach for the inventory-routing problem. Transportation Science, 38(4), 488–502.

    Google Scholar 

  5. Miyamoto, Y., & Kubo, M. (2001). Case study: The inventory routing for vending machines. Journal of the Operations Research Society of Japan, 4(44), 378–389.

    MathSciNet  MATH  Google Scholar 

  6. Vidović, M., Popović, D., & Ratković, B. (2014). Mixed integer and heuristics model for the inventory routing problem in fuel delivery. International Journal of Production Economics, 147(Part C), 593–604.

    Google Scholar 

  7. Singh, T., Arbogast, J. E., & Neagu, N. (2015). An incremental approach using local-search heuristic for inventory routing problem in industrial gases. Computers and Chemical Engineering, 80, 199–210.

    Google Scholar 

  8. Dillon, M., Oliveira, F., & Abbasi, B. (2017). A two-stage stochastic programming model for inventory management in the blood supply chain. International Journal of Production Economics, 187, 27–41.

    Google Scholar 

  9. Jafarkhan, F., & Yaghoubi, S. (2018). An efficient solution method for the flexible and robust inventory-routing of red blood cells. Computers and Industrial Engineering, 117, 191–206.

    Google Scholar 

  10. Hamdan, B., & Diabat, A. (2019). A two-stage multi-echelon stochastic blood supply chain problem. Computers and Operations Research, 101, 130–143.

    MathSciNet  MATH  Google Scholar 

  11. Guimarães, T. A., Coelho, L. C., Schenekemberg, C. M., & Scarpin, C. T. (2019). The two-echelon multi-depot inventory-routing problem. Computers and Operations Research, 101, 220–233.

    MathSciNet  MATH  Google Scholar 

  12. Nikzad, E., Bashiri, M., & Oliveira, F. (2019). Two-stage stochastic programming approach for the medical drug inventory routing problem under uncertainty. Computers and Industrial Engineering, 128, 358–370.

    Google Scholar 

  13. Coelho, L. C., & Laporte, G. (2013). The exact solution of several classes of inventory-routing problems. Computers and Operations Research, 40(2), 558–565.

    MathSciNet  MATH  Google Scholar 

  14. Fu, C., & Fu, Z. (2010). Optimization on stochastic inventory-routing problem in multi-cycle two-echelon system. Computer Engineering and Applications, 46(9), 198–201.

    Google Scholar 

  15. Abdelmaguid, T. F., & Dessouky, M. M. (2006). A genetic algorithm approach to the integrated inventory-distribution problem. International Journal of Production Research, 44(21), 4445–4464.

    MATH  Google Scholar 

  16. Abdelmaguid, T. F., Dessouky, M. M., & Ordóñez, F. (2009). Heuristic approaches for the inventory-routing problem with backlogging. Computers and Industrial Engineering, 56(4), 1519–1534.

    Google Scholar 

  17. Bard, J., & Nananukul, N. (2010). A branch-and-price algorithm for an integrated production and inventory routing problem. Computers and Operations Research, 37(12), 2202–2217.

    MathSciNet  MATH  Google Scholar 

  18. Archetti, C., Bertazzi, L., Laporte, G., & Speranza, M. (2007). A branch-and-cut algorithm for a vendor-managed inventory-routing problem. Transportation Science, 41(3), 382–391.

    Google Scholar 

  19. Engineer, F. G., Furman, K. C., Nemhauser, G. L., Savelsbergh, M. W. P., & Song, J. H. (2012). A branch-price-and-cut algorithm for single-product maritime inventory routing. Operations Research, 60(1), 106–122.

    MathSciNet  MATH  Google Scholar 

  20. Federgruen, A., & Zipkin, P. (1984). A combined vehicle routing and inventory allocation problem. Operations Research, 32(5), 1019–1037.

    MathSciNet  MATH  Google Scholar 

  21. Burns, L. D., Hall, R. W., Blumenfeld, D. E., & Daganzo, C. F. (1985). Distribution strategies that minimize transportation and inventory costs. Operations Research, 33(3), 469–490.

    MATH  Google Scholar 

  22. Anily, S., & Federgruen, A. (1990). One warehouse multiple retailer system with vehicle routing costs. Management Science, 36(1), 92–114.

    MathSciNet  MATH  Google Scholar 

  23. Gallego, G., & Simchi-Levi, D. (1990). On the effectiveness of direct shipping strategy for the one-warehouse multi-retailer R-systems. Management Science, 36(2), 240–243.

    MATH  Google Scholar 

  24. Andersson, H., Hoff, A., Christiansen, M., Hasle, G., & Løkketangen, A. (2010). Industrial aspects and litatherature survey: Combined inventory management and routing. Computers and Operations Research, 37(9), 1515–1536.

    MathSciNet  MATH  Google Scholar 

  25. Coelho, L. C., Cordeau, J.-F., & Laporte, G. (2014). Thirty years of inventory routing. Transportation Science, 48(1), 1–19.

    Google Scholar 

  26. Moin, N. H., Salhi, S., & Aziz, N. A. B. (2011). An efficient hybrid genetic algorithm for the multi-product multi-period inventory routing problem. International Journal of Production Economics, 133(1), 334–343.

    Google Scholar 

  27. Chandra, P. (1993). A dynamic distribution model with warehouse and customer replenishment requirements. Journal of the Operational Research Society, 44(7), 681–692.

    MATH  Google Scholar 

  28. Carter, M. W., Farvolden, J. M., Laporte, G., & Xu, J. (1996). Solving an integrated logistics problem arising in grocery distribution. INFOR: Information Systems and Operations Research, 34(4), 290–306.

    MATH  Google Scholar 

  29. Viswanathan, S., & Mathur, K. (1997). Integrating routing and inventory decisions in one-warehouse multiretailer multiproduct distribution systems. Management Science, 43(3), 294–312.

    MATH  Google Scholar 

  30. Kim, J.-U., & Kim, Y.-D. (2000). A Lagrangian relaxation approach to multi-period inventory/distribution planning. Journal of the Operational Research Society, 51(3), 364–370.

    MATH  Google Scholar 

  31. Bertazzi, L., Paletta, G., & Speranza, M. (2002). Deterministic order-up-to level policies in an inventory routing problem. Transportation Science, 36(1), 119–132.

    MATH  Google Scholar 

  32. Rusdiansyah, A., & Tsao, D. (2005). An integrated model of the periodic delivery problems for vending-machine supply chains. Journal of Food Engineering, 70(3), 421–434.

    Google Scholar 

  33. Song, J. H., & Savelsbergh, M. (2007). Performance measurement for inventory routing. Transportation Science, 41(1), 44–54.

    Google Scholar 

  34. Savelsbergh, M., & Song, J. H. (2008). An optimization algorithm for the inventory routing problem with continuous moves. Computers and Operations Research, 35(7), 2266–2282.

    MathSciNet  MATH  Google Scholar 

  35. Yu, Y., Chen, H., & Chu, F. (2008). A new model and hybrid approach for large scale inventory routing problems. European Journal of Operational Research, 189(3), 1022–1040.

    MATH  Google Scholar 

  36. Javid, A. A., & Azad, N. (2010). Incorporating location, routing and inventory decisions in supply chain network design. Transportation Research Part E: Logistics and Transportation Review, 46(5), 582–597.

    Google Scholar 

  37. Soysal, M., Bloemhof-Ruwaard, J. M., Haijema, R., & van der Vorst, J. G. (2015). Modeling an inventory routing problem for perishable products with environmental considerations and demand uncertainty. International Journal of Production Economics, 164(Supplement C), 118–133.

    Google Scholar 

  38. Soysal, M., Bloemhof-Ruwaard, J. M., Haijema, R., & van der Vorst, J. G. (2018). Modeling a green inventory routing problem for perishable products with horizontal collaboration. Computers and Operations Research, 89(5), 168–182.

    MathSciNet  MATH  Google Scholar 

  39. Roldán, R. F., Basagoiti, R., & Coelho, L. C. (2016). Robustness of inventory replenishment and customer selection policies for the dynamic and stochastic inventory-routing problem. Computers and Operations Research, 74, 14–20.

    MathSciNet  MATH  Google Scholar 

  40. Ensafian, H., & Yaghoubi, S. (2017). Robust optimization model for integrated procurement, production and distribution in platelet supply chain. Transportation Research Part E: Logistics and Transportation Review, 103, 32–55.

    Google Scholar 

  41. Ganesh, K., & Narendran, T. T. (2007). CLOVES: A cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up. European Journal of Operational Research, 178(3), 699–717.

    MathSciNet  MATH  Google Scholar 

  42. Ramkumar, N., & Narendran, T. T. (2012). Inventory routing problems: Mathematical models and heuristics. Saarbrücken: LAP Lambert Academic Publishing.

    Google Scholar 

  43. Gillett, B. E., & Miller, L. R. (1974). A heuristic algorithm for the vehicle-dispatch problem. Operations Research, 22(2), 340–349.

    MATH  Google Scholar 

  44. Ingber, L. (1993). Simulated annealing: practice versus theory. Mathematical and Computer Modelling, 18(11), 29–57.

    MathSciNet  MATH  Google Scholar 

  45. Osman, I. H. (1993). Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research, 41(4), 421–451.

    MATH  Google Scholar 

  46. Chiang, W.-C., & Russell, R. A. (1996). Simulated annealing metaheuristics for the vehicle routing problem with time windows. Annals of Operations Researach, 63(1), 3–27.

    MATH  Google Scholar 

  47. Lin, S. W., Vincent, F. Y., & Chou, S. Y. (2009). Solving the truck and trailer routing problem based on a simulated annealing heuristic. Computers and Operations Research, 36(5), 1683–1692.

    MATH  Google Scholar 

  48. Lundy, M., & Mees, A. (1986). Convergence of an annealing algorithm. Mathematical Programming, 34(1), 111–124.

    MathSciNet  MATH  Google Scholar 

  49. Parthasarathy, S., & Rajendran, C. (1998). Scheduling to minimize mean tardiness and weighted mean tardiness in flowshop and flowline-based manufacturing cell. Computers and Industrial Engineering, 34(2), 531–546.

    Google Scholar 

  50. Subramanian, P., Ramkumar, N., Narendran, T. T., & Ganesh, K. (2013). PRISM: PRIority based SiMulated annealing for a closed loop supply chain network design problem. Applied Soft Computing, 13(2), 1121–1135.

    Google Scholar 

  51. Aghezzaf, E.-H., Raa, B., & Landeghem, H. V. (2006). Modeling inventory routing problems in supply chains of high consumption products. European Journal of Operational Research, 169(3), 1048–1063.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ford Motor Company, Chennai, India

    Ramkumar Nambirajan

  2. Facultad de Ingeniería, Universidad Panamericana, 45010, Guadalajara, Jalisco, Mexico

    Abraham Mendoza

  3. The Harold and Inge Marcus Department of Industrial and Manufacturing Engineering, The Pennsylvania State University, University Park, PA, 16802, USA

    Subramanian Pazhani

  4. Department of Management Studies, Indian Institute of Technology Madras, Chennai, Tamilnadu, India

    T. T. Narendran

  5. McKinsey Knowledge Center India Private Limited, Gurgaon, Haryana, 122011, India

    K. Ganesh

Authors
  1. Ramkumar Nambirajan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Abraham Mendoza
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Subramanian Pazhani
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. T. T. Narendran
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. K. Ganesh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Abraham Mendoza.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Nambirajan, R., Mendoza, A., Pazhani, S. et al. CAR: heuristics for the inventory routing problem. Wireless Netw 26, 5783–5808 (2020). https://doi.org/10.1007/s11276-020-02259-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-020-02259-6

Keywords

Search

Navigation