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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

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


    Additional title:

    Operations Research Proceedings


    Contributors:


    Publication date :

    2014-07-10


    Size :

    7 pages





    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English




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

    de Mare, R. / Spliet, R. / Huisman, D. et al. | British Library Conference Proceedings | 2014




    A Branch-Price-and-Cut Algorithm for the Inventory-Routing Problem

    Desaulniers, Guy / Rakke, Jørgen G. / Coelho, Leandro C. | British Library Online Contents | 2016