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.
Cost-Optimal-Based Model for the Berth Allocation Problem by Mixed Integer Programming
17th COTA International Conference of Transportation Professionals ; 2017 ; Shanghai, China
CICTP 2017 ; 1432-1439
2018-01-18
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Metaheuristic Approaches for the Minimum Cost Hybrid Berth Allocation Problem
Springer Verlag | 2017
|The stochastic discrete berth allocation problem
Online Contents | 2019
|Modeling and solving the Tactical Berth Allocation Problem
Elsevier | 2009
|The simultaneous berth and quay crane allocation problem
Online Contents | 2008
|The simultaneous berth and quay crane allocation problem
Elsevier | 2007
|