The exact solution of several classes of inventory-routing problems

Leandro C. Coelho, Gilbert Laporte

Research output: Contribution to journalArticle

118 Citations (Scopus)

Abstract

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
Volume40
Issue number2
DOIs
Publication statusPublished - Feb 2013

Keywords

  • 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

Cite this