With globalization increasing countries’ trade volumes, resource management at container terminals has become more complex. To realistically address this problem, this paper proposes a methodology to solve the berth allocation and quay crane assignment problem (BACAP) while allowing the reassignment of vessels to other terminals in a multiuser container terminal. A filtered beam search (FBS)-based heuristic, a greedy randomized adaptive search procedure (GRASP)-based heuristic, and an iterative approach are integrated to provide a solution within a reasonable time frame. Numerical experiments are conducted with realistic instances from a container terminal located in Busan, Republic of Korea. The results show that the proposed approach yields a near-optimal solution with a significantly shorter computational time, compared with a commercial solver.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    An integrated method for berth allocation and quay crane assignment to allow for reassignment of vessels to other terminals


    Additional title:

    Marit Econ Logist


    Contributors:

    Published in:

    Publication date :

    2021-03-01


    Size :

    31 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English