Skip to main content
SpringerLink
Log in

Skipping the Storage Phase in Container Transshipment Operations

  • Conference paper
  • First Online:
Book cover Computational Logistics (ICCL 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11184))

Included in the following conference series:

  • 1292 Accesses

Abstract

The paper deals with the problem of scheduling the loading/discharging operations of two simultaneously berthed vessels, assuming that some of the containers discharged from a vessel must be directly loaded on the other one. For these containers also the stowage position must be decided. The aim is to minimize the time needed to complete all the operations required by the involved vessels. For this problem we present a mathematical model, a heuristic algorithm and discuss the computational results on a set of randomly generated instances.

The research has been supported by Ministero dell’Istruzione, Università e Ricerca under the PRIN 2015 research program - Grant 2015XAPRKF - Smart PORt Terminals.

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

Access this chapter

Log in via an institution
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. Alicke, K.: Modeling and optimization of the intermodal terminal Mega Hub. OR Spectr. 24(2), 1–18 (2002)

    Article  MathSciNet  Google Scholar 

  2. Bierwirth, C., Meisel, F.: A fast heuristic for quay crane scheduling with interference constraints. J. Sched. 12(4), 345–360 (2009)

    Article  MathSciNet  Google Scholar 

  3. Blumenhagen, D.: Containerization and Hinterland traffic. Marit. Policy Manag. 8(3), 197–206 (1981)

    Article  Google Scholar 

  4. Chiarello, A., Gaudioso, M., Sammarra, M.: Truck synchronization at single door cross-docking terminals. OR Spectr. 40(2), 395–447 (2018)

    Article  MathSciNet  Google Scholar 

  5. Garro, A., Monaco, M.F., Russo, W., Sammarra, M., Sorrentino, G.: Agent-based simulation for the evaluation of a new dispatching model for the straddle carrier pooling problem. Simulation 91(2), 181–202 (2015)

    Article  Google Scholar 

  6. Gendreau, M., Potvin, J.Y.: Tabu search. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics. ISOR, vol. 146, pp. 41–59. Springer, Boston (2010). https://doi.org/10.1007/978-1-4419-1665-5_2

    Chapter  MATH  Google Scholar 

  7. Lee, B.K., Jung, B.J., Kim, K.H., Park, S.O.: A simulation study for designing a rail terminal in a container port. In: Perrone, L.F., Wieland, F.P. et al. (eds.) Proceedings of the 38th Conference on Winter Simulation, pp. 1388–1397 (2006)

    Google Scholar 

  8. Lian, C., Hwang, H., Gen, M.: A berth allocation planning problem with direct transhipment consideration. J. Intell. Manuf. 23(6), 2207–2214 (2012)

    Article  Google Scholar 

  9. Meisel, F., Bierwirth, C.: A unified approach for the evaluation of quay crane scheduling models and algorithms. Comput. Oper. Res. 38(3), 683–693 (2011)

    Article  Google Scholar 

  10. Monaco, M.F., Sammarra, M.: Quay crane scheduling with time windows, one-way and spatial constraints. Int. J. Shipp. Transp. Logist. 3(4), 454–474 (2011)

    Article  Google Scholar 

  11. Monaco, M.F., Sammarra, M.: The direct ship-to-ship container transshipment problem at a maritime terminal. In: Gunther, H.-O., Kim, K.-H., Kopfer, H. (eds.) International Conference on Logistics and Maritime Systems, LOGMS2012, pp. 79–89 (2012)

    Google Scholar 

  12. Monaco, M.F., Sammarra, M., Sorrentino, G.: The terminal-oriented ship stowage planning problem. Eur. J. Oper. Res. 239(1), 256–265 (2014)

    Article  Google Scholar 

  13. Nam, H., Lee, T.: A scheduling problem for a novel container transport system: a case of mobile harbor operation schedule. Flex. Serv. Manuf. J. 25, 576–608 (2013)

    Article  Google Scholar 

  14. Sammarra, M., Cordeau, J.-F., Laporte, G., Monaco, M.F.: A tabu search algorithm for the quay crane scheduling problem. J. Schedul. 10(4–5), 327–336 (2007)

    Article  Google Scholar 

  15. Zeng, Q., Feng, Y., Chen, Z.: Optimizing berth allocation and storage space in direct transshipment operations at container terminals. Marit. Econ. Logist. 19(3), 474–503 (2017)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Ingegneria Informatica, Modellistica, Elettronica e Sistemistica, Università della Calabria, Rende, Italy

    M. Flavia Monaco

  2. Istituto di Calcolo e Reti ad Alte Prestazioni, Consiglio Nazionale delle Ricerche, Rende, Italy

    Marcello Sammarra

Authors
  1. M. Flavia Monaco
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marcello Sammarra
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. Flavia Monaco .

Editor information

Editors and Affiliations

  1. University of Salerno, Fisciano, Italy

    Raffaele Cerulli

  2. University of Salerno, Fisciano, Italy

    Andrea Raiconi

  3. Institute of Information Systems, University of Hamburg, Hamburg, Germany

    Stefan Voß

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Monaco, M.F., Sammarra, M. (2018). Skipping the Storage Phase in Container Transshipment Operations. In: Cerulli, R., Raiconi, A., Voß, S. (eds) Computational Logistics. ICCL 2018. Lecture Notes in Computer Science(), vol 11184. Springer, Cham. https://doi.org/10.1007/978-3-030-00898-7_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-00898-7_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-00897-0

  • Online ISBN: 978-3-030-00898-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation