Network Design for Container Shipping Using Cutting Planes

Line Blander Reinhardt (Author), Brian Kallehauge (Author)

    Research output: Non-textual formSound/Visual production (digital)Research

    Abstract

    The network design problem in container shipping is of increasing importance in the strongly competitive markets where potential cost reductions are of the utmost importance. We combine the network design and fleet assignment problem into a mixed integer linear programming model minimizing the overall cost. The real-life container shipping network design problem differs in several ways from the standard network design problem. Examples of these differences are the cyclic routes of vessels and the fact that a route is continuously sailed for a given forecast period. To model these real-life situations we have introduced a cyclic constraint and included the time of a vessel route in the calculation of the capacity of that route. Moreover we have added an inhomogeneous fleet to the model and included the cost of transshipment, which is one of the major costs for shipping companies. To simulate the fact that the route of a ship allows for subtours, we introduce the concept of pseudo-simple routes. To solve the problem we use a branch and cut solution method using clover and capacity cuts we defined for the problem.
    Original languageEnglish
    Publication date2007
    Publication statusPublished - 2007
    EventConference on Maritime & Intermodal Logistics, 17-19 Dec 2007 - Singapore
    Duration: 1 Jan 2007 → …

    Conference

    ConferenceConference on Maritime & Intermodal Logistics, 17-19 Dec 2007
    CitySingapore
    Period01/01/2007 → …

    Cite this

    Reinhardt, L. B. (Author), & Kallehauge, B. (Author). (2007). Network Design for Container Shipping Using Cutting Planes. Sound/Visual production (digital)
    Reinhardt, Line Blander (Author) ; Kallehauge, Brian (Author). / Network Design for Container Shipping Using Cutting Planes. [Sound/Visual production (digital)].
    @misc{b7606f17dc9e4a50ae849d8f7cab3b6b,
    title = "Network Design for Container Shipping Using Cutting Planes",
    abstract = "The network design problem in container shipping is of increasing importance in the strongly competitive markets where potential cost reductions are of the utmost importance. We combine the network design and fleet assignment problem into a mixed integer linear programming model minimizing the overall cost. The real-life container shipping network design problem differs in several ways from the standard network design problem. Examples of these differences are the cyclic routes of vessels and the fact that a route is continuously sailed for a given forecast period. To model these real-life situations we have introduced a cyclic constraint and included the time of a vessel route in the calculation of the capacity of that route. Moreover we have added an inhomogeneous fleet to the model and included the cost of transshipment, which is one of the major costs for shipping companies. To simulate the fact that the route of a ship allows for subtours, we introduce the concept of pseudo-simple routes. To solve the problem we use a branch and cut solution method using clover and capacity cuts we defined for the problem.",
    author = "Reinhardt, {Line Blander} and Brian Kallehauge",
    year = "2007",
    language = "English",

    }

    Reinhardt, LB & Kallehauge, B, Network Design for Container Shipping Using Cutting Planes, 2007, Sound/Visual production (digital).
    Network Design for Container Shipping Using Cutting Planes. Reinhardt, Line Blander (Author); Kallehauge, Brian (Author). 2007. Event: Conference on Maritime & Intermodal Logistics, 17-19 Dec 2007, Singapore.

    Research output: Non-textual formSound/Visual production (digital)Research

    TY - ADVS

    T1 - Network Design for Container Shipping Using Cutting Planes

    A2 - Reinhardt, Line Blander

    A2 - Kallehauge, Brian

    PY - 2007

    Y1 - 2007

    N2 - The network design problem in container shipping is of increasing importance in the strongly competitive markets where potential cost reductions are of the utmost importance. We combine the network design and fleet assignment problem into a mixed integer linear programming model minimizing the overall cost. The real-life container shipping network design problem differs in several ways from the standard network design problem. Examples of these differences are the cyclic routes of vessels and the fact that a route is continuously sailed for a given forecast period. To model these real-life situations we have introduced a cyclic constraint and included the time of a vessel route in the calculation of the capacity of that route. Moreover we have added an inhomogeneous fleet to the model and included the cost of transshipment, which is one of the major costs for shipping companies. To simulate the fact that the route of a ship allows for subtours, we introduce the concept of pseudo-simple routes. To solve the problem we use a branch and cut solution method using clover and capacity cuts we defined for the problem.

    AB - The network design problem in container shipping is of increasing importance in the strongly competitive markets where potential cost reductions are of the utmost importance. We combine the network design and fleet assignment problem into a mixed integer linear programming model minimizing the overall cost. The real-life container shipping network design problem differs in several ways from the standard network design problem. Examples of these differences are the cyclic routes of vessels and the fact that a route is continuously sailed for a given forecast period. To model these real-life situations we have introduced a cyclic constraint and included the time of a vessel route in the calculation of the capacity of that route. Moreover we have added an inhomogeneous fleet to the model and included the cost of transshipment, which is one of the major costs for shipping companies. To simulate the fact that the route of a ship allows for subtours, we introduce the concept of pseudo-simple routes. To solve the problem we use a branch and cut solution method using clover and capacity cuts we defined for the problem.

    M3 - Sound/Visual production (digital)

    ER -

    Reinhardt LB (Author), Kallehauge B (Author). Network Design for Container Shipping Using Cutting Planes 2007.