arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2307.05697cs.IRcs.LG
收藏

一种用于动态和个性化拼车服务的机器学习排序算法

A Machine-Learned Ranking Algorithm for Dynamic and Personalised Car Pooling Services

IIT-CNR(意大利国家研究委员会信息学与电信研究所)

Mattia Giovanni Campana, Franca Delmastro, Raffaele Bruno

AI总结:

本文提出 GoTogether 拼车推荐系统,利用排序学习从用户接受或拒绝共享出行的历史中构建个性化排序模型,并基于 Twitter 与 Foursquare 数据验证其在静态和动态场景下均可快速准确预测用户选择。

摘要:

拼车有望通过让驾驶员与行程路线和时间安排相似的出行者共享车辆,显著帮助缓解城市交通拥堵并减少污染。为了在给定的驾驶员和潜在乘客集合中高效找到成功的出行匹配,人们已经设计了许多拼车匹配服务。然而,现在人们认识到,除了简单的出行需求之外,许多非货币因素和社会考量也可能影响个人共享出行的意愿,而这些因素难以预测。为了解决这一问题,本研究提出了 GoTogether,这是一种面向拼车服务的推荐系统,利用 learning-to-rank(排序学习)技术,根据每位用户的选择历史(即其接受或拒绝的共享出行类型)自动推导其个性化排序模型。随后,GoTogether 会构建推荐出行列表,以最大化所提供匹配的成功率。为测试该方案的性能,我们使用来自 Twitter 和 Foursquare 来源的真实数据,生成一个包含大都市区域内合理出行模式和出行请求的数据集。结果表明,所提出的解决方案在静态和动态条件下均能快速获得对个性化用户选择模型的准确预测。

英文摘要:

Car pooling is expected to significantly help in reducing traffic congestion and pollution in cities by enabling drivers to share their cars with travellers with similar itineraries and time schedules. A number of car pooling matching services have been designed in order to efficiently find successful ride matches in a given pool of drivers and potential passengers. However, it is now recognised that many non-monetary aspects and social considerations, besides simple mobility needs, may influence the individual willingness of sharing a ride, which are difficult to predict. To address this problem, in this study we propose GoTogether, a recommender system for car pooling services that leverages on learning-to-rank techniques to automatically derive the personalised ranking model of each user from the history of her choices (i.e., the type of accepted or rejected shared rides). Then, GoTogether builds the list of recommended rides in order to maximise the success rate of the offered matches. To test the performance of our scheme we use real data from Twitter and Foursquare sources in order to generate a dataset of plausible mobility patterns and ride requests in a metropolitan area. The results show that the proposed solution quickly obtain an accurate prediction of the personalised user's choice model both in static and dynamic conditions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑