Most of the operational problems in container terminals are strongly interconnected. In this paper, we study the integrated Berth Allocation and Quay Crane Assignment Problem in seaport container terminals. We will extend the current state-of-the-art by proposing novel set partitioning models. To improve the performance of the set partitioning formulations, a number of variable reduction techniques are proposed. Furthermore, we analyze the effects of different discretization schemes and the impact of using a time-variant/invariant quay crane allocation policy. Computational experiments show that the proposed models significantly improve the benchmark solutions of the current state-of-art optimal approaches.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Integrated Berth Allocation and Quay Crane Assignment Problem: Set partitioning models and computational results




    Publication date :

    2015




    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English



    Classification :

    BKL:    85.00 / 55.82 Güterverkehr




    Column Generation for the Integrated Berth Allocation, Quay Crane Assignment, and Yard Assignment Problem

    Wang, Kai / Zhen, Lu / Wang, Shuaian et al. | British Library Online Contents | 2018




    The simultaneous berth and quay crane allocation problem

    Imai, Akio / Chen, Hsieh Chia / Nishimura, Etsuko et al. | Elsevier | 2007