Dynamic ride-sharing: A simulation study in metro Atlanta

By Niels A. H. Agatz, A. Erera, Martin W. P. Savelsbergh, Xing Wang. 2011

541 citations recorded by the source corpus.

Smartphone technology enables dynamic ride-sharing systems that bring together people with similar itineraries and time schedules to share rides on short-notice. This paper considers the problem of matching drivers and riders in this dynamic setting. We develop optimization-based approaches that aim at minimizing the total system-wide vehicle miles incurred by system users, and their individual travel costs. To assess the merits of our methods we present a simulation study based on 2008 travel demand data from metropolitan Atlanta. The simulation results indicate that the use of sophisticated optimization methods instead of simple greedy matching rules substantially improve the performance of ride-sharing systems. Furthermore, even with relatively low participation rates, it appears that sustainable populations of dynamic ride-sharing participants may be possible even in relatively sprawling urban areas with many employment centers.

Subfields: Automotive Engineering, Transportation

View Paper: https://www.semanticscholar.org/paper/8ca205cbdc2111141644d3df2ceed8b3005b44b7

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Automotive Engineering

In Transportation

Citations in the corpus

Crowdsourced Delivery - A Dynamic Pickup and Delivery Problem with Ad Hoc Drivers (2016, background): “This links our problem to the huge body of literature on PDPs, see Berbeglia et al. (2007) for an overview. Since we consider an on-demand service, our problem is also related to the literature on the dynamic pickup and delivery problems (DPDP) (see Berbeglia et al. (2010)). Our problem is also clos”
On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment (2017, background): “Whereas previous approaches to this problem have focused on heuristic-based solutions (16–18), we present a reactive anytime optimal algorithm.”
Dynamic ride-sharing and fleet sizing for a system of shared autonomous vehicles in Austin, Texas (2018, unknown): “12 13 REFERENCES 14 15 Agatz, N., A. Erera, M. Savelsbergh, and X. Wang (2011) Dynamic Ride-Sharing: A Simulation 16 Study in Metro Atlanta.”
50th Anniversary Invited Article - City Logistics: Challenges and Opportunities (2016, background): “, Hall and Qureshi (1997); Winter and Nittel (2006); Agatz et al. (2011, 2012); Furuhata et al. (2013); Stiglic et al.”
The benefits of meeting points in ride-sharing systems (2015, methodology): “Agatz et al. [2012] and Furuhata et al. [2013] provide an overview and di erent classi cations of the various types of ride-sharing systems encountered in practice. Important dimensions include the dynamics of the system and the number of riders and drivers that are involved in a ride-share match. T”
Dynamic ride-sharing and fleet sizing for a system of shared autonomous vehicles in Austin, Texas (2016, unknown): “Agatz et al. (2011) examined DRS by seeking to minimize total (system-wide) VMT and allowing a substantial 20-min departure-time window, dramatically improving ride-144 share matches.”
The Vehicle Routing Problem with Occasional Drivers (2016, background): “, Agatz et al. (2011), Agatz et al. (2012), and Lee and Savelsbergh (2015), where the ridesharing refers to a mode of transportation in which individual travelers share a vehicle for a trip and split travel costs such as gas, toll, and parking fees with others that have similar itineraries and time ”