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

Berit Dangaard Brouer, Guy Desaulniers, Christian Vad Karsten, David Pisinger

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

    669 Downloads (Pure)


    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.
    Original languageEnglish
    Title of host publicationComputational Logistics : Proceedings of the 6th International Conference, ICCL 2015
    Publication date2015
    ISBN (Print)978-3-319-24263-7
    ISBN (Electronic)978-3-319-24264-4
    Publication statusPublished - 2015
    Event6th International Conference on Computational Logistics: “Coordination for Real-Time Logistics” - Delft University of Technology , Delft, Netherlands
    Duration: 23 Sept 201525 Sept 2015


    Conference6th International Conference on Computational Logistics
    LocationDelft University of Technology
    SeriesLecture Notes in Computer Science


    • Liner shipping
    • Network design
    • Transit time


    Dive into the research topics of 'A Matheuristic for the Liner Shipping Network Design Problem with Transit Time Restrictions'. Together they form a unique fingerprint.

    Cite this