拼车启发的旅行建议

S. Madria, San Yeung, Katrina Ward
{"title":"拼车启发的旅行建议","authors":"S. Madria, San Yeung, Katrina Ward","doi":"10.1109/MDM.2018.00019","DOIUrl":null,"url":null,"abstract":"The objective of this paper is to determine how ridesharing can help lowering the travel cost of a user who already has a preplanned trip. This problem is formulated as the Ridesharing-Inspired Trip Recommendation Query (RSTR). In the first phase of the proposed method, the trip of the query initializer is matched with other users. In the second phase, a heuristic-based algorithm is employed to generate a new trip recommendation. Experimental results showed that the proposed solution is comparable to the optimal solution and performs much better in run-time efficiency and scalability.","PeriodicalId":205319,"journal":{"name":"2018 19th IEEE International Conference on Mobile Data Management (MDM)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Ridesharing-Inspired Trip Recommendations\",\"authors\":\"S. Madria, San Yeung, Katrina Ward\",\"doi\":\"10.1109/MDM.2018.00019\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The objective of this paper is to determine how ridesharing can help lowering the travel cost of a user who already has a preplanned trip. This problem is formulated as the Ridesharing-Inspired Trip Recommendation Query (RSTR). In the first phase of the proposed method, the trip of the query initializer is matched with other users. In the second phase, a heuristic-based algorithm is employed to generate a new trip recommendation. Experimental results showed that the proposed solution is comparable to the optimal solution and performs much better in run-time efficiency and scalability.\",\"PeriodicalId\":205319,\"journal\":{\"name\":\"2018 19th IEEE International Conference on Mobile Data Management (MDM)\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 19th IEEE International Conference on Mobile Data Management (MDM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MDM.2018.00019\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 19th IEEE International Conference on Mobile Data Management (MDM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MDM.2018.00019","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

本文的目的是确定拼车如何帮助已经有预先计划旅行的用户降低旅行成本。这个问题被表述为拼车启发的旅行推荐查询(RSTR)。在建议的方法的第一阶段,查询初始化器的行程与其他用户匹配。第二阶段,采用启发式算法生成新的行程推荐。实验结果表明,该方案与最优方案相当,在运行效率和可扩展性方面都有明显提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Ridesharing-Inspired Trip Recommendations
The objective of this paper is to determine how ridesharing can help lowering the travel cost of a user who already has a preplanned trip. This problem is formulated as the Ridesharing-Inspired Trip Recommendation Query (RSTR). In the first phase of the proposed method, the trip of the query initializer is matched with other users. In the second phase, a heuristic-based algorithm is employed to generate a new trip recommendation. Experimental results showed that the proposed solution is comparable to the optimal solution and performs much better in run-time efficiency and scalability.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
FMS: Managing Crowdsourced Indoor Signals with the Fingerprint Management Studio Stochastic Shortest Path Finding in Path-Centric Uncertain Road Networks Concept for Evaluation of Techniques for Trajectory Distance Measures VIPTRA: Visualization and Interactive Processing on Big Trajectory Data DCount - A Probabilistic Algorithm for Accurately Disaggregating Building Occupant Counts into Room Counts
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1