A matheuristic for the multi-product maritime inventory routing problem

Homayoun Shaabani, Arild Hoff, Lars Magnus Hvattum, Gilbert Laporte

Research output: Contribution to journalArticlepeer-review

4 Citations (SciVal)


This paper considers a multi-product maritime inventory routing problem in which the routes of the vessels are determined while inventories in the ports must remain within given bounds. Since there is more than one product, each port can be a consumption port for one product and a production port for another product. We propose a matheuristic to deal with large-size instances with a planning horizon of 60 days. The first phase of the heuristic identifies a subset of the arcs in order to use them as input parameters for the second phase. In the second phase, a mathematical model is solved with the selected arcs fixed. These two phases are iterated until a stopping criterion is satisfied. The solutions produced by the matheuristic are compared with those obtained by CPLEX. Comparing the single-product version of the problem with the multi-product version revealed that instances with multiple products require significantly more run time compared with the single-product instances.

Original languageEnglish
Article number106214
Number of pages19
JournalComputers and Operations Research
Early online date6 Mar 2023
Publication statusPublished - 1 Jun 2023

Data Availability Statement

Data will be made available on request.


  • Long planning horizon
  • Maritime inventory routing
  • Mixed integer programming

ASJC Scopus subject areas

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


Dive into the research topics of 'A matheuristic for the multi-product maritime inventory routing problem'. Together they form a unique fingerprint.

Cite this