{"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}
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.