基于城市交通监控大数据的行程时间估计

李文明; 刘芳; 吕鹏; 于彦伟

doi:10.11959/j.issn.2096-0271.2021008

您当前的位置：

首页 >

文章列表页 >

基于城市交通监控大数据的行程时间估计

研究 | 更新时间：2024-06-03

- 基于城市交通监控大数据的行程时间估计
- Travel time estimation based on urban traffic surveillance data
- 大数据 2021年7卷第1期页码：2021008-1
- 作者机构：
  
  1. 烟台大学计算机与控制工程学院，山东烟台 264005
  2. 中国海洋大学计算机科学与技术系，山东青岛 266100
- 作者简介：
  
  [ "李文明（1997- ），男，烟台大学计算机与控制工程学院硕士生，主要研究方向为时空数据挖掘" ]
  [ "刘芳（1994- ），女，烟台大学计算机与控制工程学院硕士生，主要研究方向为局部异常检测" ]
  [ "吕鹏（1995- ），男，烟台大学计算机与控制工程学院硕士生，主要研究方向为高维数据异常检测" ]
  [ "于彦伟（1986- ），男，博士，中国海洋大学计算机科学与技术系副教授，中国计算机学会会员，主要研究方向为时空数据挖掘、机器学习、分布式计算" ]
- 基金信息：
  
  国家自然科学基金资助项目;The National Natural Science Foundation of China(61773331)
- DOI：10.11959/j.issn.2096-0271.2021008
  中图分类号： TP391
- 网络首发：2021-01，
  
  纸质出版：2021-01-15
- 稿件说明：
移动端阅览
李文明, 刘芳, 吕鹏, 等. 基于城市交通监控大数据的行程时间估计[J]. 大数据, 2021,7(1):2021008-1.

Wenming LI, Fang LIU, Peng LYU, et al. Travel time estimation based on urban traffic surveillance data[J]. Big Data Research, 2021, 7(1): 2021008-1.
李文明, 刘芳, 吕鹏, 等. 基于城市交通监控大数据的行程时间估计[J]. 大数据, 2021,7(1):2021008-1. DOI： 10.11959/j.issn.2096-0271.2021008.

Wenming LI, Fang LIU, Peng LYU, et al. Travel time estimation based on urban traffic surveillance data[J]. Big Data Research, 2021, 7(1): 2021008-1. DOI： 10.11959/j.issn.2096-0271.2021008.

摘要

随着智慧交通的发展，越来越多的监控摄像头被安装在城市道路路口，这使得利用城市交通监控大数据进行车辆行程时间估计和路径查询成为可能。针对城市出行的行程时间估计问题，提出一种基于城市交通监控大数据的行程时间估计方法UTSD。首先，将交通监控摄像头映射到城市路网，并根据交通监控数据记录构建有向加权的城市路网图；然后，针对行程时间估计，构建时空索引和反向索引结构，时空索引用于快速检索所有车辆的摄像头记录，反向索引用于快速获取每辆车辆的行程时间和经过的摄像头轨迹，这两个索引大大提升了数据查询和行程时间估计的效率；最后，基于构建的索引，给出一种有效的行程时间估计和路径查询方法，根据出发时间、出发地和目的地，在时空索引结构上匹配出发地与目的地共有的车辆，再利用反向索引，快速获得行程时间估计与车辆路线。使用某省会城市的真实交通监控大数据进行实验评估，所提方法UTSD的准确率比基于有向图的Dijkstra最短路径算法和百度算法分别提高了65.02%和40.94%，且UTSD在以7天监控数据作为历史数据的情况下，平均查询时间低于0.3 s，验证了所提方法的有效性和高效性。

Abstract

With the development of intelligent transportation

more and more surveillance cameras are deployed at the intersections of urban roads

which makes it possible to use the urban traffic surveillance data to estimate the vehicle travel time and query the route. Aiming at the problem of urban travel time estimation

a travel time estimation method based on the urban traffic surveillance data was proposed

which is called UTSD. Firstly

the traffic surveillance cameras were mapped into the urban road network

and a directed weighted urban road network graph was constructed based on traffic monitoring data recording. Secondly

a spatio-temporal index and a reverse index structure were built for travel time estimation

the former was used to quick search the camera records of all vehicles

and the latter was used to fast obtain the travel time and the passing camera trajectory of each vehicle. These two indexes significantly improved the efficiency of data query and travel time estimation. Finally

based on the constructed indexing structures

an effective travel time estimation and path query method was given. According to the departure time

origin and destination

the vehicles with the same origin and destination were matched on the spatio-temporal index structure

and then the reverse index was used to quickly obtain the travel time estimate and vehicle route. Using the real traffic monitoring big data of a provincial capital city for experimental evaluation

compared with Dijkstra shortest path algorithm based on directed graph and Baidu algorithm

the accuracy rate of the proposed method UTSD is improved by 65.02% and 40.94%

respectively. In addition

the average query time of UTSD is less than 0.3 s when the 7-day monitoring data is used as historical data

which verifies the effectiveness and efficiency of the proposed method.

关键词

Keywords

references

刘晓波 , 蒋阳升 , 唐优华 , 等 . 综合交通大数据应用技术的发展展望 [J ] . 大数据 , 2019 , 5 ( 3 ): 55 - 68 .

L IU X B , JIANG Y S , TANG Y H , et al . Development prospect of integrated transportation big data application technology [J ] . Big Data Research , 2019 , 5 ( 3 ): 55 - 68 .

WANG Y , ZHENG Y , XUE Y . Travel time estimation of a path using sparse trajectories [C ] // The 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining . New York:ACM Press , 2014 : 25 - 34 .

BECKMANN N , KRIEGEL H P , SCHNEIDER R , et al . The R*-tree: an efficient and robust access method for points and rectangles [C ] // The 1990 ACM SIGMOD International Conference on Management of Data . New York: ACM Press , 1990 : 322 - 331 .

ZHONG R C , LI G L , TAN K L , et al . G-tree: an efficient index for KNN search on road networks [C ] // The 22nd ACM International Conference on Information ＆amp;Knowledge Management . New York: ACM Press , 2013 : 39 - 48 .

KAMEL I , FALOUTSOS C . Hilbert R-tree:an improved R-tree using fractals [R ] . 1993 .

PFOSER D , JENSEN C S , THEODORIDIS Y . Novel approaches to the indexing of moving object trajectories [C ] // The 26th International Conference on Very Large Data Bases . [S.l.:s.n.] , 2000 : 395 - 406 .

TAO Y F , PAPADIAS D . Efficient historical R-trees [C ] // The 13th International Conference on Scientific and Statistical Database Management . Piscataway: IEEE Press , 2001 : 223 - 232 .

WANG L H , ZHENG Y , XIE X , et al . A flexible spatio-temporal indexing scheme for large-scale GPS track retrieval [C ] // The 9th International Conference on Mobile Data Management . Piscataway:IEEE Press , 2018 : 1 - 8 .

CHAKKA V P , EVERSPAUGH A C , PATEL J M . Indexing large trajectory data sets with SETI [C ] // The 2003 CIDR Conference . [S.l.:s.n.] , 2003 : 75 - 86 .

FINKEL R A , BENTLEY J L . Quad trees a data structure for retrieval on composite keys [J ] . Acta Informatica , 1974 , 4 ( 1 : 1 - 9 .

BENTLEY J L . Multidimensional binary search trees used for associative searching [J ] . Communications of the ACM , 1975 , 18 9 : 509 - 517 .

JENSEN C S , LIN D , OOI B C . Query and update efficient B+-tree based indexing of moving objects [C ] // The 30th International Conference on Very Large Data Bases . [S.l.:s.n.] , 2004 : 768 - 779 .

COMER D . Ubiquitous B-tree [J ] . ACM Computing Surveys , 1979 , 11 ( 2 ): 121 - 137 .

ZOBEL J , MOFFAT A , RAMAMOHANARAO K . Inverted files versus signature files for text indexing [J ] . ACM Transactions on Database Systems , 1998 , 23 ( 4 ): 453 - 490 .

WU C H , HO J M , LEE D T . Traveltime prediction with support vector regression [J ] . IEEE Transactions on Intelligent Transportation Systems , 2004 , 5 ( 4 ): 276 - 281 .

CHEN H , RAKHA H A , MCGHEE C C . Dynamic travel time prediction using pattern recognition [C ] // The 20th World Congress on Intelligent Transportation Systems . [S.l.:s.n.] , 2013 .

HOFLEITNER A , HERRING R , ABBEEL P , et al . Learning the dynamics of arterial traffic from probe data using a dynamic Bayesian network [J ] . IEEE Transactions on Intelligent Transportation Systems , 2012 , 13 ( 4 ): 1679 - 1693 .

ZHAN X Y , HASAN S , UKKUSURI S V , et al . Urban link travel time estimation using largescale taxi data with partial information [J ] . Transportation Research Part C: Emerging Technologies , 2013 , 33 : 37 - 49 .

ZHANG F M , ZHU X Y , HU T , et al . Urban link travel time prediction based on a gradient boosting method considering spatiotemporal correlations [J ] . ISPRS International Journal of Geo-Information , 2016 , 5 ( 11 ): 201 .

NIU X G , ZHU Y , ZHANG X N . DeepSense:a novel learning mechanism for traffic prediction with taxi GPS traces [C ] // 2014 IEEE Global Communications Conference . Piscataway: IEEE Press , 2014 : 2745 - 2750 .

RAHMANI M , JENELIUS E , KOUTSOPOULOS H N . Route travel time estimation using low-frequency floating car data [C ] // The 16th International IEEE Conference on Intelligent Transportation Systems (ITSC 2013) . Piscataway: IEEE Press , 2013 : 2292 - 2297 .

CHEN M , CHIEN S I J . Dynamic freeway travel-time prediction with probe vehicle data: link based versus path based [J ] . Transportation Research Record , 2001 , 1768 ( 1 ): 157 - 161 .

JIANG M Y , ZHAO T Q . Vehicle travel time estimation by sparse trajectories [C ] // 2019 IEEE 43rd Annual Computer Software and Applications Conference (COMPSAC) . Piscataway: IEEE Press , 2019 : 433 - 442 .

KINGMA D P , BA J . Adam: a method for stochastic optimization [J ] . arXiv preprint , 2014, arXiv:1412.6980. .

LI Y , GUNOPULOS D , LU C W , et al . Urban travel time prediction using a small number of GPS floating cars [C ] // The 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems . New York: ACM Press , 2017 : 1 - 10 .

WANG H J , TANG X F , KUO Y H , et al . A simple baseline for travel time estimation using large-scale trip data [J ] . ACM Transactions on Intelligent Systems and Technology , 2019 , 10 ( 2 ): 1 - 22 .

JIANG Y J , LI X , et al . Travel time prediction based on historical trajectory data [J ] . Annals of GIS , 2013 , 19 ( 1 ): 27 - 35 .

赖永炫 , 杨旭 , 曹琦 , 等 . 一种基于Gradient Boosting的公交车运行时长预测方法 [J ] . 大数据 , 2019 , 5 ( 5 ): 58 - 78 .

LAI Y X , YANG X , CAO Q , et al . A bus running length prediction method based on Gradient Boosting [J ] . Big Data Research , 2019 , 5 ( 5 ): 58 - 78 .

YUAN H T , LI G L , BAO Z F , et al . Effective travel time estimation: when historical trajectories over road networks matter [C ] // The 2020 ACM SIGMOD International Conference on Management of Data . New York: ACM Press , 2020 : 2135 - 2149 .

DING Y C , LI Y H , ZHOU X , et al . Sampl ing big trajectory data for traversal trajectory aggregate query [J ] . IEEE Transactions on Big Data , 2018 , 5 ( 4 ): 550 - 563 .

YUAN J , ZHENG Y , ZHANG C Y , et al . T-drive: driving directions based on taxi trajectories [C ] // The 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems . New York: ACM Press , 2010 : 99 - 108 .

HAKLAY M , WEBER P . OpenStreetMap:user-generated street maps [J ] . IEEE Pervasive Computing , 2008 , 7 ( 4 ): 12 - 18 .

LI Z H , WANG J J , HAN J W . Mining event periodicity from incomplete observations [C ] // The 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining . New York:ACM Press , 2012 : 444 - 452 .

LI Z H , WANG J J , HAN J W . ePeriodicity:mining event periodicity from incomplete observations [J ] . IEEE Transactions on Knowledge and Data Engineering , 2015 , 27 ( 5 ): 1219 - 1232 .

NOTO M , SATO H . A method for the shortest path search by extended Dijkstra algorithm [C ] // The 2000 IEEE International Conference on Systems, Man and Cybernetics . Piscataway: IEEE Press , 2000 : 2316 - 2320 .

浏览量

673

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

暂无数据