An algorithm for solving the time-constrained multicommodity flow problem with applications in liner shipping network design

Christian Vad Karsten (Invited author), David Pisinger (Invited author), Stefan Røpke

    Research output: Contribution to conferenceConference abstract for conferenceResearchpeer-review

    11 Downloads (Pure)

    Abstract

    The liner shipping network design problem has proven to be hard to solve. However, well-designed route nets are paramount to liner shipping companies both in terms of competitiveness and environmental impact. Fast evaluations of the multicommodity flow subproblem is one of the bottlenecks when determining the optimal routing and fleet deployment in the network design problem. Additionally, most existing models do not consider the level of service. To accommodate that, we present an algorithm for solving the multicommodity flow subproblem with limits on commodity travel time.
    Original languageEnglish
    Publication date2013
    Publication statusPublished - 2013
    Event26th European Conference on Operational Research - Rome, Italy
    Duration: 1 Jul 20134 Jul 2013
    Conference number: 26

    Conference

    Conference26th European Conference on Operational Research
    Number26
    CountryItaly
    CityRome
    Period01/07/201304/07/2013

    Keywords

    • Transportation and Logistics
    • Network flows
    • Network Design

    Fingerprint Dive into the research topics of 'An algorithm for solving the time-constrained multicommodity flow problem with applications in liner shipping network design'. Together they form a unique fingerprint.

    Cite this