HighlightsWe define two variants of the Share-a-Ride problem with stochastic travel times and stochastic delivery locations.The first application of the neighborhood search heuristic to the stochastic Share-a-Ride problem.The different sampling strategies are compared.

    AbstractWe consider two stochastic variants of the Share-a-Ride problem: one with stochastic travel times and one with stochastic delivery locations. Both variants are formulated as a two-stage stochastic programming model with recourse. The objective is to maximize the expected profit of serving a set of passengers and parcels using a set of homogeneous vehicles. Our solution methodology integrates an adaptive large neighborhood search heuristic and three sampling strategies for the scenario generation (fixed sample size sampling, sample average approximation, and sequential sampling procedure). A computational study is carried out to compare the proposed approaches. The results show that the convergence rate depends on the source of stochasticity in the problem: stochastic delivery locations converge faster than stochastic travel times according to the numerical test. The sample average approximation and the sequential sampling procedure show a similar performance. The performance of the fixed sample size sampling is better compared to the other two approaches. The results suggest that the stochastic information is valuable in real-life and can dramatically improve the performance of a taxi sharing system, compared to deterministic solutions.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    The Share-a-Ride problem with stochastic travel times and stochastic delivery locations


    Beteiligte:
    Li, Baoxiang (Autor:in) / Krushinsky, Dmitry (Autor:in) / Van Woensel, Tom (Autor:in) / Reijers, Hajo A. (Autor:in)


    Erscheinungsdatum :

    2016-01-18


    Format / Umfang :

    14 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch





    A vehicle routing problem with stochastic travel times

    Woensel, T. van / Kerbache, L. / Peremans, H. et al. | Tema Archiv | 2003


    Pickup and delivery problem with hard time windows considering stochastic and time-dependent travel times

    Zheyu Wang / Maged Dessouky / Tom Van Woensel et al. | DOAJ | 2023

    Freier Zugriff

    Stochastic Vehicle Routing with Random Travel Times

    Kenyon, A. S. / Morton, D. P. | British Library Online Contents | 2003


    Stochastic Vehicle Routing with Random Travel Times

    Kenyon, Astrid S. | Online Contents | 2003