大规模在线P2P拼车中的请求预测
Predicting Requests in Large-Scale Online P2P Ridesharing
摘要:
点对点共享(P2P-RS)使人们能够用自己的私家车安排一次性乘车,而无需专业司机的参与。这是一个突出的集体智慧应用,为个人(降低成本)和整个社区(减少污染和交通)带来了显著的好处,正如我们在最近的出版物中所展示的那样,我们提出了一个大规模P2P-RS的在线近似解决方案算法。在本文中,我们解决了在P2P-RS优化的背景下评估预测拼车请求的好处的基本问题。在一个公开的现实世界中的结果表明,通过采用一个完美的预测器,总奖励可以提高5.27%,预测范围为1分钟。另一方面,一个普通的长短期记忆神经网络无法在简单复制前一天请求的基线预测器上进行改进,同时实现几乎两倍的准确性。
英文摘要:
Peer-to-peer ridesharing (P2P-RS) enables people to arrange one-time rides with their own private cars, without the involvement of professional drivers. It is a prominent collective intelligence application producing significant benefits both for individuals (reduced costs) and for the entire community (reduced pollution and traffic), as we showed in a recent publication where we proposed an online approximate solution algorithm for large-scale P2P-RS. In this paper we tackle the fundamental question of assessing the benefit of predicting ridesharing requests in the context of P2P-RS optimisation. Results on a public real-world show that, by employing a perfect predictor, the total reward can be improved by 5.27% with a forecast horizon of 1 minute. On the other hand, a vanilla long short-term memory neural network cannot improve upon a baseline predictor that simply replicates the previous day's requests, whilst achieving an almost-double accuracy.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。