Maritime Inventory Routing using Constraint Programming

Master thesis (2020)

Authors

J.T. Teitsma Electrical Engineering, Mathematics and Computer Science

Contributors

K.I. Aardal Discrete Mathematics and Optimization - EEMCS (supervisor 1)
R.B.O. Kerkkamp Ortec B.V. (supervisor 1)
M.M. de Weerdt Algorithmics - EEMCS (supervisor 2)
Faculty
Electrical Engineering, Mathematics and Computer Science
Copyright: © 2020 Jacco Teitsma
More Info
expand_more

Published Date

25-09-2020

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Abstract

The maritime inventory routing problem (MIRP) is a tactical and operational planning problem, that takes an integrated view on ship scheduling and inventory management for bulk products. Given production and consumption levels during a predetermined planning horizon, the problem aims at finding delivery schedules with minimal travel costs, such that the inventory bounds at both production and consumption ports are satisfied during the entire planning horizon.

In this thesis, we consider instances of the MIRP with a heterogenous fleet and multiple products. We formulate both a mixed integer programming (MIP) and constraint programming (CP) model for these instances. These models are solved using commercially available dedicated solvers for both formalism. For small instance sizes and short planning periods, the MIP approach is prevalent in finding solutions quickly and of good quality. Due to the inventory constraints in the problem however, the MIP approach suffers from scalability issues more heavily than the CP approach. A rolling-horizon heuristic is proposed in order to find solutions of better quality in comparable running time.