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

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...

Full description

Saved in:
Bibliographic Details
Published in:Transportation research. Part E, Logistics and transportation review Logistics and transportation review, 2010-11, Vol.46 (6), p.1017-1029
Main Authors: Lee, Der-Horng, Chen, Jiang Hang, Cao, Jin Xin
Format: Article
Language:English
Subjects:
Allocations
Berth Allocation Problem
Berth Allocation Problem GRASP Container terminals
Container terminals
Dynamic tests
Dynamics
GRASP
Heuristic
Job shops
Logistics
Mathematical models
Optimization
Optimization algorithms
Searching
Stochasticity
Studies
Transportation
Transportation problem (Operations research)
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1366-5545
1878-5794
DOI:10.1016/j.tre.2010.01.009