A scenario-based planning for the pickup and delivery problem with time windows, scheduled lines and stochastic demands

Veaceslav Ghilas, Emrah Demir, Tom Van Woensel

    Research output: Contribution to journalArticlepeer-review

    63 Scopus citations

    Abstract

    The Pickup and Delivery Problem with Time Windows, Scheduled Lines and Stochastic Demands (PDPTW-SLSD) concerns scheduling a set of vehicles to serve a set of requests, whose expected demands are known in distribution when planning, but are only revealed with certainty upon the vehicles' arrival. In addition, a part of the transportation plan can be carried out on limited-capacity scheduled public transportation line services. This paper proposes a scenario-based sample average approximation approach for the PDPTW-SLSD. An adaptive large neighborhood search heuristic embedded into sample average approximation method is used to generate good-quality solutions. Computational results on instances with up to 40 requests (i.e., 80 locations) reveal that the integrated transportation networks can lead to operational cost savings of up to 16% compared with classical pickup and delivery systems.

    Original languageBritish English
    Pages (from-to)34-51
    Number of pages18
    JournalTransportation Research Part B: Methodological
    Volume91
    DOIs
    StatePublished - 1 Sep 2016

    Keywords

    • Freight transportation
    • Heuristic algorithm
    • Pickup and delivery problem
    • Scheduled lines
    • Stochastic demands

    Fingerprint

    Dive into the research topics of 'A scenario-based planning for the pickup and delivery problem with time windows, scheduled lines and stochastic demands'. Together they form a unique fingerprint.

    Cite this