The time-dependent pickup and delivery problem with time windows

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

6 Citaties (Scopus)

Uittreksel

In this paper, we study a family of time-dependent pickup and delivery problems with time windows to optimize the service of a transportation provider under two dimensions of operational flexibility. In the first, we consider problems wherein the transportation service provider can choose the transportation requests it serves in order to maximize profit. In the second, we consider problems wherein they can take advantage of periods of light traffic by dictating to drivers when their routes should begin. We also consider problems wherein these flexibilities are not present. We propose an exact solution approach for solving problems from this family that is based upon branch and price, wherein columns are generated via a tailored labeling algorithm. We augment the framework with adaptations of various speed-up techniques from the literature, including limited-memory subset-row cuts and route enumeration. With an extensive computational study, we assess the effectiveness of the proposed framework and the impact of the adapted techniques.

TaalEngels
Pagina's1-24
Aantal pagina's24
TijdschriftTransportation Research. Part B: Methodological
Volume116
DOI's
StatusGepubliceerd - 1 okt 2018

Vingerafdruk

Pickups
flexibility
Labeling
Profitability
service provider
Data storage equipment
profit
driver
traffic
time
present

Trefwoorden

    Citeer dit

    @article{337ed6abec944610876b1af3c6c6192b,
    title = "The time-dependent pickup and delivery problem with time windows",
    abstract = "In this paper, we study a family of time-dependent pickup and delivery problems with time windows to optimize the service of a transportation provider under two dimensions of operational flexibility. In the first, we consider problems wherein the transportation service provider can choose the transportation requests it serves in order to maximize profit. In the second, we consider problems wherein they can take advantage of periods of light traffic by dictating to drivers when their routes should begin. We also consider problems wherein these flexibilities are not present. We propose an exact solution approach for solving problems from this family that is based upon branch and price, wherein columns are generated via a tailored labeling algorithm. We augment the framework with adaptations of various speed-up techniques from the literature, including limited-memory subset-row cuts and route enumeration. With an extensive computational study, we assess the effectiveness of the proposed framework and the impact of the adapted techniques.",
    keywords = "Branch-and-price, Pickup and delivery problem, Time windows, Time-dependent travel times",
    author = "Peng Sun and Veelenturf, {Lucas P.} and Mike Hewitt and {van Woensel}, Tom",
    year = "2018",
    month = "10",
    day = "1",
    doi = "10.1016/j.trb.2018.07.002",
    language = "English",
    volume = "116",
    pages = "1--24",
    journal = "Transportation Research. Part B: Methodological",
    issn = "0191-2615",
    publisher = "Elsevier",

    }

    The time-dependent pickup and delivery problem with time windows. / Sun, Peng; Veelenturf, Lucas P.; Hewitt, Mike; van Woensel, Tom.

    In: Transportation Research. Part B: Methodological, Vol. 116, 01.10.2018, blz. 1-24.

    Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

    TY - JOUR

    T1 - The time-dependent pickup and delivery problem with time windows

    AU - Sun,Peng

    AU - Veelenturf,Lucas P.

    AU - Hewitt,Mike

    AU - van Woensel,Tom

    PY - 2018/10/1

    Y1 - 2018/10/1

    N2 - In this paper, we study a family of time-dependent pickup and delivery problems with time windows to optimize the service of a transportation provider under two dimensions of operational flexibility. In the first, we consider problems wherein the transportation service provider can choose the transportation requests it serves in order to maximize profit. In the second, we consider problems wherein they can take advantage of periods of light traffic by dictating to drivers when their routes should begin. We also consider problems wherein these flexibilities are not present. We propose an exact solution approach for solving problems from this family that is based upon branch and price, wherein columns are generated via a tailored labeling algorithm. We augment the framework with adaptations of various speed-up techniques from the literature, including limited-memory subset-row cuts and route enumeration. With an extensive computational study, we assess the effectiveness of the proposed framework and the impact of the adapted techniques.

    AB - In this paper, we study a family of time-dependent pickup and delivery problems with time windows to optimize the service of a transportation provider under two dimensions of operational flexibility. In the first, we consider problems wherein the transportation service provider can choose the transportation requests it serves in order to maximize profit. In the second, we consider problems wherein they can take advantage of periods of light traffic by dictating to drivers when their routes should begin. We also consider problems wherein these flexibilities are not present. We propose an exact solution approach for solving problems from this family that is based upon branch and price, wherein columns are generated via a tailored labeling algorithm. We augment the framework with adaptations of various speed-up techniques from the literature, including limited-memory subset-row cuts and route enumeration. With an extensive computational study, we assess the effectiveness of the proposed framework and the impact of the adapted techniques.

    KW - Branch-and-price

    KW - Pickup and delivery problem

    KW - Time windows

    KW - Time-dependent travel times

    UR - http://www.scopus.com/inward/record.url?scp=85051129185&partnerID=8YFLogxK

    U2 - 10.1016/j.trb.2018.07.002

    DO - 10.1016/j.trb.2018.07.002

    M3 - Article

    VL - 116

    SP - 1

    EP - 24

    JO - Transportation Research. Part B: Methodological

    T2 - Transportation Research. Part B: Methodological

    JF - Transportation Research. Part B: Methodological

    SN - 0191-2615

    ER -