论文标题
探索概率乘车问题的共享性网络
Exploring shareability networks of probabilistic ride-pooling problems
论文作者
论文摘要
在乘车系统中共享乘车的旅行者形成了各种网络。尽管所谓的共享性图的概念一直是许多乘车算法的核心，但到目前为止，尚未明确分析它们。在这里，我们介绍并检查了乘车问题引起的四种网络。我们使用2016年的147个纽约市出租车请求与我们的基于公用事业的Exmas算法合并为有吸引力的共享乘车，并探索了由此产生的共享性网络。为了涵盖合并旅行者的未知单个特性，我们运行了1000个概率合并过程的复制，从而使加权图的更丰富表示有助于揭示复杂的网络结构。我们的发现揭示了网络结构和拓扑之间的实质性差异。可以进一步分析乘车网络的属性，以更好地理解和改善乘车系统。
Travellers sharing rides in ride-pooling systems form various kinds of networks. While the notions of the so-called shareability graphs, has been in the core of many ride-pooling algorithms, so far they have not been explicitly analysed. Here, we introduce and examine four kinds of networks resulting from ride-pooling problems. We use 147 NYC taxi requests from 2016 pooled into attractive shared-rides with our utility based ExMAS algorithm and explore resulting shareability networks. To cover unknown individual properties of pooling travellers, we run 1000 replications of probabilistic pooling process, resulting in richer representation of weighted graphs instrumental to reveal complex network structures. Our findings reveal substantial differences between network structures and topologies. Properties of ride-pooling networks may be further analysed to better understand and improve ride-pooling systems.
