Skip to main content

Minimizing the logistic ratio in the inventory routing problem


Inventory routing problems (IRPs) aim at minimizing the cost of the total distance traveled over a time horizon discretized in periods, while guaranteeing that the customers do not incur a stock-out event. In an optimal solution of an IRP, the customers in general have no inventory at the end of the horizon. Some inventory may remain only if this does not increase the cost of the distance traveled. To avoid this ending drawback, we consider in this paper as objective function the so-called logistic ratio, which is the ratio of the total routing cost to the total quantity distributed. The logistic ratio gives rise to a new optimization problem whose mathematical programming formulation is non-linear. Using a classical method, we can solve exactly instances with up to 5 vehicles and 15 customers over 3 periods. The solutions are compared with those of a classical IRP, both from the worst-case point of view and computationally. The results show that on average the logistic ratio increases by 20.4 % in the classical IRP on instances with 3 periods and that the percentage decreases when the horizon length increases.

This is a preview of subscription content, access via your institution.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5


  • Adulyasak Y, Cordeau J-F, Jans R (2013) Formulations and branch-and-cut algorithms for multivehicle production and inventory routing problems. INFORMS J Comput 26:103–120

    Article  Google Scholar 

  • Andersson H, Hoff A, Christiansen M, Hasle G, Løkketangen A (2010) Industrial aspects and literature survey: combined inventory management and routing. Comput Oper Res 37:1515–1536

    Article  Google Scholar 

  • Archetti C, Bertazzi L, Laporte G, Speranza MG (2007) A branch-and-cut algorithm for a vendor managed inventory routing problem. Transp Sci 41:382–391

    Article  Google Scholar 

  • Archetti C, Bianchessi N, Irnich S, Speranza MG (2014) Formulations for an inventory routing problem. Int Trans Oper Res 21:353–374

    Article  Google Scholar 

  • Bertazzi L, Speranza MG, Savelsbergh MWP (2008) Inventory routing. In: Golden B, Raghavan R, Wasil E (eds) The vehicle routing problem latest advances and new challenges, operations research/computer science interfaces series, vol 43. Springer, Berlin, pp 49–72

    Chapter  Google Scholar 

  • Bertazzi L, Speranza MG (2012) Inventory routing problems: an introduction. EURO J Transp Logist 1:307–326

    Article  Google Scholar 

  • Bertazzi L, Speranza MG (2013) Inventory routing problems with multiple customers. EURO J Transp Logist 2:255–275

    Article  Google Scholar 

  • Coelho LC, Cordeau J-F, Laporte G (2012) Consistency in multi-vehicle inventory-routing. Transp Res Part C 24:270–287

    Article  Google Scholar 

  • Coelho LC, Cordeau J-F, Laporte G (2012) The inventory-routing problem with transhipment. Comput Oper Res 39:2537–2548

    Article  Google Scholar 

  • Coelho LC, Laporte G (2013) The exact solution of several classes of inventory-routing problems. Comput Oper Res 40:558–565

    Article  Google Scholar 

  • Coelho LC, Laporte G (2014) Improved solutions for inventory-routing problems through valid inequalities and input ordering. Int J Prod Econ 155:391–397

    Article  Google Scholar 

  • Coelho LC, Cordeau J-F, Laporte G (2014) Thirty years of inventory routing. Transp Sci 48:1–19

    Article  Google Scholar 

  • Desaulniers G (2010) Branch-and-price-and-cut for the split delivery vehicle routing problem with time windows. Oper Res 58(1):179–192

    Article  Google Scholar 

  • Desaulniers G, Rakke J, Coelho LC (2015) A branch-price-and-cut algorithm for the inventory-routing problem. Transp Sci

  • Dinkelbach W (1967) On nonlinear fractional programming. Manag Sci 13:492–498

    Article  Google Scholar 

  • Golden B, Assad A, Dahl R (1984) Analysis of a large scale vehicle routing problem with an inventory component. Large Scale Syst 7:181–190

    Google Scholar 

  • Krarup J, Bilde O (1977) Plant location, set covering, and economic lot size: an o(mn)-algorithm for structured problems. In: Collatz L, Meinardus G, Wetterling WWE (eds) Optimierung bei graphentheoretischen und ganzzahligen Probleme, vol 3., Numerische Methoden bei OptimierungsverfahrenBirkhäuser, Basel, pp 155–180

    Google Scholar 

  • Société française de recherche opérationnelle et aide à la décision (ROADEF) (2016) ROADEF/EURO Challenge 2016: inventory routing problem. Accessed 20 April 2016

  • Toth P, Vigo D (2014) Vehicle Routing: Problems, Methods, and Applications, vol 18. SIAM, Philadelphia

    Book  Google Scholar 

Download references


The authors are grateful to the reviewers whose comments and suggestions have contributed to improve a previous version of this paper.

Author information

Authors and Affiliations


Corresponding author

Correspondence to M. Grazia Speranza.

Rights and permissions

Reprints and Permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Archetti, C., Desaulniers, G. & Speranza, M.G. Minimizing the logistic ratio in the inventory routing problem. EURO J Transp Logist 6, 289–306 (2017).

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: