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

Der-Horng Lee, Jiang Hang Chen and Jin Xin Cao

Transportation Research Part E: Logistics and Transportation Review, 2010, vol. 46, issue 6, 1017-1029

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.

Keywords: Berth; Allocation; Problem; GRASP; Container; terminals (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations: View citations in EconPapers (25)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S1366554510000207
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:transe:v:46:y:2010:i:6:p:1017-1029

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic
http://www.elsevier. ... 600244/bibliographic

Access Statistics for this article

Transportation Research Part E: Logistics and Transportation Review is currently edited by W. Talley

More articles in Transportation Research Part E: Logistics and Transportation Review from Elsevier
Bibliographic data for series maintained by Catherine Liu ().