With the current development of the berth and quay crane in China, minimizing the total time of all ships stopping at the port, and maximizing the utilization rate of quay cranes to reduce the waiting time in the queue at the anchorage are the key to success in the field of container terminals. The objective of this paper is to minimize the total time of all stopped ships at the port and to maximize the operation efficiency of quay cranes. Compared with single berth and quay crane allocation, this paper analyzes the berth-quay crane as a whole, and an integer programming model with some constraints is built for this problem. Then the heuristic algorithm is used in this paper to optimize the problem and gain the solution. This paper provides a guide for practical operation.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    The Integrated Berth and Quay Crane Scheduling Problem in Container Terminals



    Published in:

    Applied Mechanics and Materials ; 587-589 ; 1793-1796


    Publication date :

    2014-07-04


    Size :

    4 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English






    Heuristics for quay crane scheduling at indented berth

    Chen, Jiang Hang | Online Contents | 2011


    Integrated of Berth Schedule and Quay Crane Allocation in Container Terminal

    Qian, Ji Feng ;Zhu, Xiao Ning ;Liu, Yong Jun | Trans Tech Publications | 2014