Due to the asymmetry between the time required to retrieve a container to vessel and the time required to register a container at the gate, the storage space allocation problem solves the best allocation policy of these containers that minimizes the potential number of gantry movements during the assigning process and the future retrieval process. A decision rule-based heuristic is proposed, and three properties are discovered in this research. Comprehensive numerical experiments show that the proposed heuristic can solve the real-sized instances within a second, making it possible to account for uncertainty because the re-optimization effort is negligible. Moreover, when applying the proposed heuristic to a container yard at the Port of Kaohsiung in Taiwan and considering the extreme cases, the heuristic performs even better when the number of containers increases and still requires less than 1 s to solve these extreme cases. Finally, the proposed heuristic can be applied to different layouts of storage space and various material handling machines.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    The Storage Space Allocation Problem at a Container Terminal


    Contributors:

    Published in:

    Publication date :

    2017-08-18


    Size :

    20 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Container reshuffling considered space allocation problem in container terminals

    Zhou, Chenhao / Wang, Wencheng / Li, Haobin | Elsevier | 2020


    Storage space allocation in container terminals

    Zhang, Chuqian | Online Contents | 2003


    Storage space allocation in container terminals

    Zhang, Chuqian / Liu, Jiyin / Wan, Yat-wah et al. | Elsevier | 2002



    Optimisation of container space allocation in automated terminal yards

    Zhong, Jiayin / Jiang, Huiyuan | British Library Conference Proceedings | 2023