On-demand ridesharing service has been recognized as an effective way to meet travel needs while significantly reducing the number of required vehicles. However, most previous studies investigating dynamic assignment for ridesharing systems overlook the effects on travel times due to the assignment of requests to vehicles and their routes. To better assign the ridesharing vehicles while considering network traffic, we propose a framework that incorporates time-dependent link travel time into the request-vehicle assignment. Furthermore, we formulate an optimal assignment problem that considers multiple path options and that accounts for the congestion potentially caused by assigned routes. A set of simulations reveals that using an appropriate congestion avoidance ridesharing strategy can remarkably reduce passenger average travel and waiting time by alleviating traffic congestion in the network.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Computationally efficient dynamic assignment for on-demand ridesharing in congested networks


    Contributors:
    Zhou, Ze (author) / Roncoli, Claudio (author)


    Publication date :

    2021-06-16


    Size :

    2054990 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Dynamic Traffic Assignment in Congested Networks

    Bellei, G. / Bielli, M. / Italian National Research Council; Progetto Finalizzato Transporti et al. | British Library Conference Proceedings | 1996


    Dynamic Traffic Assignment in Congested Networks

    Bellei, Giuseppe / Bielli, Maurizio | Springer Verlag | 1996


    Assignment of Freight Shipment Demand in Congested Rail Networks

    Hwang, Taesung / Ouyang, Yanfeng | Transportation Research Record | 2014


    Dynamic Re-Assignment of Ridesharing Vehicles

    RAKAH YARON / SHOVAL OREN / RAMOT DANIEL et al. | European Patent Office | 2018

    Free access

    Dynamic transit assignment algorithms for urban congested networks

    Crisalli, U. / Wessex Institute of Technology | British Library Conference Proceedings | 2000