Mathematical Programming-Driven Daily Berth Planning in Xiamen Port.

Saved in:
Bibliographic Details
Title: Mathematical Programming-Driven Daily Berth Planning in Xiamen Port.
Authors: Zhen, Lu (AUTHOR), Li, Haolin (AUTHOR), Xiao, Liyang (AUTHOR), Lin, Dayu (AUTHOR), Wang, Shuaian (AUTHOR)
Source: INFORMS Journal on Applied Analytics. Jul/Aug2024, Vol. 54 Issue 4, p329-356. 28p.
Subjects: Linear programming, Container terminals, Integer programming, Heuristic algorithms, Cranes (Machinery), Traffic engineering
Geographic Terms: Xiamen Shi (China)
Abstract: In this paper, we introduce the daily berth planning problem for Xiamen Hai-Tian Container Terminal (XHCT) at the Port of Xiamen, China, and propose the development and implementation of a berth planning system. The aim of the berth planning problem is to optimize daily berth plans by considering various decisions, including berth allocation, quay crane assignment, fairway traffic control, and berthing safety requirements. Among these decisions, the berthing safety requirement is a novel but practical problem in berth allocation that concerns the resource allocation related to berthing safety and interrelation with other decisions. A mathematical programming-driven methodological framework is designed with a 0-1 integer linear programming model for problem formulation and a highly efficient decomposition heuristic algorithm for solving the problem. This framework establishes the core for the berth planning system. The adoption of the berth planning system contributes to the increase of container throughput and berth capacity by transforming the planning process of XHCT. Moreover, the mathematical programming-driven daily berth planning informs further intelligent operations development in the Port of Xiamen and other container ports. History: This paper was refereed. Funding: This research was supported by the National Natural Science Foundation of China [Grants 72394360, 72394362, 72025103, 71831008, 72361137001, 72071173, and 72371221]. [ABSTRACT FROM AUTHOR]
Copyright of INFORMS Journal on Applied Analytics is the property of INFORMS: Institute for Operations Research & the Management Sciences and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Psychology and Behavioral Sciences Collection
Full text is not displayed to guests.
Description
Abstract:In this paper, we introduce the daily berth planning problem for Xiamen Hai-Tian Container Terminal (XHCT) at the Port of Xiamen, China, and propose the development and implementation of a berth planning system. The aim of the berth planning problem is to optimize daily berth plans by considering various decisions, including berth allocation, quay crane assignment, fairway traffic control, and berthing safety requirements. Among these decisions, the berthing safety requirement is a novel but practical problem in berth allocation that concerns the resource allocation related to berthing safety and interrelation with other decisions. A mathematical programming-driven methodological framework is designed with a 0-1 integer linear programming model for problem formulation and a highly efficient decomposition heuristic algorithm for solving the problem. This framework establishes the core for the berth planning system. The adoption of the berth planning system contributes to the increase of container throughput and berth capacity by transforming the planning process of XHCT. Moreover, the mathematical programming-driven daily berth planning informs further intelligent operations development in the Port of Xiamen and other container ports. History: This paper was refereed. Funding: This research was supported by the National Natural Science Foundation of China [Grants 72394360, 72394362, 72025103, 71831008, 72361137001, 72071173, and 72371221]. [ABSTRACT FROM AUTHOR]
ISSN:26440865
DOI:10.1287/inte.2023.0011