Skip to main content

A Multi-stage Approach Aimed at Optimizing the Transshipment of Containers in a Maritime Container Terminal

  • Conference paper
  • First Online:
Computer Aided Systems Theory – EUROCAST 2015 (EUROCAST 2015)

Abstract

This paper addresses the management of container flows in a maritime container terminal. In this context, we propose a multi-stage approach that allows to provide a complete schedule of the container flows from their arrival within container vessels to their delivery to receiving companies. Our proposed approach is aimed at minimizing the total maximum waiting time of the companies after they have requested containers. The computational results indicate that there are some relations subjected to the involved resources that have to be considered when tackling this problem.

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

Access this chapter

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bortfeldt, A., Wäscher, G.: Constraints in container loading - a state-of-the-art review. Eur. J. Oper. Res. 229(1), 1–20 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  2. Carlo, H.J., Vis, I.F.A., Roodbergen, K.J.: Storage yard operations in container terminals: literature overview, trends, and research directions. Eur. J. Oper. Res. 235(2), 412–430 (2014). Maritime Logistics

    Article  MATH  Google Scholar 

  3. Carlo, H.J., Vis, I.F.A., Roodbergen, K.J.: Transport operations in container terminals: Literature overview, trends, research directions and classification scheme. Eur. J. Oper. Res. 236(1), 1–13 (2014)

    Article  MATH  Google Scholar 

  4. Cho, J., Kim, H., Choi, H.: An intermodal transport network planning algorithm using dynamic programming case study: from Busan to Rotterdam in intermodal freight routing. Appl. Intell. 36(3), 529–541 (2012)

    Article  Google Scholar 

  5. Cho, J.H., Kim, H.S., Choi, H.R., Park, N.K., Kang, M.H.: An intermodal transport network planning algorithm using dynamic programming. In: Okuno, H.G., Ali, M. (eds.) IEA/AIE 2007. LNCS (LNAI), vol. 4570, pp. 1012–1021. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  6. de Armas, J., Melián-Batista, B., Moreno-Pérez, J.A., Brito, J.: GVNS for a real-world rich vehicle routing problem with time windows. Eng. Appl. Artif. Intell. Rev. 42, 45–56 (2014)

    Article  Google Scholar 

  7. Expósito-Izquierdo, C., González-Velarde, J.L., Melián-Batista, B., Moreno-Vega, J.M.: Hybrid estimation of distribution algorithm for the quay crane scheduling problem. Appl. Soft Comput. 13(10), 4063–4076 (2013)

    Article  Google Scholar 

  8. Expósito-Izquierdo, C., Lalla-Ruiz, E., de Armas, J., Melián-Batista, B., Moreno-Vega, J.M.: A Heuristic algorithm for the stacking problem. Comput. Ind. Eng. Rev. (2014)

    Google Scholar 

  9. Expósito-Izquierdo, C., Melián-Batista, B., Moreno-Vega, J.: A domain-specific knowledge-based heuristic for the blocks relocation problem. Adv. Eng. Inform. 28(4), 327–343 (2014)

    Article  Google Scholar 

  10. Günther, H.O., Kim, K.H.: Container terminals and terminal operations. OR Spectrum 28(4), 437–445 (2006)

    Article  Google Scholar 

  11. Kim, K.H., Hong, G.: A heuristic rule for relocating blocks. Comput. Oper. Res. 33(4), 940–954 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  12. Lalla-Ruiz, E., González-Velarde, J.L., Melián-Batista, B., Moreno-Vega, J.M.: Biased random key genetic algorithm for the tactical berth allocation problem. Appl. Soft Comput. 22, 60–76 (2014)

    Article  Google Scholar 

  13. Lalla-Ruiz, E., Melián-Batista, B., Moreno-Vega, J.M.: Artificial intelligence hybrid heuristic based on tabu search for the dynamic berth allocation problem. Eng. Appl. Artif. Intell. 25(6), 1132–1141 (2012)

    Article  Google Scholar 

  14. Meisel, F.: Seaside Operations Planning in Container Terminals. Contributions to Management Science. Physica-Verlag HD, Heidelberg (2010)

    Google Scholar 

  15. Xiong, G., Wang, Y.: Best routes selection in multimodal networks using multi-objective genetic algorithm. J. Comb. Optim. pp. 1–19 (2012)

    Google Scholar 

Download references

Acknowledgements

This work has been partially funded by the Spanish Ministry of Economy and Competitiveness (project TIN2012-32608). Eduardo Lalla-Ruiz and Christopher Expósito-Izquierdo would like to thank the Government of Canary Island for the financial support they receive through their post-graduate grants. The research by Jesica de Armas is supported by the Canary Islands CIE: Tricontinental Atlantic Campus.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Eduardo Lalla-Ruiz .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Lalla-Ruiz, E., de Armas, J., Expósito-Izquierdo, C., Melián-Batista, B., Moreno-Vega, J.M. (2015). A Multi-stage Approach Aimed at Optimizing the Transshipment of Containers in a Maritime Container Terminal. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds) Computer Aided Systems Theory – EUROCAST 2015. EUROCAST 2015. Lecture Notes in Computer Science(), vol 9520. Springer, Cham. https://doi.org/10.1007/978-3-319-27340-2_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-27340-2_32

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-27339-6

  • Online ISBN: 978-3-319-27340-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics