Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/104530
PIRA download icon_1.1View/Download Full Text
Title: An integrated model for berth and yard planning in container terminals with multi-continuous berth layout
Authors: Ma, HL 
Chung, SH 
Chan, HK
Cui, L
Issue Date: Feb-2019
Source: Annals of operations research, Feb. 2019, v. 273, no. 1-2, p. 409-431
Abstract: Discontinuities and sharp curves commonly exist in the berth layout of container terminals. To cope with these layout characteristics, traditional studies proposed discrete or hybrid modeling approaches. However, the drawback of these approaches is the low berth space utilization. In reality, berth space is a very scarce resource and the development of which usually involves huge investments. Accordingly, a high space utilization approach is usually indispensable to a container terminal. In the literature, continuous berth layout modeling approach is sophisticated to be good in space utilization. However, its application is limited to continuous layouts, but not for discontinuities. In other words, it is not applicable to many container terminals in reality. To fill this gap, this paper studies an integrated berth allocation and yard planning problem with discontinuities berth layout. A novel multi-continuous berth layout approach and a mixed integer linear programming are proposed to deal with this new problem. In addition, a Guided Neighborhood Search (GNS) is proposed to enhance the optimization efficiency. Experimental results show that the GNS significantly reduce computational time enabling the proposed algorithm to be applied in reality. In addition, the proposed approach increases the berth space utilization, and consequently reducing the waiting time of incoming vessels. Furthermore, by simultaneously integrating the berth position and yard storage position, the total travelling distance of containers is being minimized. As a result, the overall performance of the terminal is improved.
Keywords: Berth allocation problem
Guided neighborhood search
Multi-continuous berth layout
Yard storage allocation problem
Publisher: Springer New York LLC
Journal: Annals of operations research 
ISSN: 0254-5330
EISSN: 1572-9338
DOI: 10.1007/s10479-017-2577-1
Rights: © Springer Science+Business Media, LLC 2017
This version of the article has been accepted for publication, after peer review (when applicable) and is subject to Springer Nature’s AM terms of use (https://www.springernature.com/gp/open-research/policies/accepted-manuscript-terms), but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: http://dx.doi.org/10.1007/s10479-017-2577-1.
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
Chung_Integrated_Model_Berth.pdfPre-Published version1.79 MBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page views

100
Last Week
3
Last month
Citations as of Nov 30, 2025

Downloads

708
Citations as of Nov 30, 2025

SCOPUSTM   
Citations

33
Citations as of Dec 19, 2025

WEB OF SCIENCETM
Citations

28
Citations as of Dec 18, 2025

Google ScholarTM

Check

Altmetric


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