A modeling approach for matching ridesharing trips within macroscopic travel demand models
 990 Downloads
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 cardriver and carpassenger. 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 noncar 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 agentbased microscopic models, and with noninteger 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.
Keywords
Macroscopic travel demand model Trip matching Ridesharing Mobility as a service Dial a rideIntroduction

The suppliers conduct their trips independently of any additional demand for a ride.

In the past, where only a small number of trips were on offer, ridesharing made sense only for longdistance trips (arranged by ridesharing agencies) or for regular trips (trip sharing with work mates).
New online platforms ensure the matching of suppliers and potential demanders at short notice. This dynamic ridesharing has become an option in shortdistance transport offering an alternative for trips with no or inadequate public transport. In such cases, ridesharing can reduce car trips and contribute to a more sustainable transport. As the example of transport network companies (TNC) like Uber and Lyft shows, ridesharing can also be provided as a professional service offering taxilike rideselling services, which may increase the number of car trips.
The expectation, that the importance of ridesharing will increase, be it in the form of carpooling or rideselling, requires transport planners to estimate the impacts of ridesharing. How big is the potential of ridesharing? What is the critical mass of suppliers necessary to ensure that demanders are offered a suitable trip with a high probability and short waiting times? What would happen, if fleets of selfdriving cars offer ridesharing services? In order to find answers to these questions travel demand models may be helpful, if they are extended by an algorithm for the matching of offered and demanded trips.

Origin and destination of all trips of suppliers and demanders are located in traffic zones. Every trip originates in an origin zone, traverses a sequence of traffic zones along a shortest path until it terminates in the destination zone. Trips are only matched if their origin and destination lie within the sequence of the traversed zones. Suppliers will only make detours for picking up or dropping off passengers in the zones along the shortest path.

A traffic zone does not represent an exact meeting point for suppliers and demanders but it defines an appropriate area for this meeting. It is assumed that suppliers and demanders can arrange an appropriate meeting point within a zone. The exact meeting point, however, is not modeled. Longer trip times resulting from detours for picking up or dropping off demanders can be included by extra times depending on the size of the corresponding traffic zone.

The daily travel demand is available as a set of timedependent demand matrices. The algorithm matches the trips for every matrix independently.
Important characteristics of macroscopic and microscopic demand models for ridesharing
Characteristics  Macroscopic demand models  Microscopic demand models 

Origin and destination of a trip  Traffic zones  Buildings or arbitrary points in the network 
Representation of demand  Travel demand matrix with volume between origin and destination zones. Demand is noninteger  Set of trips of particular agents as part of a trip chain. Demand is always integer 
Temporal resolution of demand  Discrete in time intervals  Continuous 
The paper does not address methods for determining the modal share of ridesharing trips within a travel demand model. The share can be set as an assumption (“assume 10% of all car drivers offer rides and 20% of all public transport users would take suitable offers”) or determined as an independent mode in the mode choice step of the travel demand model. In addition to traditional ridesharing with suppliers and demanders, the paper also addresses a case where individual suppliers are replaced by fleets of taxis or taxirobots. This case permits to calculate the vehicle occupancy rates of such taxi fleets.
State of the art
Characteristics and perspective of ridesharing

Dynamic: mobile phones with internet access allow for matches on shortnotice.

Costsharing: the variable costs of a trip are split between the rideshare participants.

Nonrecurring trips: singletrip ridesharing does not require a rigid time schedule.

Automated matching: the ride matching should be automated to reduce the effort of the participants. The system finds suitable matches and facilitates the communication.
Uber Pool and Lyft Line prove that dynamic ridesharing works. The success indicates the potential of ridesharing. The current situation will change again with driverless cars. Statements of car manufacturers (Inventivio 2017) and scientific forecasts (Trommer et al. 2016; Litman et al. 2017; Bansal and Kockelman 2017) on the availability of selfdriving cars still vary a lot, ranging from the near future to 2050 and beyond. Whenever the driverless car comes, it will open new business areas for mobility providers to offer mobility as a service including rideselling services.
The matching problem
The core of a ridesharing system is the trip matching process. The complexity of the matching problem depends on the number of trips. With an increasing number of trips, the number of possible matches increases. The challenge is to find reasonable solutions within a short computational time to run the system as an online realtime application.
The literature on the matching problem in ridesharing comprises various publications (for instance Baldacci et al. 2004; Calvo et al. 2004; Winter and Nittel 2006; Amey 2011; Di Febbraro et al. 2013) dealing with optimization aspects of rideshare problems including patents for the “Automated carpool matching” (Levine et al. 2010). While many approaches focus on fixed assigned demand, Kleiner et al. (2011) reformulate the optimization aspect as an adaptive dynamic ridesharing system that is capable to consider individual preferences of participants while matching the trips.
Ghoseiri et al. (2011) describe ridesharing systems operating in the US and formulate a “Dynamic Rideshare Matching Optimization Model”, introducing a wide range of additional marginal conditions (for instance gender). In addition, Shangyao and ChunYing (2011) consider different vehicle and person types to represent more closely the effects of real behavior aspects.
In travel demand modeling so far the ride matching problem is addressed exclusively in the context of microscopic demand modeling (for instance Shangyao and ChunYing 2011; Galland et al. 2013; Dubernet et al. 2013), in which the negotiation process of the transport users (agents) is modeled. Algorithms for matching noninteger demand, as it occurs in demand matrices of a macroscopic travel model, are not yet described to the knowledge of the authors.
Algorithm and implementation
An algorithm for solving the matching problem in an optimal way can for example aim at maximizing the number of matched trips or at maximizing the occupancy rate in the vehicles. The structure of the tripmatching problem is similar to the traveling salesman problem, which is a NPhard optimization problem, if the optimal solution is required. To handle real world problem sizes with zone numbers over 1000 and trip numbers over 100,000 the algorithm presented in the following makes simplifications. The algorithm belongs to the class of greedy algorithms and therefore does not guarantee an optimal solution for the matching problem.
Input data

The demand matrix of the suppliers S. In a travel demand model they are a subset from the demand matrix of cardrivers, i.e. car drivers who are willing to provide a ride to unacquainted travelers not belonging to the family.

The demand matrix of the demanders D. In a travel demand model, they may come from a subset of the matrices for carself driver, carpassenger and public transport users, who consider using a ridesharing service. They may also come from a specific ridesharing mode.
The demand should be available in small time intervals t (≤ 15 min) and in traffic zones of appropriate size (travel time in traffic zone ≪ average travel time of a trip). Thus S_{t} and D_{t} represent the demand matrices in time interval t.
Basic algorithm
 1.
Determining a set of reference objects for pickup and dropoff locations A reference object describes the location in the network where potential ridesharers can be picked up. Reference objects can be road links, public transport stops or ridesharing meeting points. The basic algorithm described in the following assumes that the reference object is a link which refers to exactly one traffic zone z. Road links restricted to motor vehicles, where boarding is prohibited, should be excluded from the set of reference objects.
 2.Assigning a zone z to each link l Every link l of the road network is assigned to one or no zone number. The assignment requires an intersect operation as provided by Geographic Information Systems (see Fig. 1).
 3.
Determining two path sets P for suppliers and demanders For every time interval t the two demand matrices S_{t} and D_{t} are assigned to the transport network using a shortestpath assignment. The result is one path set for the suppliers P _{ t} ^{ S} and one path set for the demanders P _{ t} ^{ D} for every time interval t. Each set contains maximum one path p for each odpair with the corresponding demand of the suppliers \( d_{p,t}^{S} \) and demanders d _{ p, t} ^{ D} .
 4.
Reducing paths from a sequence of links to a sequence of zones Each path of a path set \( p \in P_{t} \) traverses a sequence of links \( l_{1} ,l_{2} , \ldots ,l_{n} \) and in doing so, a sequence of zone objects \( z_{{l_{1} }} ,z_{{l_{2} }} , \ldots ,z_{{l_{n} }} \). The sequence of zone objects is stored as a string attribute of a path. It describes the sequence of traversed traffic zones where demanders can be collected. The sequence of zone objects often contains the same zone object several times (\( z_{{l_{1} }} \equiv z_{{l_{2} }} ) \). In this case, duplicate zone objects are deleted. As a result, each path is reduced to a sequence of zones containing considerably less elements than the sequence of links. Figure 1 illustrates the procedure to obtain a reduced sequence of zone objects.
 5.
Assigning a capacity to each path of the suppliers Each path of the supplier path set \( P_{t}^{S} \) obtains a capacity resulting from the demand volume of the supplier and the average vehicle capacity (for instance a 5seatvehicle). As suppliers may travel with private car passengers, e.g. family members, the capacity needs to be reduced appropriately. Equation (1) shows how to compute the available capacity for ridesharing for one path including car passenger demand on odlevel. Equation (2) determines the capacity using an average occupancy rate:
$$ c_{p,t}^{S} = c_{o,d,t}^{S} = (c^{veh}  1) \cdot d_{o,d,t}^{S}  d_{o,d,t}^{CarPass} $$(1)where c _{ p, t} ^{ S} capacity for ridesharing provided by supplier on path p in time interval t. In the case of a shortest path match, path capacity is equal to the capacity c _{ o, d, t} ^{ S} from zone o to zone d; c^{veh} average vehicle capacity including driver; d _{ o, d, t} ^{ s} travel demand of suppliers from zone o to zone d in time interval t; d _{ o, d, t} ^{ CarPass} travel demand of private car passengers from zone o to zone d in time interval t; o^{veh} average occupany rate of a private car: o^{veh} = (d^{s} + d^{CarPass})/d^{s}$$ c_{p,t}^{S} = c_{o,d,t}^{S} = \left( {c^{veh}  o^{veh} } \right) \cdot d_{o,d,t}^{s} $$(2)Assuming a supplier demand of 0.2 car trips along a particular path, a car passenger demand of 0.06 and a vehicle capacity of 5 places, the available capacity for ridesharers is \( \left( {5  1} \right) \cdot 0.20  0.06 = 0.74 \) persons. In this calculation (5 − 1) = 4 represents the free capacity of one car with one driver. As it is a macroscopic model, the supplier demand of the path is noninteger. This leads to \( 4 \cdot 0.20 = 0.8 \) empty places on the path, out of which 0.06 places are already taken by car passengers traveling with the driver, e.g. family members.
 6.
Matching of paths The matching of the two path sets P _{ t} ^{ S} and P _{ t} ^{ D} compares the reduced paths of zone sequences. A full match occurs, if the origin and destination zones of \( p^{D} \in P_{t}^{D} \) and \( p^{S} \in P_{t}^{S} \) are identical. A partial match occurs if path p^{D} is covered by p^{S}, i.e. p^{D} ⊂ p^{S}. Path p^{D} is covered by path p^{S} if origin o and destination d of path p^{D} occur in the right order (o before d) in the zone sequence of path p^{S}. This can be implemented as a string comparison. Figure 1 illustrates the advantage of matching paths not on the level of links but on the level of zones: This allows identifying paths, which are not completely identical, but still suitable for a match. The matching process starts with fully matching paths. The remaining paths are processed sequentially, starting with the first path of the path set P _{ t} ^{ D} . There are other possibilities to process the remaining paths, for instance starting with the longest path.
 7.
Reduction of path capacity and path demand After every match, the sharing capacity \( c_{{p^{S} ,t}}^{S} \) of path p^{S} is reduced according to Eq. (3) by the demand of ridesharers moving along path p^{D} ⊂ p^{S} until the entire capacity is utilized. At the same time the unsatisfied ridesharing demand is reduced as shown in Eq. (4):
$$ c_{{p^{S} ,t}}^{S} = \left\{ {\begin{array}{*{20}l} {c_{{p^{S} ,t}}^{S}  d_{{p^{D} \subset p^{S} ,t}}^{D} } \hfill & {\quad if\; demand \; \le \;capacity} \hfill \\ 0 \hfill & {\quad if\; demand \; > \;capacity} \hfill \\ \end{array} } \right. $$(3)$$ d_{{p^{D} \subset p^{S} ,t}}^{D} = \left\{ {\begin{array}{*{20}l} 0 \hfill & {\quad if\, demand \, \le \,capacity} \hfill \\ {d_{{p^{D} \subset p^{S} ,t}}^{D}  c_{{p^{S} ,t}}^{S} } \hfill & {\quad if\, demand \, > \,capacity} \hfill \\ \end{array} } \right. $$(4)  8.
Recording of unsatisfied demand After all paths of a time interval have been checked to identify matches, the number of demanders finding a match (satisfied ridesharing demand) and the number of demanders without a match (unsatisfied ridesharing demand) can be summed up over all paths. For every pickup stop the travel time increases by a certain value. The additional travel time can be implemented as fixed value (e.g. 4 min for each stop) or as function of the boarding demand.
Extensions of the algorithm

Handling rideselling systems This refers to a case where the suppliers are not private car drivers but taxilike rideselling services with professional drivers or driverless cars. In this case, only the demand matrix of the demanders is used as input. In the matching step all paths of the path set P _{ t} ^{ D} are compared to each other. Two paths p _{1} ^{ D} and p _{2} ^{ D} are matched if one of the two conditions hold: p _{1} ^{ D} ⊂ p _{2} ^{ D} or p _{1} ^{ D} ⊃ p _{2} ^{ D} . This approach assumes that the number of taxis is not limited.

Smart match A partial matching following the path order (i.e. matching the first supplier to the first demander path according to the order of the zone numbers) unnecessarily wastes unused ridesharing capacity. Instead, paths can be matched in such a way that either the paths with the longest shared distance or the paths with the highest demand are matched first.
 Arbitrary reference objects referring to one zone The basic algorithm described above assumes that every link belongs to maximum one zone, as it is the case in Fig. 2 a. Figure 2 b presents a case, where the reference object is not a link but a dedicated ridesharing meeting point. This meeting point is assigned to exactly one zone. The unique zone number of the meeting point is then assigned to all links within a certain buffer around the meeting point. This buffer expresses the willingness of suppliers to accept detours for picking up and dropping off demanders. As a result, a link may belong to more than one zone. This leads to a modified sequence of zones, which can then be processed as in the basic algorithm.

Arbitrary reference objects referring to several zones Figure 2c presents a case where a meeting point can be linked to more than one zone. This case again may lead to a modified sequence of zones thus influencing the results.

Multipath The shortest path assignment can be extended by any other multipath assignment method leading to odpairs with more than one path. In this case, the ridesharing capacity of the odpair needs to be distributed to every path. One simple solution is to use the shares from the traffic assignment.
Implementation
The algorithm described above is implemented in the transport planning software of PTV VISUM (2017). VISUM contains all data structures of the transport supply (nodes and links) and of the travel demand (traffic zones, demand matrices). Of major importance for the matching are route objects that are saved in VISUM as the results of a traffic assignment. A route object p is made up of data describing the route (the demand on the particular route, length and travel time) and the route elements (sequence of nodes respectively links). Using the VISUMroute objects and the methods available in VISUM (e.g. intersecting and shortestpath assignment), a matching of routes can be implemented with less than 100 lines of code.
Computation time increases with the square of the number of paths, which are compared in the matching step. In order to reduce computation time, the search engine Elasticsearch (2017) is integrated into the processing sequence of VISUM using a Python script. The path sets of suppliers and demanders are handed over to the search engine. The result from the search process is a list with possible routes for the matching process. The matching part of the algorithm then decides which demanded route is assigned to one or several routes from the subset of supplied routes depending on capacity restrictions. Elasticsearch helped to reduce the computation time considerably by a factor of 1000.
For the two scenarios presented below a 64 GB RAM computer with an Intel(R) Core(TM) i75820 k 3.30 GHz processor required a computation time of approximately 1 h for scenario S1 (1100 zones, 96 time intervals, 300,000 demanders, 150,000 suppliers) and 3 h for scenario S2 (1100 zones, 96 time intervals, 1,200,000 demanders, 750,000 suppliers).
The Institute for Road and Transport Science (2017) provides a link to a toy network to demonstrate the ridesharing algorithm. The procedure is simplified with respect to the process how the algorithm detects paths that could be matched. Therefore, the procedure works without external libraries and is directly executable if VISUM 16 is installed on a local machine.
Results
The algorithm is applied to the Stuttgart Region (Schlaich and Analyseverkehr 2009), a polycentric region with 2.7 million inhabitants living in several towns, but also rural areas. On a workday, the inhabitants produce roughly 5 million motorized trips, out of which 3 million are cardrivers, 1 million are carpassengers and 1 million use public transport. This travel demand is replicated in a travel demand model with 1100 traffic zones distinguishing 23 person groups and 19 trip purposes. The demand is available for 96 time intervals of 15 min each. Although the algorithm is suitable for handling noninteger demand matrices, the experiments described below apply integer demand matrices, i.e. full trips.

Share of cardrivers willing to offer rides (supplier),

Share of cardrivers willing to take a ride and leaving their own vehicle at home (demander),

Share of public transport users willing to shift from public transport (demander).

S1: 5% of the cardrivers are willing to offer a ride. The remaining 95% use their vehicle as before. 25% of the public transport users are prepared to shift to ridesharing alternatives, if a match is provided.

S2: 25% of the cardrivers are willing to offer a ride. Further 5% of the cardrivers would shift to ridesharing if a match is available. The remaining 70% use their vehicles as they did before. All public transport users (100%) are willing to shift to ridesharing.
During an entire day, 13% of all ridesharing requests can be served in scenario S1, and 28% in scenario S2. The probability to find a match between 8:00 and 18:00 is in both scenarios higher than in the other hours. This has two reasons: (1) During the early and late hours of a day the demand is low, making it harder to find a match. (2) The share of users traveling during the morning peak is higher in public transport compared to private car transport, mainly because of school trips. This leads to a lower ratio of supplied and demanded trips between 6:00 and 8:00 compared to other hours. Ridesharing can obviously not cover school trips shifting from public transport to ridesharing. The comparison of scenario S1 and S2 illustrates the importance of a critical mass of participants to make a ridesharing system operational. Both sides profit from a high number of participants. Demanders obtain a higher reliability and suppliers will be able to reduce their trip costs by picking up demanders.
Conclusion and outlook

Ridesharing as sub mode: This seems appropriate for traditional ridesharing systems, i.e. systems where drivers offer rides for journeys they are conducting as part of their daily travel pattern. In this case, ridesharing supplements public transport. Using such a system demanders cannot rely on the service and they need a backup mode, which is usually public transport. In a travel demand model the modal share of ridesharing would therefore be determined after the normal mode choice between the main modes within the public transport assignment.

Ridesharing as main mode: This seems appropriate for rideselling systems with professional drivers or driverless cars providing an ondemand shared taxi system. In this case, ridesharing competes with car and public transport. In such a system, it is less likely that demanders would need a backup mode. The modal share of ridesharing would be determined as an additional main mode in the normal mode choice step of the travel demand model. It would compete with car and public transport.
 1.
Traffic zones serve as origins and destinations, precise pickup/dropoff locations are not modeled.
 2.
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.
 3.
The temporal distribution of demand is not continuous but uses time intervals.
Advantages and disadvantages of the presented matching algorithm
Advantages  Disadvantages, shortcomings 

Relatively easy to implement Handling of large problem sizes Reasonably fast Works with integer and noninteger demand Can be integrated into a 4stage travel demand model with feedback between demand calculation and assignment  Extra travel times from detours for picking up and dropping off can only be estimated from the zone size Registration time for calling a ride can only be estimated from the length of the time intervals Trips are only matched within one time interval, so that the algorithm is only quasidynamic producing imprecise matches for trips longer than the time intervals 
The authors developed the algorithm for a study, which analyzed the impacts of large ridesharing systems with driverless cars on the number of required vehicles and the vehicle distance traveled. Similar to a study for Lisbon (OECD 2015), the study (Friedrich 2016; Friedrich et al. 2017) estimated 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. Estimating the number of cars for such a system requires a vehicleblocking algorithm, which assigns every ridesharing trip to one specific car. In the study, an algorithm working with integer demand was applied to determine the number of vehicles and the empty trips between dropoff and pickup locations. The authors are currently working on a blocking algorithm working with noninteger demand using algorithms from doubly constrained trip distribution models. Only then, rideselling systems with professional drivers or selfdriving cars can be fully integrated in traditional macroscopic travel demand models.
Notes
Acknowledgements
This research was funded by Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) as part of the research group for integrated planning in public transport (DFG 2018).
Authors’ contribution
M. Friedrich developed the conceptual idea and the formal definitions. M. Hartl implemented the algorithm and performed the data analysis. C. Magg prepared the input data. All authors reviewed the literature, contributed to the development of the algorithm, discussed the results and drafted the manuscript. All authors read and approved the final manuscript.
References
 Agatz, N.A., Erera, A.L., Savelsbergh, M.W., Wang, X.: Dynamic ridesharing: a simulation study in metro Atlanta. Transportation Research Part B: Methodological 45(9), 1450–1464 (2011). https://doi.org/10.1016/j.trb.2011.05.017 CrossRefGoogle Scholar
 Agatz, N., Erera, A., Savelsbergh, M., Wang, X.: Optimization for Dynamic RideSharing: a review. Eur. J. Oper. Res. 223(2), 295–303 (2012). https://doi.org/10.1016/j.ejor.2012.05.028 CrossRefGoogle Scholar
 Amey, A. Proposed Methodology for Estimating Rideshare Viability Within an Organization: Application to the MIT Community, 90^{th} Annual Meeting of the Transportation Research Board, vol. 112585, 2011Google Scholar
 Baldacci, R., Maniezzo, V., Mingozzi, A.: An exact method for the car pooling problem based on lagrangean column generation. Oper. Res. 52(3), 422–439 (2004). https://doi.org/10.1287/opre.1030.0106 CrossRefGoogle Scholar
 Bansal, P., Kockelman, K.M.: Forecasting Americans’ longterm adoption of connected and autonomous vehicle technologies. Transportation Research Part A: Policy and Practice 95, 49–63 (2017). https://doi.org/10.1016/j.tra.2016.10.013 CrossRefGoogle Scholar
 Calvo, R.W., de Luigi, F., Haastrup, P., Maniezzo, V.: A distributed geographic information system for the daily car pooling problem. Comput. Oper. Res. 31(13), 2263–2278 (2004). https://doi.org/10.1016/S03050548(03)001862 CrossRefGoogle Scholar
 De Marco, A., Giannantonio, R., Zenezini, G.: The diffusion mechanisms of dynamic ridesharing services. Prog. Ind. Ecol., 9(4), 408–432. ISSN 14768917 (2015). https://doi.org/10.1504/pie.2015.076900 CrossRefGoogle Scholar
 DFG—Forschergruppe 2083: Integrierte Planung im öffentlichen Verkehr (Integrated planning in public transport). https://for2083.math.unigoettingen.de/. Accessed 20 May 20 2018
 Di Febbraro, A., Gattorna, E., Sacco, N.: Optimization on dynamic ridesharing systems. Transp. Res. Rec. J. Transp. Res. Board 2359, 44–50 (2013). https://doi.org/10.3141/235906 CrossRefGoogle Scholar
 Dubernet, T., RieserSchüssler, N., Axhausen, K.W.: Using a multiagent simulation tool to estimate the carpooling potential. In: 92th Annual Meeting of the Transportation Research Board, vol. 130866 (2013). https://doi.org/10.3929/ethzb000052402
 Elastic. www.elastic.co. Accessed 20 July 2017
 Friedrich, M., Hartl, M.: MEGAFON—modellergebnisse geteilter autonomer Fahrzeugflotten des öffentlichen Nahverkehrs, Schlussbericht, gefördert von: Ministerium für Verkehr BadenWürttemberg, Verband Deutscher Verkehrsunternehmen e. V., Stuttgarter Straßenbahnen AG, Verkehrs und Tarifverbund Stuttgart GmbH, 2016. https://www.vdv.de/megafonabschlussbericht20161212.pdfx. Accessed 20 July 2017
 Friedrich, M., Hartl, M., Magg, C.: Modelling vehicle sharing with driverless cars, conference simulation science, Göttingen (2017). http://www.simscience2017.unigoettingen.de/wpcontent/uploads/2018/01/SimScienceWorkshop2017_final.pdf, Accessed 20 July 20 2017
 Galland, S., Gaud, N., Knapen, L., Janssens, D., Lamotte, O.: Simulation model of carpooling with the janus multiagent platform. Procedia Comput. Sci. 19, 860–866 (2013). https://doi.org/10.1016/j.procs.2013.06.115 CrossRefGoogle Scholar
 Ghoseiri, K., Haghani, A.E., Hamedi, M.: Realtime rideshare matching problem. MidAtlantic Universities Transportation Center (2011). http://www.mautc.psu.edu/docs/UMD200905.pdf. Accessed 20 July 2017
 Institute for Road and Transport Science, Ridesharing Tool. www.isv.unistuttgart.de/vuv/tools/ridesharing/index.html. Accessed 20 July 2017
 Inventivio. Driverless car market watch—Forecasts. Available at http://www.driverlessfuture.com/?page_id=384. Accessed 20 July 2017
 Kleiner, A., Nebel, B., Ziparo, V.: A mechanism for dynamic ride sharing based on parallel auctions. In: Proceedings of the 22th International Joint Conference on Artificial Intelligence (IJCAI), Barcelona, Spain, pp. 266–272 (2011). https://doi.org/10.5591/9781577355168/ijcai11055. ISBN 9781577355168
 Levine, U., Shinar, A., Shabtai, E., Shmuelevitz, Y.: Automated carpool matching, U.S. Patent Application No. 12/453,133, 2010Google Scholar
 Levofsky, A., Greenberg, A.: Organized dynamic ride sharing: the potential environmental benefits and the opportunity for advancing the concept. In: 92th Annual Meeting of the Transportation Research Board, vol. 010577 (2001). http://ridesharechoices.scripts.mit.edu/home/wpcontent/papers/GreenburgLevofskyOrganizedDynamicRidesharing.pdf. Accessed 20 July 2017
 Litman, T.: Autonomous vehicle implementation predictions, victoria transport policy (2017). https://www.vtpi.org/avip.pdf. Accessed 20 July 2017
 OECD, International Transport Forum. Urban mobility system upgrade. How shared selfdriving cars could change city traffic (2015). https://www.itfoecd.org/sites/default/files/docs/15cpb_selfdrivingcars.pdf. Accessed 20 July 2017
 PTV VISUM. http://visiontraffic.ptvgroup.com/enus/products/ptvvisum/. Accessed 20 July 2017
 Schlaich, J.: Verkehrsmodellierung für die Region Stuttgart. Analyseverkehr 2009/2010. Schlussbericht Modellierung. Karlsruhe (2011)Google Scholar
 Shangyao, Y., ChunYing, C.: An optimization model and a solution algorithm for the manytomany car pooling problem (2011). https://doi.org/10.1007/s1047901109486 CrossRefGoogle Scholar
 Trommer, S., Koarova, V., Fraedrich, E., Kröger, L., Kickhöfer, B., Kuhnimhof, T., Lenz, B., Phleps, P.: Ifmo, autonomous driving—the impact of vehicle automation on mobility behaviour (2016). https://www.bmwgroup.com/content/dam/bmwgroupwebsites/bmwgroup_com/company/downloads/de/2016/Dezember%202016.pdf. Accessed 20 July 2017
 Winter, S., Nittel, S.: Ad hoc sharedride trip planning by mobile geosensor networks. Int. J. Geogr. Inf. Sci. 20(8), 899–916 (2006). https://doi.org/10.1080/13658810600816664 CrossRefGoogle Scholar
Copyright information
Open AccessThis article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.