论文标题

在随机拼车服务中预测驾驶员流量和乘客等待时间的贝叶斯分层模型

Bayesian hierarchical models for the prediction of the driver flow and passenger waiting times in a stochastic carpooling service

论文作者

Papoutsis, Panayotis, Michel, Bertrand, Philippe, Anne, Duong, Tarn

论文摘要

拼车是智能碳中性城市中不可或缺的组成部分,尤其是促进家庭作业通勤。我们研究了一项由初创企业ECOV开发的创新拼车服务,该服务专门从事郊区和农村地区的家庭作业通勤。当乘客提出拼车请求时,指定的驾驶员不会像传统的拼车服务中分配;相反,乘客正在等待第一个驾驶员,从已经在途中的非专业驾驶员人口到达。我们提出了一个两阶段的贝叶斯分层模型,以克服巨大的困难,这是因为从胚胎随机拼车服务中观察到的驱动器和乘客数据很少,以提供对驾驶员流量和乘客等候时间的高质量预测。第一阶段的重点是驾驶员流,其预测在每日水平上进行了汇总,以补偿数据稀疏性。第二阶段处理这个单一的每日驱动程序流入了乘客等待时间的亚日(例如每小时)预测。我们证明,我们的模型主要胜过频繁和非等级贝叶斯方法,用于在法国里昂的运营拼车服务中观察到的数据,我们还验证了我们在模拟数据上的模型。

Carpooling is an integral component in smart carbon-neutral cities, in particular to facilitate homework commuting. We study an innovative carpooling service developed by the start-up Ecov which specialises in homework commutes in peri-urban and rural regions. When a passenger makes a carpooling request, a designated driver is not assigned as in a traditional carpooling service; rather the passenger waits for the first driver, from a population of non-professional drivers who are already en route, to arrive. We propose a two-stage Bayesian hierarchical model to overcome the considerable difficulties, due to the sparsely observed driver and passenger data from an embryonic stochastic carpooling service, to deliver high-quality predictions of driver flow and passenger waiting times. The first stage focuses on the driver flow, whose predictions are aggregated at the daily level to compensate the data sparsity. The second stage processes this single daily driver flow into sub-daily (e.g. hourly) predictions of the passenger waiting times. We demonstrate that our model mostly outperforms frequentist and non-hierarchical Bayesian methods for observed data from operational carpooling service in Lyon, France and we also validated our model on simulated data.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源