Dresden 2020 – wissenschaftliches Programm
Die DPG-Frühjahrstagung in Dresden musste abgesagt werden! Lesen Sie mehr ...
SOE 17.4: Vortrag
Donnerstag, 19. März 2020, 16:45–17:00, GÖR 226
How efficient is ridesharing? — •Robin Maximilian Zech, Nora Molkenthin, Marc Timme, and Malte Schröder — Chair for Network Dynamics, Institute for Theoretical Physics and Center for Advancing Electronics Dresden (cfaed), TU Dresden
Ride-sharing may substantially contribute to make future mobility flexible, fair and sustainable. Recent work (Molkenthin et al., arXiv:1908.05929) proposed a generic measure of ride-sharing efficiency that is based on the intrinsic ride-sharing dynamics and follows a universal scaling law across network topologies. Here we ask how limited passenger capacity of ride sharing vehicles (busses) alters this universality. Using queueing theory, we present an analytic solution to a minimal model with requests served on a two node graph. For more complex street networks, we compute an effective number of busses by considering the probability of one bus having to delay a request due to capacity constraints. We find that for large numbers of busses and a suitably redefined topological factor, universality extends to finite capacity systems.