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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

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


    Weitere Titelangaben:

    Operations Research Proceedings


    Beteiligte:
    Huisman, Dennis (Herausgeber:in) / Louwerse, Ilse (Herausgeber:in) / Wagelmans, Albert P.M. (Herausgeber:in) / de Mare, Rutger (Autor:in) / Spliet, Remy (Autor:in) / Huisman, Dennis (Autor:in)


    Erscheinungsdatum :

    10.07.2014


    Format / Umfang :

    7 pages





    Medientyp :

    Aufsatz/Kapitel (Buch)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    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