Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.tre.2010.01.009
Title: The continuous Berth Allocation Problem: A Greedy Randomized Adaptive Search Solution
Authors: Lee, D.-H. 
Chen, J.H.
Cao, J.X.
Keywords: Berth Allocation Problem
Container terminals
GRASP
Issue Date: Nov-2010
Citation: Lee, D.-H., Chen, J.H., Cao, J.X. (2010-11). The continuous Berth Allocation Problem: A Greedy Randomized Adaptive Search Solution. Transportation Research Part E: Logistics and Transportation Review 46 (6) : 1017-1029. ScholarBank@NUS Repository. https://doi.org/10.1016/j.tre.2010.01.009
Abstract: 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. © 2010 Elsevier Ltd.
Source Title: Transportation Research Part E: Logistics and Transportation Review
URI: http://scholarbank.nus.edu.sg/handle/10635/66280
ISSN: 13665545
DOI: 10.1016/j.tre.2010.01.009
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

58
checked on Nov 9, 2018

WEB OF SCIENCETM
Citations

50
checked on Oct 31, 2018

Page view(s)

39
checked on Oct 6, 2018

Google ScholarTM

Check

Altmetric


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