The exact solution of several classes of inventory-routing problems

Leandro C. Coelho, Gilbert Laporte

Research output: Contribution to journalArticlepeer-review

156 Citations (SciVal)


In order to be competitive companies need to take advantage of synergistic interactions between different decision areas. Two of these are related to the distribution and inventory management processes. Inventory-Routing Problems (IRPs) arise when inventory and routing decisions must be made simultaneously, which yields a difficult combinatorial optimization problem. In this paper, we propose a branch-and-cut algorithm for the exact solution of several classes of IRPs. Specifically, we solve the multi-vehicle IRP with a homogeneous and a heterogeneous fleet, the IRP with transshipment options, and the IRP with added consistency features. We perform an extensive computational analysis on benchmark instances.

Original languageEnglish
Pages (from-to)558-565
Number of pages8
JournalComputers and Operations Research
Issue number2
Publication statusPublished - Feb 2013


  • Branch-and-cut
  • Consistency
  • Inventory management
  • Inventory-routing
  • Multi-vehicle
  • Transshipment
  • Vehicle routing

ASJC Scopus subject areas

  • Computer Science(all)
  • Modelling and Simulation
  • Management Science and Operations Research


Dive into the research topics of 'The exact solution of several classes of inventory-routing problems'. Together they form a unique fingerprint.

Cite this