The continuous Berth Allocation Problem: A Greedy Randomized Adaptive Search Solution

Der Horng Lee*, Jiang Hang Chen, Jin Xin Cao

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

103 Citations (Scopus)


In this research, continuous and dynamic Berth Allocation Problem (BAP) is studied to minimize the total weighted flow time. Different from previous studies on continuous BAP, an efficient method is proposed to address the problem to identify the possible locations for next vessel in the Time-space diagram. Then two versions of Greedy Randomized Adaptive Search Procedure (GRASP) are developed to search for near optimal solutions. Both small and large scale numerical experiments are tested to examine the effectiveness of the proposed GRASPs by comparison with CPLEX and stochastic beam search, respectively.

Original languageEnglish
Pages (from-to)1017-1029
Number of pages13
JournalTransportation Research Part E: Logistics and Transportation Review
Issue number6
Publication statusPublished - Nov 2010
Externally publishedYes


  • Berth Allocation Problem
  • Container terminals

Cite this