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

Rutger Mare (), Remy Spliet () and Dennis Huisman ()
Additional contact information
Rutger Mare: ORTEC
Remy Spliet: Erasmus University Rotterdam
Dennis Huisman: Erasmus University Rotterdam

A chapter in Operations Research Proceedings 2013, 2014, pp 97-103 from Springer

Abstract: 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 (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-319-07001-8_14

Ordering information: This item can be ordered from
http://www.springer.com/9783319070018

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

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().