Skip to main content
SpringerLink
Log in

A Matheuristic for the Liner Shipping Network Design Problem with Transit Time Restrictions

  • Conference paper
  • First Online:
Computational Logistics (ICCL 2015)

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

Included in the following conference series:

Abstract

We present a mathematical model for the liner shipping network design problem with transit time restrictions on the cargo flow. We extend an existing matheuristic for the liner shipping network design problem to consider transit time restrictions. The matheuristic is an improvement heuristic, where an integer program is solved iteratively as a move operator in a large-scale neighborhood search. To assess the effects of insertions/removals of port calls, flow and revenue changes are estimated for relevant commodities along with an estimation of the change in the vessel cost. Computational results on the benchmark suite LINER-LIB are reported, showing profitable networks for most instances. We provide insights on causes for rejecting demand and the average speed per vessel class in the solutions obtained.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Agarwal, R., Ergun, O.: Ship scheduling and network design for cargo routing in liner shipping. Transportation Science 42(2), 175–196 (2008)

    Article  Google Scholar 

  • Alvarez, J.F.: Mathematical expressions for level of service optimization in liner shipping. Journal of the Operational Research Society 63(6), 709–714 (2012)

    Article  Google Scholar 

  • Archetti, C., Speranza, M.G.: A survey on matheuristics for routing problems. EURO Journal on Computational Optimization 2, 223–246 (2014)

    Article  MATH  Google Scholar 

  • Brouer, B., Alvarez, J., Plum, C., Pisinger, D., Sigurd, M.: A base integer programming model and benchmark suite for liner shipping network design. Transportation Science 48(2), 281–312 (2014a)

    Article  Google Scholar 

  • Brouer, B., Desaulniers, G., Pisinger, D.: A matheuristic for the liner shipping network design problem. Transportation Research Part E: Logistics and Transportation Review 72, 42–59 (2014b)

    Article  Google Scholar 

  • Christiansen, M., Fagerholt, K., Nygreen, B., Ronen, D.: Ship routing and scheduling in the new millennium. European Journal of Operational Research 228(3), 467–483 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  • Gelareh, S., Nickel, S., Pisinger, D.: Liner shipping hub network design in a competitive environment. Transportation Research Part E: Logistics and Transportation Review 46(6), 991–1004 (2010)

    Article  Google Scholar 

  • Karsten, C.V., Pisinger, D., Ropke, S., Brouer, B.D.: The time constrained multi-commodity network flow problem and its application to liner shipping network design. Transportation Research Part E: Logistics and Transportation Review 76, 122–138 (2015)

    Article  Google Scholar 

  • Liu, Z., Meng, Q., Wang, S., Sun, Z.: Global intermodal liner shipping network design. Transportation Research Part E: Logistics and Transportation Review 61, 28–39 (2014)

    Article  Google Scholar 

  • Meng, Q., Wang, S., Andersson, H., Thun, K.: Containership routing and scheduling in liner shipping: Overview and future research directions. Transportation Science 48(2), 265–280 (2014)

    Article  Google Scholar 

  • Mulder, J., Dekker, R.: Methods for strategic liner shipping network design. European Journal of Operational Research 235(2), 367–377 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  • Plum, C., Pisinger, D., Sigurd, M.M.: A service flow model for the liner shipping network design problem. European Journal of Operational Research 235(2), 378–386 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  • Reinhardt, L.B., Pisinger, D.: A branch and cut algorithm for the container shipping network design problem. Flexible Services and Manufacturing Journal 24(3), 349–374 (2012)

    Article  Google Scholar 

  • Wang, S., Meng, Q.: Liner shipping network design with deadlines. Computers and Operations Research 41(1), 140–149 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  • Wang, S., Meng, Q., Sun, Z.: Container routing in liner shipping. Transportation Research Part E: Logistics and Transportation Review 49(1), 1–7 (2013)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DTU Management Engineering, Technical University of Denmark, Produktionstorvet, Building 426, 2800, Kgs. Lyngby, Denmark

    Berit Dangaard Brouer, Christian Vad Karsten & David Pisinger

  2. Department of mathematics and industrial engineering, Polytechnique Montréal and GERAD, C.P. 6079, Succ. Centre-Ville, Montréal, QC, H3C 3A7, Canada

    Guy Desaulniers

Authors
  1. Berit Dangaard Brouer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guy Desaulniers
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Christian Vad Karsten
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. David Pisinger
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Christian Vad Karsten .

Editor information

Editors and Affiliations

  1. Delft University of Technology, Delft, The Netherlands

    Francesco Corman

  2. University of Hamburg, Hamburg, Germany

    Stefan Voß

  3. Delft University of Technology, Delft, The Netherlands

    Rudy R. Negenborn

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Brouer, B.D., Desaulniers, G., Karsten, C.V., Pisinger, D. (2015). A Matheuristic for the Liner Shipping Network Design Problem with Transit Time Restrictions. In: Corman, F., Voß, S., Negenborn, R. (eds) Computational Logistics. ICCL 2015. Lecture Notes in Computer Science(), vol 9335. Springer, Cham. https://doi.org/10.1007/978-3-319-24264-4_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-24264-4_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-24263-7

  • Online ISBN: 978-3-319-24264-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation