Skip to main content

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

  • Conference paper
  • First Online:
Book cover Operations Research Proceedings 2013

Part of the book series: Operations Research Proceedings ((ORP))

  • 1583 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  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.

    Article  Google Scholar 

  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.

    Article  Google Scholar 

  3. Christiansen, M. (1999). Decomposition of a combined inventory and time constraint ship routing problem. Transportation Science, 33, 3–16.

    Article  Google Scholar 

  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.

    Chapter  Google Scholar 

  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.

    Article  Google Scholar 

  6. Ronen, D. (2002). Marine inventory routing: shipments planning. Journal of the Operations Research Society, 53, 108–114.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rutger de Mare .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

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. Springer, Cham. https://doi.org/10.1007/978-3-319-07001-8_14

Download citation

Publish with us

Policies and ethics