A berth allocation strategy using heuristics algorithm and simulation optimisation. (24th November 2008)

• Record Type: Journal Article
• Authors: Chang, Daofang; Yan, Wei; Chen, Chun-Hisen; Jiang, Zuhua
• Is Part Of: International journal of computer applications technology. Volume 32:Number 4(2008)
• Page Start: 272
• Page End: 281
• Publication Date: 2008-11-24
• Subjects: container terminals -- quay length -- operational efficiency -- dynamic berth allocation -- heuristic algorithms -- simulation optimisation -- logistics -- container terminal management -- container yards -- yard planning; Technology -- Data processing -- Periodicals; 620.00285
• Languages: English
• ISSNs: 0952-8091

Abstract

The Berth Allocation Problem (BAP) becomes critically important to the operational efficiency of a container terminal due to rapid advances in container terminal management. For reducing the total berthing time and cost, intensive research concerning only the berthing stage has been conducted. Accordingly, a broader viewpoint, i.e., an integration of berth allocation and yard planning, has not been well addressed. As such, a novel BAP strategy, which combines dynamic berth allocation and yard planning, is investigated in this study. An example of a specific container terminal in Shanghai is used to illustrate the feasibility and effectiveness of the proposed approach.