IDEAS home Printed from https://ideas.repec.org/a/eee/oprepe/v14y2025ics2214716025000107.html

The berth allocation problem in bulk terminals under uncertainty

Author

Listed:
  • Rodrigues, Filipe

Abstract

Uncertainty is critical in bulk terminals because it is inherent to many operations. In particular, the berth allocation problem (BAP) is greatly affected by the uncertain arrival times of the vessels. In this paper, we propose the first distributionally robust optimization (DRO) model for the BAP in bulk terminals, where the probability distribution of the arrival times is assumed to be unknown but belongs to an ambiguity set. To solve the model, we use an exact decomposition algorithm (DA) in which the probability distribution information is iteratively included in the master problem through optimal dual cuts. The DA is then enhanced with two improvement strategies to reduce the associated computational time; however, with these strategies, the DA may no longer be exact and is still inefficient for solving large-scale instances. To overcome these issues, we propose a modified exact DA where the dual cuts used in the original DA are replaced by powerful primal cuts that drastically reduce the time required to solve the DRO model, making it possible to handle large-scale instances. The reported computational experiments also show clear benefits of using DRO to tackle uncertainty compared to stochastic programming and robust optimization.

Suggested Citation

  • Rodrigues, Filipe, 2025. "The berth allocation problem in bulk terminals under uncertainty," Operations Research Perspectives, Elsevier, vol. 14(C).
    • Handle: RePEc:eee:oprepe:v:14:y:2025:i:c:s2214716025000107
    DOI: 10.1016/j.orp.2025.100334
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S2214716025000107
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.orp.2025.100334?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
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Zhen, Lu & He, Xueting & Zhuge, Dan & Wang, Shuaian, 2024. "Primal decomposition for berth planning under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 183(C).
    2. Umang, Nitish & Bierlaire, Michel & Vacca, Ilaria, 2013. "Exact and heuristic methods to solve the berth allocation problem in bulk ports," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 54(C), pages 14-31.
    3. Changchun Liu & Xi Xiang & Li Zheng, 2017. "Two decision models for berth allocation problem under uncertainty considering service level," Flexible Services and Manufacturing Journal, Springer, vol. 29(3), pages 312-344, December.
    4. Carlo, Héctor J. & Vis, Iris F.A. & Roodbergen, Kees Jan, 2014. "Transport operations in container terminals: Literature overview, trends, research directions and classification scheme," European Journal of Operational Research, Elsevier, vol. 236(1), pages 1-13.
    5. Agra, Agostinho & Rodrigues, Filipe, 2022. "Distributionally robust optimization for the berth allocation problem under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 164(C), pages 1-24.
    6. Rui Gao & Anton Kleywegt, 2023. "Distributionally Robust Stochastic Optimization with Wasserstein Distance," Mathematics of Operations Research, INFORMS, vol. 48(2), pages 603-655, May.
    7. Buddhi A. Weerasinghe & H. Niles Perera & Xiwen Bai, 2024. "Optimizing container terminal operations: a systematic review of operations research applications," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 26(2), pages 307-341, June.
    8. Xiang, Xi & Liu, Changchun, 2021. "An expanded robust optimisation approach for the berth allocation problem considering uncertain operation time," Omega, Elsevier, vol. 103(C).
    9. 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).
    10. Nitish Umang & Michel Bierlaire & Alan L. Erera, 2017. "Real-time management of berth allocation with stochastic arrival and handling times," Journal of Scheduling, Springer, vol. 20(1), pages 67-83, February.
    11. Wang, Chong & Liu, Kaiyuan & Zhang, Canrong & Miao, Lixin, 2024. "Distributionally robust chance-constrained optimization for the integrated berth allocation and quay crane assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 182(C).
    12. Amir Hossein Gharehgozli & Debjit Roy & René de Koster, 2016. "Sea container terminals: New technologies and OR models," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 18(2), pages 103-140, June.
    13. Wang, Chong & Wang, Qi & Xiang, Xi & Zhang, Canrong & Miao, Lixin, 2025. "Optimizing integrated berth allocation and quay crane assignment: A distributionally robust approach," European Journal of Operational Research, Elsevier, vol. 320(3), pages 593-615.
    14. Rodrigues, Filipe & Agra, Agostinho, 2021. "An exact robust approach for the integrated berth allocation and quay crane scheduling problem under uncertain arrival times," European Journal of Operational Research, Elsevier, vol. 295(2), pages 499-516.
    15. Ya Xu & Qiushuang Chen & Xiongwen Quan, 2012. "Robust berth scheduling with uncertain vessel delay and handling time," Annals of Operations Research, Springer, vol. 192(1), pages 123-140, January.
    16. 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.
    17. 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.
    18. Guevara, Esnil & Babonneau, Fréderic & Homem-de-Mello, Tito & Moret, Stefano, 2020. "A machine learning and distributionally robust optimization framework for strategic energy planning under uncertainty," Applied Energy, Elsevier, vol. 271(C).
    19. Karmel S. Shehadeh, 2023. "Distributionally Robust Optimization Approaches for a Stochastic Mobile Facility Fleet Sizing, Routing, and Scheduling Problem," Transportation Science, INFORMS, vol. 57(1), pages 197-229, January.
    20. Erick Delage & Yinyu Ye, 2010. "Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems," Operations Research, INFORMS, vol. 58(3), pages 595-612, June.
    21. Zhen, Lu, 2015. "Tactical berth allocation under uncertainty," European Journal of Operational Research, Elsevier, vol. 247(3), pages 928-944.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Agra, Agostinho & Rodrigues, Filipe, 2025. "Pareto front for two-stage distributionally robust optimization problems," European Journal of Operational Research, Elsevier, vol. 326(1), pages 174-188.

    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. 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.
    2. Dragović, Branislav & Dragović, Andro & Dulebenets, Maxim A., 2025. "The quay crane operation problem at marine container terminals: bibliometric analysis, emerging trends, and future research opportunities," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 201(C).
    3. Agra, Agostinho & Rodrigues, Filipe, 2025. "Pareto front for two-stage distributionally robust optimization problems," European Journal of Operational Research, Elsevier, vol. 326(1), pages 174-188.
    4. 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).
    5. Agra, Agostinho & Rodrigues, Filipe, 2022. "Distributionally robust optimization for the berth allocation problem under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 164(C), pages 1-24.
    6. Haoqi Xie & Daniela Ambrosino, 2025. "Operations Research, Machine Learning, and Integrated Techniques for Decision Problems in the Seaside Area of Container Terminals," SN Operations Research Forum, Springer, vol. 6(2), pages 1-51, June.
    7. 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.
    8. Gao, Zhendi & Ji, Mingjun & Kong, Lingrui & Ji, Shengzhong & Hou, Xinhao, 2026. "Integrated scheduling for ore terminals under cargo flow uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 205(C).
    9. 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).
    10. Xufeng Tang & Chang Liu & Xinqi Li & Ying Ji, 2023. "Distributionally Robust Programming of Berth-Allocation-with-Crane-Allocation Problem with Uncertain Quay-Crane-Handling Efficiency," Sustainability, MDPI, vol. 15(18), pages 1-27, September.
    11. Guo, Liming & Zheng, Jianfeng & Du, Jian, 2026. "Pricing and equity in strategic berth allocation problem considering general and dedicated service modes," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 205(C).
    12. Shaojian Qu & Xinqi Li & Chang Liu & Xufeng Tang & Zhisheng Peng & Ying Ji, 2023. "Two-Stage Robust Programming Modeling for Continuous Berth Allocation with Uncertain Vessel Arrival Time," Sustainability, MDPI, vol. 15(13), pages 1-30, July.
    13. Changchun Liu & Xi Xiang & Li Zheng, 2020. "A two-stage robust optimization approach for the berth allocation problem under uncertainty," Flexible Services and Manufacturing Journal, Springer, vol. 32(2), pages 425-452, June.
    14. Yang, Zhiyuan & Wang, Miaomiao & Wang, Shuaian & Zhen, Lu, 2025. "Optimizing continuous-time berth allocation, time-variant quay crane and yard assignment," Transportation Research Part B: Methodological, Elsevier, vol. 200(C).
    15. Wang, Chong & Wang, Qi & Xiang, Xi & Zhang, Canrong & Miao, Lixin, 2025. "Optimizing integrated berth allocation and quay crane assignment: A distributionally robust approach," European Journal of Operational Research, Elsevier, vol. 320(3), pages 593-615.
    16. 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).
    17. Yaqiong Lv & Jingwen Wang & Zhongyuan Liu & Mingkai Zou, 2025. "From Heuristics to Multi-Agent Learning: A Survey of Intelligent Scheduling Methods in Port Seaside Operations," Mathematics, MDPI, vol. 13(17), pages 1-57, August.
    18. 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.
    19. Jia, Shuai & Li, Chung-Lun & Meng, Qiang, 2024. "The dry dock scheduling problem," Transportation Research Part B: Methodological, Elsevier, vol. 181(C).
    20. Wang, Chong & Liu, Kaiyuan & Zhang, Canrong & Miao, Lixin, 2024. "Distributionally robust chance-constrained optimization for the integrated berth allocation and quay crane assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 182(C).

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:eee:oprepe:v:14:y:2025:i:c:s2214716025000107. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/operations-research-perspectives .

    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.