A Branch-and-Price Approach for a Ship Routing Problem with Multiple Products and Inventory Constraints

Conference paper

DOI: 10.1007/978-3-319-07001-8_14

Part of the Operations Research Proceedings book series (ORP)
Cite this paper as:
de Mare R., Spliet R., Huisman D. (2014) A Branch-and-Price Approach for a Ship Routing Problem with Multiple Products and Inventory Constraints. In: Huisman D., Louwerse I., Wagelmans A. (eds) Operations Research Proceedings 2013. Operations Research Proceedings (GOR (Gesellschaft für Operations Research e.V.)). Springer, Cham

Abstract

In the oil industry, different oil products are blended in a refinery. Afterwards, these products are transported to different harbors by ship. Due to the limited storage capacity at the harbors and the undesirability of a stock-out, inventory levels at the harbors have to be taken into account during the construction of the ship’s routes. In this paper, we give a detailed description of this problem, which we call the ship routing problem with multiple products and inventory constraints. Furthermore, we formulate this problem as a generalized set-covering problem. We propose a branch-and-price algorithm to solve it and we discuss this briefly.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.ORTECZoetermeerThe Netherlands
  2. 2.Econometric Institute, Erasmus School of EconomicsErasmus University RotterdamRotterdamThe Netherlands

Personalised recommendations