One of great challenges in seaport management is how to handle containers under reshuffling, called reshuffles. Repositioning reshuffles in a bay (internal reshuffling) can improve the efficiency of quay cranes and help ports to reduce ship turn-around time. This paper studies the quay crane double-cycling problem with internal-reshuffling operations, and presents a fast solution algorithm. To reduce the number of operations necessary to turn around a bay of a vessel, the problem is first formulated as a new integer program. A polynomial-time heuristic is then developed. The analysis is made on the worst-case error bound of the proposed algorithm. Results are presented for a suite of combinations of problem instances with different bay sizes and workload scenarios. Comparisons are made between our algorithm and the start-of-the-art heuristic. The computational results demonstrate that our model can be solved more efficiently with CPLEX than the model proposed by Meisel and Wichmann (2010), and the proposed algorithm can well solve real-world problem instances within several seconds.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A polynomial-time heuristic for the quay crane double-cycling problem with internal-reshuffling operations



    Published in:

    Publication date :

    2015




    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English



    Classification :

    BKL:    85.00 / 55.82 Güterverkehr




    Optimal Algorithm for the General Quay Crane Double-Cycling Problem

    Lee, Chung-Yee / Liu, Ming / Chu, Chengbin | British Library Online Contents | 2015


    Quay crane diving platform and quay crane

    TENG XUCHUN / LEI QUANWEN / WENG WUWEI et al. | European Patent Office | 2023

    Free access

    QUAY CRANE AND CONTROL METHOD FOR QUAY CRANE

    MATSUURA MASAHIRO | European Patent Office | 2018

    Free access

    QUAY CRANE

    HAYASHI YU / EBIHARA KENJI | European Patent Office | 2017

    Free access