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.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A GRASP algorithm for the container stowage slot planning problem




    Publication date :

    2016




    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English



    Classification :

    BKL:    85.00 / 55.82 Güterverkehr



    A GRASP algorithm for the container stowage slot planning problem

    Parreño, Francisco / Pacino, Dario / Alvarez-Valdes, Ramon | Elsevier | 2016


    Group-Bay Stowage Planning Problem for Container Ship

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


    Group-Bay Stowage Planning Problem for Container Ship

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

    Free access

    The ship stowage planning problem

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