IDEAS home Printed from https://ideas.repec.org/a/gam/jlogis/v8y2024i2p50-d1389800.html
   My bibliography  Save this article

Mathematical Programming Formulations for the Berth Allocation Problems in Container Seaport Terminals

Author

Listed:
  • Awad M. Aljuaid

    (Department of Industrial Engineering, College of Engineering, Taif University, Taif 21944, Saudi Arabia)

  • Mayssa Koubâa

    (OLID Research Laboratory, Higher Institute of Industrial Management of Sfax, University of Sfax, Sfax 3021, Tunisia)

  • Mohamed Haykal Ammar

    (OLID Research Laboratory, Higher Institute of Industrial Management of Sfax, University of Sfax, Sfax 3021, Tunisia)

  • Karim Kammoun

    (Laboratoire de Recherche en Compétitivité, Décisions Commerciales et Internationalisation (CODECI), Faculty of Economics and Management of Sfax, University of Sfax, Sfax 3018, Tunisia)

  • Wafik Hachicha

    (Department of Industrial Engineering, College of Engineering, Taif University, Taif 21944, Saudi Arabia)

Abstract

Background: Improving the performance of marine terminals is one of the major concerns of both researchers and decision-makers in the maritime transportation sector. The problem of container storage planning and the berth allocation problem (BAP) are the two mainstays of optimizing port operations. Methods: In this work, we address these two issues, proposing two mathematical models that operate sequentially and are applicable to both static and dynamic cases. The first developed model is a mixed-integer linear problem model aimed at minimizing vessel traffic time in the port. The second model developed is a multi-objective optimization model based on goal programming (GP) to minimize both container transfer time and the number of storage areas (minimizing container dispersion). Results: The robustness of the proposed models has been proven through a benchmark with tests using data from the literature and real port data, based on the IBM ILOG CPLEX 12.5 solver. Conclusions: The two developed mathematical models allowed the both minimization of the transfer time and the number of used storage areas, whatever the number of operations handling companies (OHCs) operating in the seaport and for both static and dynamic cases. We propose, as prospects for this work, the development of a heuristic model to deal with the major instances relating to the case of large ports.

Suggested Citation

  • Awad M. Aljuaid & Mayssa Koubâa & Mohamed Haykal Ammar & Karim Kammoun & Wafik Hachicha, 2024. "Mathematical Programming Formulations for the Berth Allocation Problems in Container Seaport Terminals," Logistics, MDPI, vol. 8(2), pages 1-17, May.
    • Handle: RePEc:gam:jlogis:v:8:y:2024:i:2:p:50-:d:1389800
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2305-6290/8/2/50/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2305-6290/8/2/50/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Golias, Mihalis M. & Boile, Maria & Theofanis, Sotirios, 2009. "Berth scheduling by customer service differentiation: A multi-objective approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 45(6), pages 878-892, November.
    2. Nishimura, Etsuko & Imai, Akio & Papadimitriou, Stratos, 2001. "Berth allocation planning in the public berth system by genetic algorithms," European Journal of Operational Research, Elsevier, vol. 131(2), pages 282-292, June.
    3. Ivana Vukicevic Bisevac & Natasa Vidic & Katarina Vukadinovic & Benjamin Ivorra, 2021. "A Solution Approach to the Daily Dockworker Planning Problem at a Port Container Terminal," Mathematical Problems in Engineering, Hindawi, vol. 2021, pages 1-11, February.
    4. Ting, Ching-Jung & Wu, Kun-Chih, 2017. "Optimizing container relocation operations at container yards with beam search," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 103(C), pages 17-31.
    5. 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.
    6. I D Wilson & P A Roach, 2000. "Container stowage planning: a methodology for generating computerised solutions," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 51(11), pages 1248-1255, November.
    7. Zhang, Chuqian & Liu, Jiyin & Wan, Yat-wah & Murty, Katta G. & Linn, Richard J., 2003. "Storage space allocation in container terminals," Transportation Research Part B: Methodological, Elsevier, vol. 37(10), pages 883-903, December.
    8. Doaa Naeem & Amr Eltawil & Junichi Iijima & Mohamed Gheith, 2022. "Integrated Scheduling of Automated Yard Cranes and Automated Guided Vehicles with Limited Buffer Capacity of Dual-Trolley Quay Cranes in Automated Container Terminals," Logistics, MDPI, vol. 6(4), pages 1-17, December.
    9. Mihalis M Golias & Georgios K Saharidis & Maria Boile & Sotirios Theofanis & Marianthi G Ierapetritou, 2009. "The berth allocation problem: Optimizing vessel arrival time," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 11(4), pages 358-377, December.
    10. Kim, Kap Hwan & Park, Kang Tae, 2003. "A note on a dynamic space-allocation method for outbound containers," European Journal of Operational Research, Elsevier, vol. 148(1), pages 92-101, July.
    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. Lu Zhen & Ek Peng Chew & Loo Hay Lee, 2011. "An Integrated Model for Berth Template and Yard Template Planning in Transshipment Hubs," Transportation Science, INFORMS, vol. 45(4), pages 483-504, November.
    2. 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.
    3. Azab, Ahmed & Morita, Hiroshi, 2022. "Coordinating truck appointments with container relocations and retrievals in container terminals under partial appointments information," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 160(C).
    4. 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.
    5. Voß, Andre & Guckenbiehl, Gabriel & Schütt, Holger & Buer, Tobias, 2016. "A storage strategy with dynamic bay reservations for container terminals," Bremen Computational Logistics Group Working Papers 4, University of Bremen, Computational Logistics Junior Research Group.
    6. 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.
    7. Zhang, Canrong & Wu, Tao & Kim, Kap Hwan & Miao, Lixin, 2014. "Conservative allocation models for outbound containers in container terminals," European Journal of Operational Research, Elsevier, vol. 238(1), pages 155-165.
    8. Mar-Ortiz, Julio & Castillo-García, Norberto & Gracia, María D., 2020. "A decision support system for a capacity management problem at a container terminal," International Journal of Production Economics, Elsevier, vol. 222(C).
    9. Facchini, F. & Digiesi, S. & Mossa, G., 2020. "Optimal dry port configuration for container terminals: A non-linear model for sustainable decision making," International Journal of Production Economics, Elsevier, vol. 219(C), pages 164-178.
    10. Yuquan Du & Qiushuang Chen & Jasmine Siu Lee Lam & Ya Xu & Jin Xin Cao, 2015. "Modeling the Impacts of Tides and the Virtual Arrival Policy in Berth Allocation," Transportation Science, INFORMS, vol. 49(4), pages 939-956, November.
    11. 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).
    12. Lehnfeld, Jana & Knust, Sigrid, 2014. "Loading, unloading and premarshalling of stacks in storage areas: Survey and classification," European Journal of Operational Research, Elsevier, vol. 239(2), pages 297-312.
    13. Yu, Jingjing & Tang, Guolei & Song, Xiangqun, 2022. "Collaboration of vessel speed optimization with berth allocation and quay crane assignment considering vessel service differentiation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 160(C).
    14. Imai, Akio & Yamakawa, Yukiko & Huang, Kuancheng, 2014. "The strategic berth template problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 72(C), pages 77-100.
    15. Jingjing Tong & Heather Nachtmann, 2017. "Cargo prioritization and terminal allocation problem for inland waterway disruptions," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 19(3), pages 403-427, August.
    16. Woo, Youn Ju & Kim, Kap Hwan, 2011. "Estimating the space requirement for outbound container inventories in port container terminals," International Journal of Production Economics, Elsevier, vol. 133(1), pages 293-301, September.
    17. Xiang, Xi & Liu, Changchun & Miao, Lixin, 2017. "A bi-objective robust model for berth allocation scheduling under uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 294-319.
    18. Jin, Xuefeng & Park, Kang Tae & Kim, Kap Hwan, 2019. "Storage space sharing among container handling companies," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 127(C), pages 111-131.
    19. Lee, Der-Horng & Jin, Jian Gang & Chen, Jiang Hang, 2012. "Terminal and yard allocation problem for a container transshipment hub with multiple terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(2), pages 516-528.
    20. Saurí, S. & Martín, E., 2011. "Space allocating strategies for improving import yard performance at marine terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 47(6), pages 1038-1057.

    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:gam:jlogis:v:8:y:2024:i:2:p:50-:d:1389800. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.