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
    ---><---

    References listed on IDEAS

    as
    1. Bouzekri, Hamza & Alpan, Gülgün & Giard, Vincent, 2021. "Integrated Laycan and Berth Allocation and time-invariant Quay Crane Assignment Problem in tidal ports with multiple quays," European Journal of Operational Research, Elsevier, vol. 293(3), pages 892-909.
    2. Paul Corry & Christian Bierwirth, 2019. "The Berth Allocation Problem with Channel Restrictions," Transportation Science, INFORMS, vol. 53(3), pages 708-727, May.
    3. Shuai Jia & Chung-Lun Li & Zhou Xu, 2019. "Managing Navigation Channel Traffic and Anchorage Area Utilization of a Container Port," Transportation Science, INFORMS, vol. 53(3), pages 728-745, May.
    4. Bierwirth, Christian & Meisel, Frank, 2015. "A follow-up survey of berth allocation and quay crane scheduling problems in container terminals," European Journal of Operational Research, Elsevier, vol. 244(3), pages 675-689.
    5. Lu Zhen & Qian Sun & Wei Zhang & Kai Wang & Wen Yi, 2021. "Column generation for low carbon berth allocation under uncertainty," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 72(10), pages 2225-2240, October.
    6. Bierwirth, Christian & Meisel, Frank, 2010. "A survey of berth allocation and quay crane scheduling problems in container terminals," European Journal of Operational Research, Elsevier, vol. 202(3), pages 615-627, May.
    7. Liu, Changchun, 2020. "Iterative heuristic for simultaneous allocations of berths, quay cranes, and yards under practical situations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 133(C).
    8. Vallada, Eva & Belenguer, Jose Manuel & Villa, Fulgencia & Alvarez-Valdes, Ramon, 2023. "Models and algorithms for a yard crane scheduling problem in container ports," European Journal of Operational Research, Elsevier, vol. 309(2), pages 910-924.
    9. Abou Kasm, Omar & Diabat, Ali & Chow, Joseph Y.J., 2023. "Simultaneous operation of next-generation and traditional quay cranes at container terminals," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1110-1125.
    10. Lalla-Ruiz, Eduardo & Expósito-Izquierdo, Christopher & Melián-Batista, Belén & Moreno-Vega, J. Marcos, 2016. "A Set-Partitioning-based model for the Berth Allocation Problem under Time-Dependent Limitations," European Journal of Operational Research, Elsevier, vol. 250(3), pages 1001-1012.
    11. Qin, Tianbao & Du, Yuquan & Sha, Mei, 2016. "Evaluating the solution performance of IP and CP for berth allocation with time-varying water depth," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 87(C), pages 167-185.
    12. Li, Shuqin & Jia, Shuai, 2019. "The seaport traffic scheduling problem: Formulations and a column-row generation algorithm," Transportation Research Part B: Methodological, Elsevier, vol. 128(C), pages 158-184.
    13. Yi Ding & Shuai Jia & Tianyi Gu & Chung-Lun Li, 2016. "SGICT Builds an Optimization-Based System for Daily Berth Planning," Interfaces, INFORMS, vol. 46(4), pages 281-296, August.
    14. Chenhao Zhou & Ning Ma & Xinhu Cao & Loo Hay Lee & Ek Peng Chew, 2021. "Classification and literature review on the integration of simulation and optimization in maritime logistics studies," IISE Transactions, Taylor & Francis Journals, vol. 53(10), pages 1157-1176, October.
    15. Feifeng Zheng & Ying Li & Feng Chu & Ming Liu & Yinfeng Xu, 2019. "Integrated berth allocation and quay crane assignment with maintenance activities," International Journal of Production Research, Taylor & Francis Journals, vol. 57(11), pages 3478-3503, June.
    16. Omar Abou Kasm & Ali Diabat & T. C. E. Cheng, 2020. "The integrated berth allocation, quay crane assignment and scheduling problem: mathematical formulations and a case study," Annals of Operations Research, Springer, vol. 291(1), pages 435-461, August.
    17. Wang, Mengyao & Zhou, Chenhao & Wang, Aihu, 2022. "A cluster-based yard template design integrated with yard crane deployment using a placement heuristic," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 160(C).
    18. Iris, Çağatay & Lam, Jasmine Siu Lee, 2019. "Recoverable robustness in weekly berth and quay crane planning," Transportation Research Part B: Methodological, Elsevier, vol. 122(C), pages 365-389.
    19. Hamza Bouzekri & Gülgün Alpan & Vincent Giard, 2021. "Integrated Laycan and Berth Allocation and time-invariant Quay Crane Assignment Problem in tidal ports with multiple quays," Post-Print hal-03107972, HAL.
    20. Hamza Bouzekri & Gülgün Alpan & Vincent Giard, 2021. "Integrated Laycan and Berth Allocation and time-invariant Quay Crane Assignment Problem in tidal ports with multiple quays," Post-Print hal-02480102, HAL.
    21. Jin, Jiahuan & Ma, Mingyu & Jin, Huan & Cui, Tianxiang & Bai, Ruibin, 2023. "Container terminal daily gate in and gate out forecasting using machine learning methods," Transport Policy, Elsevier, vol. 132(C), pages 163-174.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Liu, Baoli & Li, Zhi-Chun & Sheng, Dian & Wang, Yadong, 2021. "Integrated planning of berth allocation and vessel sequencing in a seaport with one-way navigation channel," Transportation Research Part B: Methodological, Elsevier, vol. 143(C), pages 23-47.
    2. Zhen, Lu & Zhuge, Dan & Wang, Shuaian & Wang, Kai, 2022. "Integrated berth and yard space allocation under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 1-27.
    3. Raeesi, Ramin & Sahebjamnia, Navid & Mansouri, S. Afshin, 2023. "The synergistic effect of operational research and big data analytics in greening container terminal operations: A review and future directions," European Journal of Operational Research, Elsevier, vol. 310(3), pages 943-973.
    4. Cao, Zhen & Wang, Wenyuan & Jiang, Ying & Xu, Xinglu & Xu, Yunzhuo & Guo, Zijian, 2022. "Joint berth allocation and ship loader scheduling under the rotary loading mode in coal export terminals," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 229-260.
    5. Chargui, Kaoutar & Zouadi, Tarik & Sreedharan, V. Raja & El Fallahi, Abdellah & Reghioui, Mohamed, 2023. "A novel robust exact decomposition algorithm for berth and quay crane allocation and scheduling problem considering uncertainty and energy efficiency," Omega, Elsevier, vol. 118(C).
    6. Liu, Baoli & Li, Zhi-Chun & Wang, Yadong, 2022. "A two-stage stochastic programming model for seaport berth and channel planning with uncertainties in ship arrival and handling times," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 167(C).
    7. Liu, Baoli & Li, Zhi-Chun & Wang, Yadong, 2023. "A branch-and-price heuristic algorithm for the bunkering operation problem of a liquefied natural gas bunkering station in the inland waterways," Transportation Research Part B: Methodological, Elsevier, vol. 167(C), pages 145-170.
    8. Wu, Lingxiao & Jia, Shuai & Wang, Shuaian, 2020. "Pilotage planning in seaports," European Journal of Operational Research, Elsevier, vol. 287(1), pages 90-105.
    9. Liu, Baoli & Li, Zhi-Chun & Wang, Yadong & Sheng, Dian, 2021. "Short-term berth planning and ship scheduling for a busy seaport with channel restrictions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 154(C).
    10. Abou Kasm, Omar & Diabat, Ali & Bierlaire, Michel, 2021. "Vessel scheduling with pilotage and tugging considerations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 148(C).
    11. Guo, Liming & Zheng, Jianfeng & Du, Haoming & Du, Jian & Zhu, Zhihong, 2022. "The berth assignment and allocation problem considering cooperative liner carriers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    12. Shuai Jia & Chung-Lun Li & Zhou Xu, 2019. "Managing Navigation Channel Traffic and Anchorage Area Utilization of a Container Port," Transportation Science, INFORMS, vol. 53(3), pages 728-745, May.
    13. Guo, Liming & Zheng, Jianfeng & Liang, Jinpeng & Wang, Shuaian, 2023. "Column generation for the multi-port berth allocation problem with port cooperation stability," Transportation Research Part B: Methodological, Elsevier, vol. 171(C), pages 3-28.
    14. Meixian Jiang & Jiajia Feng & Jian Zhou & Lin Zhou & Fangzheng Ma & Guanghua Wu & Yuqiu Zhang, 2023. "Multi-Terminal Berth and Quay Crane Joint Scheduling in Container Ports Considering Carbon Cost," Sustainability, MDPI, vol. 15(6), pages 1-20, March.
    15. Chargui, Kaoutar & Zouadi, Tarik & El Fallahi, Abdellah & Reghioui, Mohamed & Aouam, Tarik, 2021. "Berth and quay crane allocation and scheduling with worker performance variability and yard truck deployment in container terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 154(C).
    16. Rodrigues, Filipe & Agra, Agostinho, 2022. "Berth allocation and quay crane assignment/scheduling problem under uncertainty: A survey," European Journal of Operational Research, Elsevier, vol. 303(2), pages 501-524.
    17. Li, Shuqin & Jia, Shuai, 2019. "The seaport traffic scheduling problem: Formulations and a column-row generation algorithm," Transportation Research Part B: Methodological, Elsevier, vol. 128(C), pages 158-184.
    18. Guo, Liming & Zheng, Jianfeng & Du, Jian & Gao, Ziyou & Fagerholt, Kjetil, 2024. "Integrated planning of berth allocation, quay crane assignment and yard assignment in multiple cooperative terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 183(C).
    19. Liu, Changchun, 2020. "Iterative heuristic for simultaneous allocations of berths, quay cranes, and yards under practical situations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 133(C).
    20. Xiang, Xi & Liu, Changchun, 2021. "An expanded robust optimisation approach for the berth allocation problem considering uncertain operation time," Omega, Elsevier, vol. 103(C).

    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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.