POP:以乘客为导向的伙伴匹配系统

Xiaoyi Duan, Cheqing Jin, Xiaoling Wang
{"title":"POP:以乘客为导向的伙伴匹配系统","authors":"Xiaoyi Duan, Cheqing Jin, Xiaoling Wang","doi":"10.1109/ICDEW.2015.7129560","DOIUrl":null,"url":null,"abstract":"Sharing one taxi by more than one person is treated promising, since it enables us to take a taxi in rush-hour more conveniently. Hence, we develop POP, a prototype system to find appropriate partners to share a taxi with a given passenger. The framework of POP includes two phases, namely offline preprocessing and online matching. During the offline preprocessing phase, it constructs an R-tree index for road network to speedup data access and computes average travel time for each road segment based on history trajectory data, while during the online matching, it tries to find appropriate partners to a given passenger which aims to save time as much as possible. We also propose a simple pricing method to allocate fee between passengers.","PeriodicalId":333151,"journal":{"name":"2015 31st IEEE International Conference on Data Engineering Workshops","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"POP: A Passenger-Oriented Partners matching system\",\"authors\":\"Xiaoyi Duan, Cheqing Jin, Xiaoling Wang\",\"doi\":\"10.1109/ICDEW.2015.7129560\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Sharing one taxi by more than one person is treated promising, since it enables us to take a taxi in rush-hour more conveniently. Hence, we develop POP, a prototype system to find appropriate partners to share a taxi with a given passenger. The framework of POP includes two phases, namely offline preprocessing and online matching. During the offline preprocessing phase, it constructs an R-tree index for road network to speedup data access and computes average travel time for each road segment based on history trajectory data, while during the online matching, it tries to find appropriate partners to a given passenger which aims to save time as much as possible. We also propose a simple pricing method to allocate fee between passengers.\",\"PeriodicalId\":333151,\"journal\":{\"name\":\"2015 31st IEEE International Conference on Data Engineering Workshops\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-04-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 31st IEEE International Conference on Data Engineering Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDEW.2015.7129560\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 31st IEEE International Conference on Data Engineering Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDEW.2015.7129560","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

多人合用一辆出租车是很有前途的,因为这样我们可以在高峰时间更方便地乘坐出租车。因此,我们开发了POP,这是一个原型系统,用于寻找合适的合作伙伴与给定的乘客共享出租车。POP的框架包括离线预处理和在线匹配两个阶段。在离线预处理阶段,构建路网r树索引,加快数据访问速度,并根据历史轨迹数据计算每段道路的平均出行时间;在在线匹配阶段,为给定的乘客寻找合适的伙伴,尽可能节省时间。我们还提出了一种简单的定价方法来分配乘客之间的费用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
POP: A Passenger-Oriented Partners matching system
Sharing one taxi by more than one person is treated promising, since it enables us to take a taxi in rush-hour more conveniently. Hence, we develop POP, a prototype system to find appropriate partners to share a taxi with a given passenger. The framework of POP includes two phases, namely offline preprocessing and online matching. During the offline preprocessing phase, it constructs an R-tree index for road network to speedup data access and computes average travel time for each road segment based on history trajectory data, while during the online matching, it tries to find appropriate partners to a given passenger which aims to save time as much as possible. We also propose a simple pricing method to allocate fee between passengers.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信