AbstractThis paper addresses efficient berth and crane allocation scheduling at a multi-user container terminal. First, we introduce a formulation for the simultaneous berth and crane allocation problem. Next, by employing genetic algorithm we develop a heuristic to find an approximate solution for the problem. The fitness value of a chromosome is obtained by crane transfer scheduling across berths, which is determined by a maximum flow problem-based algorithm based on a berth allocation problem solution defined by the chromosome. The results of numerical experiments show that the proposed heuristic is applicable to solve this difficult but essential terminal operation problem.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    The simultaneous berth and quay crane allocation problem


    Beteiligte:


    Erscheinungsdatum :

    2007-03-24


    Format / Umfang :

    21 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch






    Integrating berth allocation and quay crane assignments

    Chang, Daofang / Jiang, Zuhua / Yan, Wei et al. | Elsevier | 2010


    Integrating berth allocation and quay crane assignments

    Chang, Daofang | Online Contents | 2010


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

    Li, N. / Jin, Z.H. / Massami, E. | British Library Conference Proceedings | 2011