Abstract
Integrating operational and logistic processes is fundamental to ensure a port terminal’s efficient and productive operation. This article deals with the integration of planning, scheduling, yard allocation, and berth allocation in dry bulk export port terminals. The integrated problem consists of planning and sequencing the flow of products between arrival at the terminal and the berths, allocating the products to the storage yards, and determining the sequence, berthing time, and position of each vessel. A mixed-integer linear programming formulation is proposed, connecting the problems and incorporating tidal time windows and non-preemptive scheduling. To solve the integrated problem more efficiently, we developed an algorithm based on a combination of a diving heuristic with limited backtracking, two relax-and-fix heuristics, a local branching heuristic, a rolling horizon heuristic, and a variable-fixing strategy. The mathematical formulation and proposed algorithm are tested and validated with large-scale instances. The computational results show that the proposed algorithm is effective in finding strong upper bounds.
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
Similar content being viewed by others
References
Barros, V.H., Costa, T.S., Oliveira, A.C., Lorena, L.A.: Model and heuristic for berth allocation in tidal bulk ports with stock level constraints. Comput. Ind. Eng. 60(4), 606–613 (2011). https://doi.org/10.1016/j.cie.2010.12.018
Cheimanoff, N., Fontane, F., Kitri, M.N., Tchernev, N.: A reduced vns based approach for the dynamic continuous berth allocation problem in bulk terminals with tidal constraints. Expert Syst. Appl. 168,(2021). https://doi.org/10.1016/j.eswa.2020.114215
de León, A.D., Lalla-Ruiz, E., Melián-Batista, B., Marcos Moreno-Vega, J.: A machine learning-based system for berth scheduling at bulk terminals. Expert Syst. Appl. 87, 170–182 (2017). https://doi.org/10.1016/j.eswa.2017.06.010
de León, A.D., Lalla-Ruiz, E., Melián-Batista, B., Moreno-Vega, J.M.: A simulation-optimization framework for enhancing robustness in bulk berth scheduling. Eng. Appl. Artif. Intell. 103,(2021). https://doi.org/10.1016/j.engappai.2021.104276
Ernst, A.T., Oğuz, C., Singh, G., Taherkhani, G.: Mathematical models for the berth allocation problem in dry bulk terminals. J. Sched. 1–15 (2017). https://doi.org/10.1007/s10951-017-0510-8
Fischetti, M., Lodi, A.: Local branching. Math. Program. 98, 23–47 (2003). https://doi.org/10.1007/s10107-003-0395-5
Harvey, W.D., Ginsberg, M.L.: Limited discrepancy search. In: IJCAI (1995)
Hu, D., Yao, Z.: Stacker-reclaimer scheduling in a dry bulk terminal. Int. J. Comput. Integr. Manuf. 25(11), 1047–1058 (2012). https://doi.org/10.1080/0951192X.2012.684707
Menezes, G.C., Mateus, G.R., Ravetti, M.G.: A hierarchical approach to solve a production planning and scheduling problem in bulk cargo terminal. Comput. Ind. Eng. 97, 1–14 (2016). https://doi.org/10.1016/j.cie.2016.04.007
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(3), 926–937 (2017). https://doi.org/10.1016/j.ejor.2016.08.073
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(2), 399–411 (2014). https://doi.org/10.1016/j.ejor.2013.08.015
Rocha de Paula, M., Boland, N., Ernst, A.T., Mendes, A., Savelsbergh, M.: Throughput optimisation in a coal export system with multiple terminals and shared resources. Comput. Ind. Eng. 134, 37–51 (2019). https://doi.org/10.1016/j.cie.2019.05.021
Sadykov, R., Vanderbeck, F., Pessoa, A., Tahiri, I., Uchoa, E.: Primal heuristics for branch and price: the assets of diving methods. INFORMS J. Comput. 31(2), 251–267 (2019). https://doi.org/10.1287/ijoc.2018.0822
Tang, L., Sun, D., Liu, J.: Integrated storage space allocation and ship scheduling problem in bulk cargo terminals. IIE Trans. 48(5), 428–439 (2016). https://doi.org/10.1080/0740817X.2015.1063791
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 (07 2013). https://doi.org/10.1016/j.tre.2013.03.003
Unsal, O.: Reclaimer scheduling in dry bulk terminals. IEEE Access 1 (05 2020). https://doi.org/10.1109/ACCESS.2020.2997739
Unsal, O., Oğuz, C.: An exact algorithm for integrated planning of operations in dry bulk terminals. Transp. Res. Part E: Logistics Transp. Rev. 126, 103–121 (2019). https://doi.org/10.1016/j.tre.2019.03.018
Acknowledgments
This research is supported by the following institutions: Brazilian National Research Council (CNPq), Coordination of Superior Level Staff Improvement (CAPES) and Federal Center for Technological Education of Minas Gerais (CEFET-MG).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
de Andrade, J.L.M., Menezes, G.C. (2021). An Integrated Planning, Scheduling, Yard Allocation and Berth Allocation Problem in Bulk Ports: Model and Heuristics. In: Mes, M., Lalla-Ruiz, E., Voß, S. (eds) Computational Logistics. ICCL 2021. Lecture Notes in Computer Science(), vol 13004. Springer, Cham. https://doi.org/10.1007/978-3-030-87672-2_1
Download citation
DOI: https://doi.org/10.1007/978-3-030-87672-2_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-87671-5
Online ISBN: 978-3-030-87672-2
eBook Packages: Computer ScienceComputer Science (R0)