期刊文献+

共享交通的时空轨迹检索与群体发现

Spatio-temporal trajectory retrieval and group discovery in shared transportation
下载PDF
导出
摘要 为解决共享交通下的共乘用户群体发现效率低、准确率不高问题,依据R-树原理建立Geo OD-Tree索引,并在此基础上提出以最大化共乘率为目标的群体发现策略。首先,对原始时空轨迹数据进行特征提取与标定处理,挖掘有效出行起讫点(OD)轨迹;其次,针对用户起讫点轨迹的特征,建立Geo OD-Tree索引进行有效的存储管理;最后,给出以最大化共乘行程为目标的群体发现模型,并运用K最近邻(KNN)查询对搜索空间剪枝压缩,提高群体发现效率。采用西安市近12 000辆出租车营运轨迹数据,选取动态时间规整(DTW)等典型算法与所提算法在查询效率与准确率上进行性能对比分析。与DTW算法相比,所提算法的准确率提高了10. 12%,查询效率提高了约15倍。实验结果表明提出的群体发现策略能有效提高共乘用户群体发现的准确率和效率,可有效提升共乘出行方式的出行率。 Concerning low efficiency and accuracy of the ridesharing user group discovery in shared transportation environment, a Geo OD-Tree index was established based on R-tree principle, and a group discovery strategy to maximize the multiplying rate was proposed. Firstly, the feature extraction and calibration processing of original spatio-temporal trajectory data was carried out to mine effective Origin-Destination( OD) trajectory. Secondly, a data structure termed Geo OD-Tree was established for effective storage management of OD trajectory. Finally, a group discovery model aiming at maximizing ridesharing travel was proposed, and a pruning strategy using by K Nearest Neighbors( KNN) query was introduced to improve the efficiency of group discovery. The proposed method was evaluated with extensive experiments on a real dataset of 12 000 taxis in Xi’an, in comparison experiments with Dynamic Time Warping( DTW) algorithm, the accuracy and efficiency of the proposed algorithm was increased by 10. 12% and 1 500% respectively. The experimental results show that the proposed group discovery strategy can effectively improve the accuracy and efficiency of ridesharing user group discovery, and it can effectively improve the rideshared travel rate.
作者 段宗涛 龚学辉 唐蕾 陈柘 DUAN Zongtao;GONG Xuehui;TANG Lei;CHEN Zhe(School of Information Technology,Chang'an University,Xi'an Shaanxi 710064,China)
出处 《计算机应用》 CSCD 北大核心 2019年第1期220-226,共7页 journal of Computer Applications
基金 陕西省重点科技创新团队项目(2017KCT-29) 陕西省工业科技攻关项目(2016GY078) 陕西省重点研发计划项目(2017GY-072)~~
关键词 共乘出行 群体发现 时空轨迹 3维R树 起讫点 ridesharing group discovery spatial-temporal trajectory 3-Dimensional R-tree(3DR-tree) Origin-Destination(OD)
  • 相关文献

参考文献2

二级参考文献29

  • 1Dantzig G B, Ramser J H. The truck dispatch problem[M]. Management Science, 1959, 6(1): 80-91.
  • 2Psaraftis H N. Dynamic vehicle routing problems[M]// Golden B L, Assad A A. Vehicle Routing: Methods and Studies, North-Holland, 1988:223-248.
  • 3Bertsimas D, Van Ryzin G. A stochastic and dynamic vehicle routing problem in the Euclidean plane[J]. Operations Research, 1991, 39(4): 601-615.
  • 4Bertsimas D, Van Ryzin G. Stochastic and dynamic vehicle routing problem in the Euclidean plane with multiple capacitated vehicles[J]. Operations Research, 1993, 41(1): 60-76.
  • 5Powell W B, Jaillet P, Odoni A R. Stochastic and dynamic networks and routing[M]//Ball M O, Magnanti T L, Monma C L, et al. Handbooks in Operations Research and Management Science, 8: Network Routing, Elsevier Science, Amsterdam, 1995: 141-295.
  • 6Psaraftis H N. Dynamic vehicle routing: Status and prospects[J]. Annals of Operations Research, 1995, 61: 143-164.
  • 7Gendreau M, Potvin J Y. Dynamic vehicle routing and dispatching[M]// Crainic T G, Laporte G. Fleet Man- agement and Logistics, Kluwer, Boston, 1998: 115-126.
  • 8Ghiani G, Guerriero F, Laporte G, et al. Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies[J]. European Journal of Operational Research, 2003, 151:1-11.
  • 9Pillac V, Gendreau M, Gueret C, et al. A review of dynamic vehicle routing problems[R]. CIRRELT, 2011, CIRRELT-2011-62.
  • 10Potvin J Y, Xu Y, Benyahia I. Vehicle routing and scheduling with dynamic travel times[J]. Computer & Operations Research, 2006, 33:1129-1137.

共引文献60

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部