Multimodal transportation can improve transportation efficiency and further reduce logistics cost. The reloading efficiency between different transportation modes becomes more and more important in multimodal transportation. The operational efficiency in seaport terminals is of paramount importance for international multimodal transportation, so it is necessary to research the berth allocation problem. This paper addresses the berth allocation problem under a cost-based objective. Its goal is to allocate the available berthing positions and schedule the berthing time for the container vessels in order to minimize the total operation cost in seaport terminals. Total operation cost is mainly embodied with additional travel cost and penalty cost due to non-optimal berth allocation. In previous papers, the authors have developed and presented the berth allocation problem based on time limitation, whose goal is to minimize the total waiting time of all vessels. In view of the steadily growing cost in seaport terminal operation, this paper proposes a cost-optimal-based model for the berth allocation problem. A numerical example is conducted by mixed integer programming and calculated by AMPL. The result shows that the optimization model is feasible.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Cost-Optimal-Based Model for the Berth Allocation Problem by Mixed Integer Programming


    Contributors:
    Yuan, Yu (author)

    Conference:

    17th COTA International Conference of Transportation Professionals ; 2017 ; Shanghai, China


    Published in:

    CICTP 2017 ; 1432-1439


    Publication date :

    2018-01-18




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    A dynamic programming-based matheuristic for the dynamic berth allocation problem

    Nishi, Tatsushi / Okura, Tatsuya / Lalla-Ruiz, Eduardo et al. | Springer Verlag | 2020


    Metaheuristic Approaches for the Minimum Cost Hybrid Berth Allocation Problem

    Kovač, Nataša / Stanimirović, Zorica / Davidović, Tatjana | Springer Verlag | 2017


    A Rolling Horizon-Based Constraint Programming Method for Continuous Berth Allocation Problem

    Liu, Qiang / Xu, Tongtong / Liu, Huashi et al. | Springer Verlag | 2024


    The stochastic discrete berth allocation problem

    Schepler, Xavier / Absi, Nabil / Feillet, Dominique et al. | Online Contents | 2019


    Integrated Laycan and Berth Allocation Problem

    Bouzekri, Hamza / Alpan, Gulgun / Giard, Vincent | IEEE | 2019