Advertisement

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

  • Rutger de Mare
  • Remy Spliet
  • Dennis Huisman
Conference paper
Part of the Operations Research Proceedings book series (ORP)

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.

Keywords

Time Window Mixed Integer Linear Program Multiple Product Short Path Problem Price Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Al-Khayyal, F., & Hwang, S. J. (2007). Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk, part I: Applications and model. European Journal of Operations Research, 176, 106–130.CrossRefGoogle Scholar
  2. 2.
    Brønmo, G., Nygreen, B., & Lysgaard, J. (2009). Column generation approaches to ship scheduling with flexible cargo sizes. European Journal of Operations Research, 200, 139–150.CrossRefGoogle Scholar
  3. 3.
    Christiansen, M. (1999). Decomposition of a combined inventory and time constraint ship routing problem. Transportation Science, 33, 3–16.CrossRefGoogle Scholar
  4. 4.
    Christiansen, M., & Nygreen, B. (2005). Robust inventory ship routing by column generation. In G. Desaulniers, J. Desrosiers, & M. M. Solomon (Eds.), Column Generation (pp. 197–224). New York: Springer.CrossRefGoogle Scholar
  5. 5.
    Ioachim, I., Gélinas, S., Soumis, F., & Desrosiers, J. (1998). A dynamic programming algorithm for the shortest path problem with time windows and linear node costs. Networks, 31, 193204.CrossRefGoogle Scholar
  6. 6.
    Ronen, D. (2002). Marine inventory routing: shipments planning. Journal of the Operations Research Society, 53, 108–114.CrossRefGoogle Scholar

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