TY - JOUR
T1 - The continuous Berth Allocation Problem
T2 - A Greedy Randomized Adaptive Search Solution
AU - Lee, Der Horng
AU - Chen, Jiang Hang
AU - Cao, Jin Xin
PY - 2010/11
Y1 - 2010/11
N2 - 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.
AB - 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.
KW - Berth Allocation Problem
KW - Container terminals
KW - GRASP
UR - http://www.scopus.com/inward/record.url?scp=77954316066&partnerID=8YFLogxK
U2 - 10.1016/j.tre.2010.01.009
DO - 10.1016/j.tre.2010.01.009
M3 - Article
AN - SCOPUS:77954316066
SN - 1366-5545
VL - 46
SP - 1017
EP - 1029
JO - Transportation Research Part E: Logistics and Transportation Review
JF - Transportation Research Part E: Logistics and Transportation Review
IS - 6
ER -