Abstract State of the art travel demand models for urban areas typically distinguish four or five main modes: walking, cycling, public transport and car. The mode car can be further split into car-driver and car-passenger. As the importance of ridesharing may increase in the coming years, ridesharing should be addressed as an additional sub or main mode in travel demand modeling. This requires an algorithm for matching the trips of suppliers (typically car drivers) and demanders (travelers of non-car modes). The paper presents a matching algorithm, which can be integrated in existing travel demand models. The algorithm works likewise with integer demand, which is typical for agent-based microscopic models, and with non-integer demand occurring in travel demand matrices of a macroscopic model. The algorithm compares two path sets of suppliers and demanders. The representation of a path in the road network is reduced from a sequence of links to a sequence of zones. The zones act as a buffer along the path, where demanders can be picked up. The travel demand model of the Stuttgart Region serves as an application example. The study estimates that the entire travel demand of all motorized modes in the Stuttgart Region could be transported by 7% of the current car fleet with 65% of the current vehicle distance traveled, if all travelers were willing to either use ridesharing vehicles with 6 seats or traditional rail.


    Access

    Access via TIB


    Export, share and cite



    Title :

    A modeling approach for matching ridesharing trips within macroscopic travel demand models


    Contributors:

    Published in:

    Publication date :

    2018




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Classification :

    BKL:    74.75$jVerkehrsplanung$jVerkehrspolitik / 55.80$jVerkehrswesen$jTransportwesen: Allgemeines / 55.80 Verkehrswesen, Transportwesen: Allgemeines / 74.75 Verkehrsplanung, Verkehrspolitik