Abstract
The Berth Allocation Problem (BAP) is considered as one of the most important operational problems in the seaside area of ports. It refers to the problem of assigning a set of vessels to a given berth layout within a given time horizon. In this paper, we study the dynamic and hybrid case of the BAP in the context of bulk ports with multiple quays, different water depths, and heterogeneous loading equipment, considering routing constraints (routes between storage hangars and berths). This study is motivated by the operations of OCP Group, a world leader in the phosphate industry, at the bulk port of Jorf Lasfar in Morocco, recognized as the largest ore port in Africa. The objective of the problem is to enhance the coordination between the berthing and yard activities, besides maximizing the difference between the despatch money and the demurrage charges of all berthed vessels. We propose an integer linear programming model formulated with predicates, which ensures maximum flexibility in the implementation of the model. Finally, the proposed model is tested and validated through numerical experiments based on instances inspired by real bulk port data. The results show that the model can be used to solve to optimality instances with up to 40 vessels within reasonable computational time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Umang, N., Bierlaire, M., Vacca, I.: Exact and heuristic methods to solve the berth allocation problem in bulk ports. Transp. Res. Part E: Logistics Transp. Rev. 54, 14–31 (2013). https://doi.org/10.1016/j.tre.2013.03.003
Ernst, A.T., Oğuz, C., Singh, G., Taherkhani, G.: Mathematical models for the berth allocation problem in dry bulk terminals. J Sched. 20, 459–473 (2017). https://doi.org/10.1007/s10951-017-0510-8
Barros, V.H., Costa, T.S., Oliveira, A.C.M., Lorena, L.A.N.: Model and heuristic for berth allocation in tidal bulk ports with stock level constraints. Comput. Ind. Eng. 60, 606–613 (2011). https://doi.org/10.1016/j.cie.2010.12.018
Robenek, T., Umang, N., Bierlaire, M., Ropke, S.: A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports. Eur. J. Oper. Res. 235, 399–411 (2014). https://doi.org/10.1016/j.ejor.2013.08.015
Unsal, O., Oguz, C.: An exact algorithm for integrated planning of operations in dry bulk terminals. Transp. Res. Part E Logistic Transp. Rev. 126, 103–121 (2019). https://doi.org/10.1016/j.tre.2019.03.018
Pratap, S., Nayak, A., Kumar, A., Cheikhrouhou, N., Tiwari, M.K.: An integrated decision support system for berth and ship unloader allocation in bulk material handling port. Comput. Ind. Eng. 106, 386–399 (2017). https://doi.org/10.1016/j.cie.2016.12.009
Menezes, G.C., Mateus, G.R., Ravetti, M.G.: A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports. Eur. J. Oper. Res. 258, 926–937 (2017). https://doi.org/10.1016/j.ejor.2016.08.073
Bouzekri, H., Alpan, G., Giard, V.: Integrated Laycan and Berth allocation problem. In: 2019 International Conference on Industrial Engineering and Systems Management (IESM), pp. 1–6, Shanghai, China (2019). https://doi.org/10.1109/IESM45758.2019.8948110
Bouzekri, H., Alpan, G., Giard, V.: A dynamic hybrid berth allocation problem with routing constraints in Bulk Ports: Data sets and results. Mendeley Data, v2 (2020). http://dx.doi.org/10.17632/bzmgbjttv3.2
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 IFIP International Federation for Information Processing
About this paper
Cite this paper
Bouzekri, H., Alpan, G., Giard, V. (2020). A Dynamic Hybrid Berth Allocation Problem with Routing Constraints in Bulk Ports. In: Lalic, B., Majstorovic, V., Marjanovic, U., von Cieminski, G., Romero, D. (eds) Advances in Production Management Systems. The Path to Digital Transformation and Innovation of Production Management Systems. APMS 2020. IFIP Advances in Information and Communication Technology, vol 591. Springer, Cham. https://doi.org/10.1007/978-3-030-57993-7_29
Download citation
DOI: https://doi.org/10.1007/978-3-030-57993-7_29
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-57992-0
Online ISBN: 978-3-030-57993-7
eBook Packages: Computer ScienceComputer Science (R0)
