A matheuristic for the liner shipping network design problem

Berit Dangaard Brouer, Guy Desaulniers

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

    1041 Downloads (Pure)

    Abstract

    We present a matheuristic, an integer programming based heuristic, for the Liner Shipping Network Design Problem. The heuristic applies a greedy construction heuristic based on an interpretation of the liner shipping network design problem as a multiple quadratic knapsack problem. The construction heuristic is combined with an improvement heuristic with a neighborhood defined by the solution space of a mixed integer program. The mixed integer program optimizes the removal and insertion of several port calls on a liner shipping service. The objective function is based on evaluation functions for revenue and transshipment of cargo along with in/decrease of vessel- and operational cost for the current solution. The evaluation functions may be used by heuristics in general to evaluate changes to a network design without solving a large scale multicommodity flow problem.
    Original languageEnglish
    Title of host publicationElectronic Proceedings of LOGMS 2012
    Number of pages12
    PublisherUniversität Bremen
    Publication date2012
    Publication statusPublished - 2012
    Event2nd International Conference on Logistics and Maritime Systems - Bremen, Germany
    Duration: 22 Aug 201224 Aug 2012
    Conference number: 2

    Conference

    Conference2nd International Conference on Logistics and Maritime Systems
    Number2
    Country/TerritoryGermany
    CityBremen
    Period22/08/201224/08/2012

    Keywords

    • Liner shipping
    • Matheuristic
    • Network design
    • Mathematical programming

    Fingerprint

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

    Cite this