{"title":"城市出租车乘客热点搜索算法","authors":"Yuhan Dong, Siyuan Qian, Kai Zhang, Yongzhi Zhai","doi":"10.1109/SNPD.2017.8022719","DOIUrl":null,"url":null,"abstract":"Passenger hotspots searching is essential to increase profits for taxis drivers in urban area. In this paper, we propose a two-step approach for pick-up hotspots searching. In the first step, a traveling similarity model is built to quantify the similarity of traveling behaviors. In the second step, we utilize affinity propagation and simulated annealing to identify the daily passenger hotspots in a selected period. Numerical results based on GPS data of Manhattan taxis suggest that the proposed approach outperforms the traditional spatio-temporal clustering regardless of buffer radius.","PeriodicalId":186094,"journal":{"name":"2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"34 2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"A novel passenger hotspots searching algorithm for taxis in urban area\",\"authors\":\"Yuhan Dong, Siyuan Qian, Kai Zhang, Yongzhi Zhai\",\"doi\":\"10.1109/SNPD.2017.8022719\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Passenger hotspots searching is essential to increase profits for taxis drivers in urban area. In this paper, we propose a two-step approach for pick-up hotspots searching. In the first step, a traveling similarity model is built to quantify the similarity of traveling behaviors. In the second step, we utilize affinity propagation and simulated annealing to identify the daily passenger hotspots in a selected period. Numerical results based on GPS data of Manhattan taxis suggest that the proposed approach outperforms the traditional spatio-temporal clustering regardless of buffer radius.\",\"PeriodicalId\":186094,\"journal\":{\"name\":\"2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)\",\"volume\":\"34 2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SNPD.2017.8022719\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 18th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SNPD.2017.8022719","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A novel passenger hotspots searching algorithm for taxis in urban area
Passenger hotspots searching is essential to increase profits for taxis drivers in urban area. In this paper, we propose a two-step approach for pick-up hotspots searching. In the first step, a traveling similarity model is built to quantify the similarity of traveling behaviors. In the second step, we utilize affinity propagation and simulated annealing to identify the daily passenger hotspots in a selected period. Numerical results based on GPS data of Manhattan taxis suggest that the proposed approach outperforms the traditional spatio-temporal clustering regardless of buffer radius.