Daily berth planning in a tidal port with channel flow control

Lu Zhen, Zhe Liang, Dan Zhuge, Loo Hay Lee, Ek Peng Chew

Research output: Journal article publicationJournal articleAcademic researchpeer-review

67 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)193-217
Number of pages25
JournalTransportation Research Part B: Methodological
Volume106
DOIs
Publication statusPublished - Dec 2017

Keywords

  • Berth allocation
  • Column generation
  • Container ports
  • Port operations
  • Tide

ASJC Scopus subject areas

  • Civil and Structural Engineering
  • Transportation

Cite this