The combined optimization of continuous berth allocation problem and quay crane assignment problem are solved. Considering the real constraints of container terminal, an improved genetic algorithm is proposed. The chromosome is composed of berthing time, berthing location and number of quay cranes. While in the following, specific quay cranes are fixed to assign to ships. Through comparisons with the former two literatures, the results are improved averagely by 33.78% and 28.57% respectively by the proposed genetic algorithm, which shows its effectiveness.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A New Genetic Algorithm for Continuous Berth and Quay Crane Allocation Problem



    Published in:

    Publication date :

    2011-09-08


    Size :

    4 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English