A GRASP algorithm for the container stowage slot planning problem

Francisco Parreno, Dario Pacino, Ramon Alvarez-Valdes

    Research output: Contribution to journalJournal articleResearchpeer-review

    99 Downloads (Pure)

    Abstract

    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. (C) 2016 Elsevier Ltd. All rights reserved.
    Original languageEnglish
    JournalTransportation Research. Part E: Logistics and Transportation Review
    Volume94
    Pages (from-to)141-157
    ISSN1366-5545
    DOIs
    Publication statusPublished - 2016

    Keywords

    • Business and International Management
    • Transportation
    • Management Science and Operations Research
    • Container vessel stowage planning
    • GRASP
    • Heuristic algorithms
    • Integer programming
    • Slot planning
    • ENGINEERING,
    • OPERATIONS
    • TRANSPORTATION
    • ECONOMICS
    • PACKING PROBLEMS
    • LOADING PROBLEM
    • REACTIVE GRASP
    • NUMBER
    • SHIFTS
    • REDUCE
    • SHIPS
    • SET

    Cite this