Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/74381
Title: Daily berth planning in a tidal port with channel flow control
Authors: Zhen, L
Liang, Z
Zhuge, D 
Lee, LH
Chew, EP
Keywords: Berth allocation
Column generation
Container ports
Port operations
Tide
Issue Date: 2017
Publisher: Pergamon Press
Source: Transportation research. Part B, Methodological, 2017, p. 2 How to cite?
Journal: Transportation research. Part B, Methodological 
Abstract: This paper studies an operational-level berth allocation and quay crane assignment problem (daily berth planning) considering tides and channel flow control constraints. An integer programming model is proposed for this problem. Then a column generation solution approach is developed on a set partitioning based reformulation of the original model. Computational study is conducted on 30 test cases constructed from real-world data to validate efficiency of the proposed solution approach. Results show that this simple but practical solution approach can optimally solve the daily berthing planning problem instances with up to 80 vessels, 40 berths, and 120 quay cranes within one hour, which is reasonable and acceptable for the real-world applications. The proposed decision model and the solution approach could be potentially useful for some tidal ports with (or without) navigation channels.
URI: http://hdl.handle.net/10397/74381
ISSN: 0191-2615
EISSN: 1879-2367
DOI: 10.1016/j.trb.2017.10.008
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

30
Last Week
0
Last month
Citations as of May 20, 2020

WEB OF SCIENCETM
Citations

23
Last Week
0
Last month
Citations as of May 27, 2020

Page view(s)

96
Last Week
6
Last month
Citations as of May 24, 2020

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.