A matheuristic for the liner shipping network design problem

Berit Dangaard Brouer, Guy Desaulniers, David Pisinger

    Research output: Book/ReportReportResearchpeer-review

    1 Downloads (Pure)


    We present a matheuristic, an integer programming based heuristic, for the liner shipping network design problem. This problem consists of finding a set of container shipping routes defining a capacitated network for cargo transport. The objective is to maximize the revenue of cargo transport, while minimizing
    the cost of operating the network. Liner shipping companies publish a set of routes with a time schedule, and it is an industry standard to have a weekly departure at each port call on a route. A weekly frequency is achieved by deploying several vessels to a single route, respecting the available fleet of container vessels. The cargo transports make extensive use of transshipments between routes and the number of transshipments of the cargo flow is decisive for network profitability. Computational results are reported for the benchmark
    suite LINER-LIB 2012 following the industry standard of weekly departures on every schedule. The heuristic shows overall good performance and is able to find high quality solutions within competitive execution times. The matheuristic can also be applied as a decision support tool to improve an existing network by optimizing on a designated subset of the routes. A case study is presented for this approach with very promising results.
    Original languageEnglish
    PublisherGERAD, Montreal, Canada
    Number of pages24
    Publication statusPublished - 2014
    SeriesCahiers du GERAD


    • Liner shipping
    • network design
    • matheuristic


    Dive into the research topics of 'A matheuristic for the liner shipping network design problem'. Together they form a unique fingerprint.

    Cite this