Berth Allocation Problem in Export Tidal Bulk Ports with Inventory Control

  • Conference paper
  • First Online:
Intelligent Transport Systems (INTSYS 2022)

Abstract

This paper presents the problem of allocating berth positions for vessels in tidal bulk port terminals (BAPTBI), considering the specific export scenario and robust control over goods’ stock levels. An integer linear mathematical model is proposed for the discrete case (time and quay). The model controls the minimal and maximum inventory levels. A dataset of 59 instances was generated based on data obtained from a relevant bulk terminal in São Luís, Brazil. Through the experiment using the Gurobi solver, it is noticed that some medium-sized instances take more than 1 h to be solved.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    dataset available at http LACMOR.

  2. 2.

    https://www.gurobi.com/academia/academic-program-and-licenses/.

  3. 3.

    https://www.gurobi.com/documentation/9.5.1/refman/cpp_grbmodel_optimize.html.

References

  1. United Nations Conference on Trade and Development. Review of Maritime Transport 2021. Review of maritime transport. United Nations, Geneva (2021). ISBN 978-92-1-113026-3

    Google Scholar 

  2. Ribeiro, G.M., Mauri, G.R., de Castro Beluco, S., Lorena, L.A.N., Laporte, G.: Berth allocation in an ore terminal with demurrage, dispatch and maintenance. Comput. Ind. Eng. 96(C), 8–15 (2016). ISSN 0360–8352. https://doi.org/10.1016/j.cie.2016.03.005

  3. National waterway transportation agency (ANTAQ). https://anuario.antaq.gov.br/ea/index.html. Accessed February 2022

  4. Sant’Ana, H.A.D., Alves, E.D.J.P.: Mining-railroad-port: at the end of the line a City in Question. Virtual Brazilian Antropology. V14N2, Part 2 (2017). ISSN 1809–4341

    Google Scholar 

  5. 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

    Article  Google Scholar 

  6. 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, 114215 (2021). https://doi.org/10.1016/j.eswa.2020.114215

  7. Liu, M., Liu, R., Chu, F., Chu, C.: Mathematical model and solution approach for berth allocation problem in tidal bulk ports with different vessel draft requirements. In: 2018 15th International Conference on Service Systems and Service Management (ICSSSM), pp. 1–6. IEEE (2018). https://doi.org/10.1109/ICSSSM.2018.8465036

  8. Mnasri, S., Alrashidi, M.: A comprehensive modeling of the discrete and dynamic problem of berth allocation in maritime terminals. Electronics 10(21), 2684 (2021). ISSN 2079–9292. https://doi.org/10.3390/electronics10212684

  9. 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. Elsevier (2017). https://doi.org/10.1016/j.ejor.2016.08.073

  10. Correcher, J.F., Van den Bossche, T., Alvarez-Valdes, R., Berghe, G.V.: The berth allocation problem in terminals with irregular layouts. Eur. J. Oper. Res. 1096–1108 (2019). https://doi.org/10.1016/j.ejor.2018.07.019

  11. Yan, S., Lu, C.-C., Hsieh, J.-H., Lin, H.-C.: A dynamic and flexible berth allocation model with stochastic vessel arrival times. Netw. Spat. Econ. 19(3), 903–927 (2019). https://doi.org/10.1007/s11067-018-9434-x

    Article  MATH  Google Scholar 

  12. Lassoued, R., Elloumi, A.: The discrete and dynamic berth allocation problem in bulk port. In: 6th International Conference on Control, Decision and Information Technologies (CoDIT), pp. 1976–1980 (2019). https://doi.org/10.1109/CoDIT.2019.8820590

  13. Bouzekri, H., Alpan, G., Giard, V.: A dynamic hybrid berth allocation problem with routing constraints in bulk ports. In: IFIP International Conference on Advances in Production Management Systems, pp. 250–258 (2020). https://doi.org/10.1007/978-3-030-57993-7_29

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Cassio Linhares .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Linhares, C., Silva, J., Azevedo, M., Climaco, G., de Oliveira, A.C.M. (2023). Berth Allocation Problem in Export Tidal Bulk Ports with Inventory Control. In: Martins, A.L., Ferreira, J.C., Kocian, A., Tokkozhina, U. (eds) Intelligent Transport Systems. INTSYS 2022. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 486. Springer, Cham. https://doi.org/10.1007/978-3-031-30855-0_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-30855-0_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-30854-3

  • Online ISBN: 978-3-031-30855-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Navigation