Abstract This paper considers a berth allocation problem (BAP) which requires the determination of exact berthing times and positions of incoming ships in a container port. The problem is solved by optimizing the berth schedule so as to minimize concurrently the three objectives of makespan, waiting time, and degree of deviation from a predetermined priority schedule. These objectives represent the interests of both port and ship operators. Unlike most existing approaches in the literature which are single-objective-based, a multi-objective evolutionary algorithm (MOEA) that incorporates the concept of Pareto optimality is proposed for solving the multi-objective BAP. The MOEA is equipped with three primary features which are specifically designed to target the optimization of the three objectives. The features include a local search heuristic, a hybrid solution decoding scheme, and an optimal berth insertion procedure. The effects that each of these features has on the quality of berth schedules are studied.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Multi-objective and prioritized berth allocation in container ports


    Contributors:
    Cheong, C. Y. (author) / Tan, K. C. (author) / Liu, D. K. (author) / Lin, C. J. (author)

    Published in:

    Publication date :

    2008-12-13


    Size :

    41 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Berth Allocation in Container Ports: A Particle Swarm Optimization (PSO)-Based Approach

    Joharianzadeh, Mohammad / Babazadeh, Abbas / Fakher, Ali | ASCE | 2013


    A Multi-Objective Approach in the Berth Allocation Planning

    Imai, A. / Nagaiwa, K. / ENEA; Agency: Italy | British Library Conference Proceedings | 1994


    Berth allocation recovery for container transshipment terminals

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