Efficient dynamic ride-matching (DRM) in large-scale transportation systems is a key driver in transport simulations to yield answers to challenging problems. Although the DRM problem is simple to solve, it quickly becomes a computationally challenging problem in large-scale transportation system simulations. Therefore, this study thoroughly examines the DRM problem dynamics and proposes an optimization-based solution framework to solve the problem efficiently. To benefit from parallel computing and reduce computational times, the problem’s network is divided into clusters utilizing a commonly used unsupervised machine learning algorithm along with a linear programming model. Then, these sub-problems are solved using another linear program to finalize the ride-matching. At the clustering level, the framework allows users adjusting cluster sizes to balance the trade-off between the computational time savings and the solution quality deviation. A case study in the Chicago Metropolitan Area, U.S., illustrates that the framework can reduce the average computational time by 58% at the cost of increasing the average pick up time by 26% compared with a system optimum, that is, non-clustered, approach. Another case study in a relatively small city, Bloomington, Illinois, U.S., shows that the framework provides quite similar results to the system-optimum approach in approximately 62% less computational time.


    Access

    Download

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Dynamic Ride-Matching for Large-Scale Transportation Systems


    Additional title:

    Transportation Research Record: Journal of the Transportation Research Board


    Contributors:


    Publication date :

    2021-10-10




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Stable Matching for Dynamic Ride-Sharing Systems

    Wang, Xing / Agatz, Niels / Erera, Alan | British Library Online Contents | 2018


    Transportation Ride Quality

    I. D. Jacobson / R. W. Barber / A. J. Healy et al. | NTIS | 1977


    Transportation ride quality

    National Research Council, Transportation Research Board, USA | TIBKAT | 1977


    Asynchronous Adaptive Large Neighborhood Search Algorithm for Dynamic Matching Problem in Ride Hailing Services

    Syed, Arslan Ali / Kaltenhaeuser, Bernd / Gaponova, Irina et al. | IEEE | 2019