This work presents a generalization of the Slot Planning Problem which raises when the liner shipping industry needs to plan the placement of containers within a vessel (stowage planning). State-of-the-art stowage planning relies on a heuristic decomposition where containers are first distributed in clusters along the vessel. For each of those clusters a specific position for each container must be found. Compared to previous studies, we have introduced two new features: the explicit handling of rolled out containers and the inclusion of separations rules for dangerous cargo. We present a novel integer programming formulation and a Greedy Randomized Adaptive Search Procedure (GRASP) to solve the problem. The approach is able to find high-quality solution within 1 s. We also provide comparison with the state-of-the-art on an existing and a new set of benchmark instances.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    A GRASP algorithm for the container stowage slot planning problem



    Erschienen in:

    Erscheinungsdatum :

    2016




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Print


    Sprache :

    Englisch



    Klassifikation :

    BKL:    85.00 / 55.82 Güterverkehr



    Group-Bay Stowage Planning Problem for Container Ship

    Yifan Shen / Ning Zhao / Weijian Mi | DOAJ | 2016

    Freier Zugriff

    Group-Bay Stowage Planning Problem for Container Ship

    Yifan, Shen / Ning, Zhao / Weijian, Mi | Online Contents | 2016


    SHEET STOWAGE CONTAINER

    Europäisches Patentamt | 2017

    Freier Zugriff

    The ship stowage planning problem

    Monaco, M.F. / Sammarra, M. | Tema Archiv | 2008


    Artificial Intelligence for Automatic Container Stowage Planning Optimisation

    Kemp, Samuel E. / Roach, Paul A. / Ware, Andrew J. et al. | Taylor & Francis Verlag | 2003