An integrated model for berth and yard planning in container terminals with multi-continuous berth layout

H. L. Ma (), S. H. Chung (), H. K. Chan () and Li Cui ()
Additional contact information
H. L. Ma: The Hong Kong Polytechnic University
S. H. Chung: The Hong Kong Polytechnic University
H. K. Chan: University of Nottingham Ningbo China
Li Cui: Dalian University of Technology

Annals of Operations Research, 2019, vol. 273, issue 1, No 14, 409-431

Abstract: 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; Yard storage allocation problem; Multi-continuous berth layout; Guided neighborhood search (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://link.springer.com/10.1007/s10479-017-2577-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:annopr:v:273:y:2019:i:1:d:10.1007_s10479-017-2577-1

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-017-2577-1

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().