IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v54y2024i4p329-356.html
   My bibliography  Save this article

Mathematical Programming-Driven Daily Berth Planning in Xiamen Port

Author

Listed:
  • Lu Zhen

    (School of Management, Shanghai University, Shanghai 200444, China)

  • Haolin Li

    (School of Management, Shanghai University, Shanghai 200444, China)

  • Liyang Xiao

    (School of Management, Shanghai University, Shanghai 200444, China)

  • Dayu Lin

    (Xiamen Container Terminal Group, Xiamen, Fujian 361006, China)

  • Shuaian Wang

    (Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Kowloon, Hong Kong SAR, 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.

Suggested Citation

  • Lu Zhen & Haolin Li & Liyang Xiao & Dayu Lin & Shuaian Wang, 2024. "Mathematical Programming-Driven Daily Berth Planning in Xiamen Port," Interfaces, INFORMS, vol. 54(4), pages 329-356, July.
    • Handle: RePEc:inm:orinte:v:54:y:2024:i:4:p:329-356
    DOI: 10.1287/inte.2023.0011
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.2023.0011
    Download Restriction: no
    File URL: https://libkey.io/10.1287/inte.2023.0011?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:orinte:v:54:y:2024:i:4:p:329-356. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.