Author:
Bujak Michal,Kucharski Rafal
Abstract
AbstractTravellers, when sharing their rides in a so-called ride-pooling system, form complex networks. Despite being the algorithmic backbone to the ride-pooling problems, the shareability graphs have not been explicitly analysed yet. Here, we formalise them, study their properties and analyse relations between topological properties and expected ride-pooling performance. We introduce and formalise two representations at the two crucial stages of pooling analysis. On the NYC dataset, we run two simulations with the link generation formulas. One is when we increase discount offered to the travellers for shared rides (our control variable) and observe the phase transition. In the second, we replicate the non-deterministic behaviour of travellers in ride-pooling. This way, we generate probabilistic, weighted networks. We observed a strong correlation between the topological properties of ride-pooling networks and the system performance. Introduced class of networks paves the road to applying the network science methods to a variety of ride-pooling problems, like virus spreading, optimal pricing or stability analysis.
Funder
National Science Centre in Poland
Publisher
Springer Science and Business Media LLC
Subject
Computer Science Applications,Human-Computer Interaction,Media Technology,Communication,Information Systems
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献