Classification, models and exact algorithms for multi-compartment delivery problems

Leandro C. Coelho, Gilbert Laporte

Research output: Contribution to journalArticlepeer-review

63 Citations (SciVal)


The distribution of products using compartmentalized vehicles involves many decisions such as the allocation of products to vehicle compartments, vehicle routing and inventory control. These decisions often span several periods, yielding a difficult optimization problem. In this paper we define and compare four main categories of the Multi-Compartment Delivery Problem (MCDP). We propose two mixed-integer linear programming formulations for each case, as well as specialized models for particular versions of the problem. Known and new valid inequalities are introduced in all models. We then describe a branch-and-cut algorithm applicable to all variants of the MCDP. We have performed extensive computational experiments on single-period and multi-period cases of the problem. The largest instances that could be solved exactly for these two cases contain 50 and 20 customers, respectively.

Original languageEnglish
Pages (from-to)854-864
Number of pages11
JournalEuropean Journal of Operational Research
Issue number3
Publication statusPublished - 1 May 2015


  • Inventory-routing
  • Multi-compartment delivery
  • Multi-products
  • Multi-vehicles
  • Vehicle-routing

ASJC Scopus subject areas

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


Dive into the research topics of 'Classification, models and exact algorithms for multi-compartment delivery problems'. Together they form a unique fingerprint.

Cite this