AbstractThis paper addresses the berth allocation problem in a multi-user container terminal. There are two typical schemes for berth allocation: one in discrete locations and the other in continuous locations. The former has the advantage of easiness in scheduling but it has a weakness in that terminal usage is not fully efficient. The latter exhibits the complete opposite characteristics. In previous papers, the authors have developed and presented the discrete location version of the berth allocation problem. In view of the steadily growing trend in increasing the container ship size, more flexible berth allocation planning is mandatory, especially in busy hub ports where ships of various sizes are calling. In this paper, a heuristic for the berth allocation problem in continuous locations is presented. A wide variety of experiments were conducted and the results showed that the heuristic works well from a practical point of view.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Berth allocation in a container port: using a continuous location space approach


    Beteiligte:
    Imai, Akio (Autor:in) / Sun, Xin (Autor:in) / Nishimura, Etsuko (Autor:in) / Papadimitriou, Stratos (Autor:in)

    Erschienen in:

    Erscheinungsdatum :

    2004-04-05


    Format / Umfang :

    23 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch






    Berth allocation recovery for container transshipment terminals

    Lv, Xiaohuan / Jin, Jian Gang / Hu, Hao | Taylor & Francis Verlag | 2020


    Green shipping oriented coordinated berth allocation for port group

    Heng, Zhang / Qiushuang, Chen / Xiongwen, Quan et al. | IEEE | 2015


    Green Shipping Oriented Coordinated Berth Allocation for Port Group

    Zhang, Heng / Chen, Qiushuang / Quan, XiongWen et al. | TIBKAT | 2015