Optimization of the drayage problem using exact methods

Line Blander Reinhardt, David Pisinger, Simon Spoorendonk, Mikkel M. Sigurd

    Research output: Contribution to journalJournal articleResearchpeer-review

    408 Downloads (Pure)

    Abstract

    Major liner shipping companies offer pre- and end-haulage as part of a door-to-door service, but unfortunately pre- and end-haulage is frequently one of the major bottlenecks in efficient liner shipping due to the lack of coordination between customers.In this paper, we apply techniques from vehicle routing problems to schedule pre- and end-haulage of containers, and perform tests on data from a major liner shipping company. The paper considers several versions of the scheduling problem such as having multiple empty container depots, and having to balance the empty container depot levels. The influence of the side constraints on the overall cost is analysed. By exploring the fact that the number of possible routes in the considered case is quite limited, we show that the model can be solved within a minute by use of column enumeration. Alternative constraints and problem formulations, such as balancing empty container storage level at depots, are considered. Computational results are reported on real-life data from a major liner shipping company.
    Original languageEnglish
    JournalI N F O R Journal
    Volume54
    Issue number1
    Pages (from-to)33-51
    Number of pages18
    ISSN0315-5986
    DOIs
    Publication statusPublished - 2016

    Cite this

    Reinhardt, Line Blander ; Pisinger, David ; Spoorendonk, Simon ; Sigurd, Mikkel M. / Optimization of the drayage problem using exact methods. In: I N F O R Journal. 2016 ; Vol. 54, No. 1. pp. 33-51.
    @article{57b13a92f86a478e94bd5d62b34cdd1d,
    title = "Optimization of the drayage problem using exact methods",
    abstract = "Major liner shipping companies offer pre- and end-haulage as part of a door-to-door service, but unfortunately pre- and end-haulage is frequently one of the major bottlenecks in efficient liner shipping due to the lack of coordination between customers.In this paper, we apply techniques from vehicle routing problems to schedule pre- and end-haulage of containers, and perform tests on data from a major liner shipping company. The paper considers several versions of the scheduling problem such as having multiple empty container depots, and having to balance the empty container depot levels. The influence of the side constraints on the overall cost is analysed. By exploring the fact that the number of possible routes in the considered case is quite limited, we show that the model can be solved within a minute by use of column enumeration. Alternative constraints and problem formulations, such as balancing empty container storage level at depots, are considered. Computational results are reported on real-life data from a major liner shipping company.",
    author = "Reinhardt, {Line Blander} and David Pisinger and Simon Spoorendonk and Sigurd, {Mikkel M.}",
    year = "2016",
    doi = "10.1080/03155986.2016.1149919",
    language = "English",
    volume = "54",
    pages = "33--51",
    journal = "I N F O R Journal",
    issn = "0315-5986",
    publisher = "CRC Press/Balkema",
    number = "1",

    }

    Optimization of the drayage problem using exact methods. / Reinhardt, Line Blander; Pisinger, David; Spoorendonk, Simon; Sigurd, Mikkel M.

    In: I N F O R Journal, Vol. 54, No. 1, 2016, p. 33-51.

    Research output: Contribution to journalJournal articleResearchpeer-review

    TY - JOUR

    T1 - Optimization of the drayage problem using exact methods

    AU - Reinhardt, Line Blander

    AU - Pisinger, David

    AU - Spoorendonk, Simon

    AU - Sigurd, Mikkel M.

    PY - 2016

    Y1 - 2016

    N2 - Major liner shipping companies offer pre- and end-haulage as part of a door-to-door service, but unfortunately pre- and end-haulage is frequently one of the major bottlenecks in efficient liner shipping due to the lack of coordination between customers.In this paper, we apply techniques from vehicle routing problems to schedule pre- and end-haulage of containers, and perform tests on data from a major liner shipping company. The paper considers several versions of the scheduling problem such as having multiple empty container depots, and having to balance the empty container depot levels. The influence of the side constraints on the overall cost is analysed. By exploring the fact that the number of possible routes in the considered case is quite limited, we show that the model can be solved within a minute by use of column enumeration. Alternative constraints and problem formulations, such as balancing empty container storage level at depots, are considered. Computational results are reported on real-life data from a major liner shipping company.

    AB - Major liner shipping companies offer pre- and end-haulage as part of a door-to-door service, but unfortunately pre- and end-haulage is frequently one of the major bottlenecks in efficient liner shipping due to the lack of coordination between customers.In this paper, we apply techniques from vehicle routing problems to schedule pre- and end-haulage of containers, and perform tests on data from a major liner shipping company. The paper considers several versions of the scheduling problem such as having multiple empty container depots, and having to balance the empty container depot levels. The influence of the side constraints on the overall cost is analysed. By exploring the fact that the number of possible routes in the considered case is quite limited, we show that the model can be solved within a minute by use of column enumeration. Alternative constraints and problem formulations, such as balancing empty container storage level at depots, are considered. Computational results are reported on real-life data from a major liner shipping company.

    U2 - 10.1080/03155986.2016.1149919

    DO - 10.1080/03155986.2016.1149919

    M3 - Journal article

    VL - 54

    SP - 33

    EP - 51

    JO - I N F O R Journal

    JF - I N F O R Journal

    SN - 0315-5986

    IS - 1

    ER -