Skip to main content

A Node Flow Model for the Inflexible Visitation Liner Shipping Fleet Repositioning Problem with Cargo Flows

  • 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

We introduce a novel, node flow based mathematical model for the fixed-time version of a central problem in the liner shipping industry called the Liner Shipping Fleet Repositioning Problem (LSFRP). We call this version of the problem the Inflexible Visitation LSFRP (IVLSFRP). During repositioning, vessels are moved between routes in a liner shipping network. Shipping lines wish to reposition vessels as cheaply as possible without disrupting the cargo flows of the network. The LSFRP is characterized by chains of interacting activities with a multi-commodity flow over paths defined by the activities chosen. We introduce two versions of a node flow based model that exploit the fixed activity times of the IVLSFRP’s graph to handle cargo demands on the nodes of the graph, instead of the arcs, significantly reducing the number of variables. Using this model in CPLEX, we are able to solve 12 previously unsolved IVLSFRP instances to optimality. Additionally, we improve the solution time on every instance in the IVLSFRP dataset, sometimes by several orders of magnitude.

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. Álvarez, J.F.: Joint routing and deployment of a fleet of container vessels. Maritime Economics and Logistics 11(2), 186–208 (2009)

    Article  Google Scholar 

  2. Andersen, M.W.: Service Network Design and Management in Liner Container Shipping Applications. PhD thesis, Technical University of Denmark, Department of Transport (2010)

    Google Scholar 

  3. Brouer, B.D., Dirksen, J., Pisinger, D., Plum, C.E.M., Vaaben, B.: The Vessel Schedule Recovery Problem (VSRP) – A MIP model for handling disruptions in liner shipping. European Journal of Operational Research 224(2), 362–374 (2013)

    Article  Google Scholar 

  4. Burke, E.K., Bykov, Y.: A late acceptance strategy in hill-climbing for exam timetabling problems. In: PATAT 2008 Conference, Montreal, Canada (2008)

    Google Scholar 

  5. Christiansen, M.: Decomposition of a combined inventory and time constrained ship routing problem. Transportation Science 33(1), 3–16 (1999)

    Article  MATH  Google Scholar 

  6. Christiansen, M., Fagerholt, K., Nygreen, B., Ronen, D.: Maritime transportation. In: Handbooks in Operations Research and Management Science, vol. 14, pp. 189–284 (2007)

    Google Scholar 

  7. Christiansen, M., Fagerholt, K., Ronen, D.: Ship routing and scheduling: Status and perspectives. Transportation Science 38(1), 1–18 (2004)

    Article  Google Scholar 

  8. Clausen, J., Larsen, A., Larsen, J., Rezanova, N.J.: Disruption management in the airline industry–concepts, models and methods. Computers & Operations Research 37(5), 809–821 (2010)

    Article  MATH  Google Scholar 

  9. Kohl, N., Larsen, A., Larsen, J., Ross, A., Tiourine, S.: Airline disruption management–perspectives, experiences and outlook. Journal of Air Transport Management 13(3), 149–162 (2007)

    Article  Google Scholar 

  10. Korsvik, J.E., Fagerholt, K., Laporte, G.: A large neighbourhood search heuristic for ship routing and scheduling with split loads. Computers & Operations Research 38(2), 474–483 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  11. Løfstedt, B., Alvarez, J.F., Plum, C.E.M., Pisinger, D., Sigurd, M.M.: An integer programming model and benchmark suite for liner shipping network design. Technical Report 19, DTU Management (2010)

    Google Scholar 

  12. Meyer, J., Stahlbock, R., Voß, S.: Slow steaming in container shipping. In: Proceedings of the 45th Hawaii International Conference on System Science (HICSS), pp. 1306–1314. IEEE (2012)

    Google Scholar 

  13. Powell, B.J., Perakis, A.N.: Fleet deployment optimization for liner shipping: An integer programming model. Maritime Policy and Management 24(2), 183–192 (1997)

    Article  Google Scholar 

  14. Stahlbock, R., Voß, S.: Operations research at container terminals: a literature update. OR Spectrum 30(1), 1–52 (2008)

    Article  MATH  Google Scholar 

  15. Tierney, K.: Late Acceptance Hill Climbing for the Liner Shipping Fleet Repositioning Problem. In: Proceedings of the 14th EUME Workshop, pp. 21–27 (2013)

    Google Scholar 

  16. Tierney, K., Áskelsdóttir, B., Jensen, R.M., Pisinger, D.: Solving the liner shipping fleet repositioning problem with cargo flows. Technical Report TR-2013-165, IT University of Copenhagen (January 2013)

    Google Scholar 

  17. Tierney, K., Coles, A.J., Coles, A.I., Kroer, C., Britt, A.M., Jensen, R.M.: Automated planning for liner shipping fleet repositioning. In: McCluskey, L., Williams, B., Silva, J.R., Bonet, B. (eds.) Proceedings of the 22nd International Conference on Automated Planning and Scheduling, pp. 279–287 (2012)

    Google Scholar 

  18. Tierney, K., Jensen, R.M.: The Liner Shipping Fleet Repositioning Problem with Cargo Flows. In: Hu, H., Shi, X., Stahlbock, R., Voß, S. (eds.) ICCL 2012. LNCS, vol. 7555, pp. 1–16. Springer, Heidelberg (2012)

    Chapter  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

Tierney, K., Jensen, R.M. (2013). A Node Flow Model for the Inflexible Visitation Liner Shipping Fleet Repositioning Problem with Cargo Flows. 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_2

Download citation

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

  • 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