Journal of Optimization and Supply Chain Management

Journal of Optimization and Supply Chain Management

A MILP Decision-Support Model for Priority-Aware Berth Planning in the Multipurpose Port of Sfax

Document Type : Case Study

Authors
Faculty of Economics and Management of Sfax, University of Sfax, Sfax, Tunisia
Abstract
Objective: This study develops a priority-aware berth allocation model for a multipurpose port environment, with an application to the Port of Sfax, Tunisia.
Methods: A deterministic, static, and discrete mixed-integer linear programming model is formulated to assign vessels to feasible berths and service starting times while considering cargo compatibility, berth length, admissible draft, priority rules, waiting-time limits, and berth-dependent sequencing.
Results: Ten operational instances involving 275 vessels are solved with CPLEX 12.4. The optimized schedules reduce total time in port from 3347 to 3072 hours, yielding a reduction of 275 hours, equivalent to approximately 11.5 days. The optimality gap is 0% for all tested instances.
Conclusion: The results indicate that exact optimization can support transparent berth-planning decisions in multipurpose ports, particularly when berth compatibility, vessel priority, and sequencing restrictions interact.
Keywords
Subjects

Agra, A., & Oliveira, M. (2018). MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem. European Journal of Operational Research, 264(1), 138-148.
Agra, A., & Rodrigues, F. (2022). Distributionally robust optimization for the berth allocation problem under uncertainty. Transportation Research Part B: Methodological, 164, 1-24. https://doi.org/10.1016/j.trb.2022.07.009
Bierwirth, C., & Meisel, F. (2010). A survey of berth allocation and quay crane scheduling problems in container terminals. European Journal of Operational Research, 202(3), 615-627. https://doi.org/10.1016/j.ejor.2009.05.031
Bierwirth, C., & Meisel, F. (2015). A follow-up survey of berth allocation and quay crane scheduling problems in container terminals. European Journal of Operational Research, 244(3), 675-689. https://doi.org/10.1016/j.ejor.2014.12.030
Chang, D., Jiang, Z., Yan, W., & He, J. (2010). Integrating berth allocation and quay crane assignments. Transportation Research Part E: Logistics and Transportation Review, 46(6), 975-990.
Cordeau, J.-F., Laporte, G., Legato, P., & Moccia, L. (2005). Models and tabu search heuristics for the berth-allocation problem. Transportation Science, 39(4), 526-538. https://doi.org/10.1287/trsc.1050.0120
Giallombardo, G., Moccia, L., Salani, M., & Vacca, I. (2010). Modeling and solving the tactical berth allocation problem. Transportation Research Part B: Methodological, 44(2), 232-245. https://doi.org/10.1016/j.trb.2009.07.003
Imai, A., Nishimura, E., & Papadimitriou, S. (2001). The dynamic berth allocation problem for a container port. Transportation Research Part B: Methodological, 35(4), 401-417. https://doi.org/10.1016/S0191-2615(99)00057-0
Imai, A., Nishimura, E., & Papadimitriou, S. (2003). Berth allocation with service priority. Transportation Research Part B: Methodological, 37(5), 437-457.
Imai, A., Sun, X., Nishimura, E., & Papadimitriou, S. (2005). Berth allocation in a container port: Using a continuous location space approach. Transportation Research Part B: Methodological, 39(3), 199-221.
Iris, C., Pacino, D., Ropke, S., & Larsen, A. (2017). Improved formulations and an adaptive large neighborhood search heuristic for the integrated berth allocation and quay crane assignment problem. Transportation Research Part E: Logistics and Transportation Review, 105, 123-147.
Lassoued, R., & Elloumi, A. (2019). The discrete and dynamic berth allocation problem in bulk port. In Proceedings of the International Conference on Control, Decision and Information Technologies. https://doi.org/10.1109/CoDIT.2019.8820590
Lim, A. (1998). The berth planning problem. Operations Research Letters, 22(2-3), 105-110. https://doi.org/10.1016/S0167-6377(98)00010-8
Meisel, F. (2009). Seaside operations planning in container terminals. Physica-Verlag.
Monaco, M. F., & Sammarra, M. (2007). The berth allocation problem: A strong formulation solved by a Lagrangean approach. Transportation Science, 41(2), 265-280. https://doi.org/10.1287/trsc.1060.0171
Notteboom, T., Pallis, A., & Rodrigue, J.-P. (2022). Port economics, management and policy. Routledge.
Ozcan, I., & Aytar, S. (2022). Application of polygonal fuzzy numbers to the basic economic order quantity model. OPSEARCH, 59, 482-493. https://doi.org/10.1007/s12597-021-00529-1
Ozcan, I., Alparslan Gok, S. Z., & Weber, G.-W. (2023). On sequencing fuzzy interval games. Management and Production Engineering Review, 14, 10-18. https://doi.org/10.24425/mper.2023.147199
Ozcan, I., Sledzinski, J. D., Alparslan Gok, S. Z., Meca, A., Weber, G.-W., Butlewski, M., & Kocadag, E. (2025). A game theory perspective on strategic profit distribution in complex IT projects. Journal of Industrial and Management Optimization, 21(2), 1503-1517. https://doi.org/10.3934/jimo.2024135
Park, Y.-M., & Kim, K. H. (2003). A scheduling method for berth and quay cranes. OR Spectrum, 25(1), 1-23.
Rodrigues, F., & Agra, A. (2021). An exact robust approach for the integrated berth allocation and quay crane scheduling problem under uncertain arrival times. European Journal of Operational Research, 295(2), 499-516. https://doi.org/10.1016/j.ejor.2021.03.016
Rodrigues, F., & Agra, A. (2022). Berth allocation and quay crane assignment/scheduling problem under uncertainty: A survey. European Journal of Operational Research, 303(2), 501-524.
Ursavas, E. (2022). Priority control of berth allocation problem in container terminals. Annals of Operations Research, 317(2), 805-824. https://doi.org/10.1007/s10479-015-1912-7
Xiang, X., & Liu, C. (2021). An expanded robust optimisation approach for the berth allocation problem considering uncertain operation time. Omega, 103, Article 102444. https://doi.org/10.1016/j.omega.2021.102444