Skip to main content

A Model for the Coordination of 20-foot and 40-foot Container Movements in the Hinterland of a Container Terminal

  • Conference paper
Computational Logistics (ICCL 2013)

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

Included in the following conference series:

Abstract

Considered is a carrier that requires decision support to organize an efficient transport of loaded and empty containers in the hinterland of a sea port. Loaded containers are handled as pickup-and-delivery requests, however, requests for empty containers are incomplete because either the pickup location of a container or the delivery location of a container is a priori unknown. The problem is modelled as a generalization of the pickup-and-delivery problem (PDP) with less-than-truckload (LTL) requests. Practically speaking, by using LTL request we are able to consider 20-foot and 40-foot containers simultaneously. This is closer to reality than most previous models discussed in the literature which use full truckload requests, i.e., only containers of homogeneous size are possible. Three types of decisions are involved in the proposed model: a determination of pickup or delivery locations for the incomplete requests, a routing of vehicles, and a routing of empty containers. The presented model is validated by means of a numerical example computed by a MIP solver.

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 PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 49.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Braekers, K., Caris, A., Janssens, G.K.: A deterministic annealing algorithm for a bi-objective full truckload vehicle routing problem in drayage operations. Procedia - Social and Behavioral Sciences 20, 344–353 (2011)

    Article  Google Scholar 

  2. Braekers, K., Caris, A., Janssens, G.: Integrated planning of loaded and empty container movements. OR Spectrum 35(2), 457–478 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  3. Caris, A., Janssens, G.: A local search heuristic for the pre- and end-haulage of intermodal container terminals. Computers & Operations Research 36(10), 2763–2772 (2009)

    Article  MATH  Google Scholar 

  4. Imai, A., Nishimura, E., Current, J.: A lagrangian relaxation-based heuristic for the vehicle routing with full container load. European Journal of Operational Research 176(1), 87–105 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  5. Jula, H., Dessouky, M., Ioannou, P., Chassiakos, A.: Container movement by trucks in metropolitan networks: modeling and optimization. Transportation Research Part E: Logistics and Transportation Review 41(3), 235–259 (2005)

    Article  Google Scholar 

  6. Nossack, J., Pesch, E.: A truck scheduling problem arising in intermodal container transportation. European Journal of Operational Research (2013), doi:10.1016/j.ejor.2013.04.042

    Google Scholar 

  7. Reinhardt, L., Spoorendonk, S., Pisinger, D.: Solving vehicle routing with full container load and time windows. In: Hu, H., Shi, X., Stahlbock, R., Voß, S. (eds.) ICCL 2012. LNCS, vol. 7555, pp. 120–128. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  8. Sigurd, M., Pisinger, D., Sig, M.: The pickup and delivery problem with time windows and precedences. Technical Report 00/08, DIKU, University of Copenhagen (2008)

    Google Scholar 

  9. Sterzik, S., Kopfer, H.: A tabu search heuristic for the inland container transportation problem. Computers & Operations Research 40(4), 953–962 (2013)

    Article  MathSciNet  Google Scholar 

  10. Sterzik, S., Kopfer, H., Yun, W.Y.: Reducing hinterland transportation costs through container sharing. Flexible Services and Manufacturing Journal (2012), doi:10.1007/s10696-012-9167-y

    Google Scholar 

  11. Vidovic, M., Radivojevic, G., Rakovic, B.: Vehicle routing in containers pickup up and delivery processes. Procedia - Social and Behavioral Sciences 20, 335–343 (2011)

    Article  Google Scholar 

  12. Wang, W.F., Yun, W.Y.: Scheduling for inland container truck and train transportation. International Journal of Production Economics 143(2), 349–356 (2013)

    Article  Google Scholar 

  13. Zhang, G., Smilowitz, K., Erera, A.: Dynamic planning for urban drayage operations. Transportation Research Part E: Logistics and Transportation Review 47(5), 764–777 (2011)

    Article  Google Scholar 

  14. Zhang, R., Yun, W., Kopfer, H.: Heuristic-based truck scheduling for inland container transportation. OR Spectrum 32, 787–808 (2010)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schönberger, J., Buer, T., Kopfer, H. (2013). A Model for the Coordination of 20-foot and 40-foot Container Movements in the Hinterland of a Container Terminal. In: Pacino, D., Voß, S., Jensen, R.M. (eds) Computational Logistics. ICCL 2013. Lecture Notes in Computer Science, vol 8197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41019-2_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-41019-2_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-41018-5

  • Online ISBN: 978-3-642-41019-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics