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

Awad M. Aljuaid, Mayssa Koubâa, Mohamed Haykal Ammar, Karim Kammoun and Wafik Hachicha ()
Additional contact information
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

Logistics, 2024, vol. 8, issue 2, 1-17

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.

Keywords: container terminals; berth allocation problem; container transfer and storage; multiple operations holding companies; mixed-integer linear programming; goal programming; static and dynamic data; mathematical modeling; flow time (search for similar items in EconPapers)
JEL-codes: L8 L80 L81 L86 L87 L9 L90 L91 L92 L93 L98 L99 M1 M10 M11 M16 M19 R4 R40 R41 R49 (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2305-6290/8/2/50/pdf (application/pdf)
https://www.mdpi.com/2305-6290/8/2/50/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jlogis:v:8:y:2024:i:2:p:50-:d:1389800

Access Statistics for this article

Logistics is currently edited by Ms. Mavis Li

More articles in Logistics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().