Recent advances in GPS and telecommunications technologies have made ridesharing a widespread practice around the world. By matching drivers and passengers with near-distance destinations and similar time schedules, ridesharing saves individuals travel costs by enabling them to share vehicles. It is also an effective way to reduce traffic congestion and greenhouse gas emissions. A ridesharing problem can be modeled as a dial-a-ride problem with time windows. This study looks at a solution to the dynamic ridesharing problem in which passengers share travel costs at the same ratio. We formulate the problem as a mixed-integer programming model and suggest a column generation approach. As the system’s status is updated in real time, riders and drivers are matched, and new paths are created via column generation. Computational experiments show that our approach is superior to an existing algorithm when it is tested on instances of various sizes.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A column generation approach for a dynamic ridesharing problem


    Contributors:
    Kim, Minsu (author) / Kim, Hyunwoo (author) / Moon, Ilkyeong (author)

    Published in:

    Transportation Letters ; 15 , 9 ; 1114-1125


    Publication date :

    2023-10-21


    Size :

    12 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown





    Markets for Dynamic Ridesharing?

    Deakin, Elizabeth / Frick, Karen Trapenberg / Shively, Kevin M. | Transportation Research Record | 2010


    Optimization of Dynamic Ridesharing Systems

    Di Febbraro, A | Online Contents | 2013


    Dynamic ridesharing with intermediate locations

    Aissat, Kamel / Oulamara, Ammar | IEEE | 2014


    RIDESHARING SUPPORT SYSTEM, RIDESHARING SUPPORT METHOD, AND RIDESHARING SUPPORT DEVICE

    MORIOKA WATARU | European Patent Office | 2019

    Free access