Competitive Liner Shipping Network Design

Christian Vad Karsten, Berit Dangaard Brouer, David Pisinger

    Research output: Contribution to journalJournal articleResearchpeer-review

    17 Downloads (Pure)

    Abstract

    We present a solution method for the liner shipping network design problem which is a core strategic planning problem faced by container carriers. We propose the first practical algorithm which explicitly handles transshipment time limits for all demands. Individual sailing speeds at each service leg are used to balance sailing speed against operational costs, hence ensuring that the found network is competitive on both transit time and cost. We present a matheuristic for the problem where a MIP is used to select which ports should be inserted or removed on a route. Computational results are presented showing very promising results for realistic global liner shipping networks. Due to a number of algorithmic enhancements, the obtained solutions can be found within the same time frame as used by previous algorithms not handling time constraints. Furthermore, we present a sensitivity analysis on fluctuations in bunker price which confirms the applicability of the algorithm.
    Original languageEnglish
    JournalComputers & Operations Research
    Volume87
    Pages (from-to)125-136
    ISSN0305-0548
    DOIs
    Publication statusPublished - 2017

    Keywords

    • Container shipping
    • Network design
    • Level of service

    Cite this