基于非参数回归的短时交通流量预测方法研究
详细信息    本馆镜像全文|  推荐本文 |  |   获取CNKI官网全文
摘要
短时交通流量预测是智能交通系统(ITS)的关键技术之一,其预测性能的好坏、是否满足实时性要求都直接关系到交通控制与诱导系统的有效实现。
     本文从分析短时交通流特性入手,从归纳-演绎、非线性时变系统两个角度认识非参数回归方法,从原理上阐明应用非参数回归方法进行短时流量预测的适用性。讨论了应用非参数回归方法的关键步骤和影响因素。
     非参数回归方法作为一种新型的智能方法,仍然存在诸多缺点限制了它的实际应用。这些缺点集中在:样本数据库结构不合理、搜索策略效率不高、系统开环等。本文从研究这些缺陷入手,对该方法本身进行多方面的改进,使其提高预测准确度和满足实时性要求。
     主要的改进包括:(1)将原始流量数据和搜索数据分别存放,建立基于一维和多维数据搜索的数据库结构和搜索策略。平衡二叉树和R树的逻辑结构和静态链表的物理结构的应用大幅度地缩减了数据搜索所需时间,提高了预测的实时性。(2)将闭环反馈回路加入到预测系统中最关键的步骤――模式匹配中,通过预测误差来修正模式匹配结果,从而使模式匹配过程更加合理,提高了预测的准确度。(3)分析影响非参数回归预测鲁棒性的因素,重点在于系统需要重建时,针对大量原始数据的收集和实时预测这一对矛盾,提出应用系数库和分批预测的思想加以解决。
     由于原始流量数据不具备非参数回归方法所需的中心点和中心点附近的K个近邻点,同时考虑到原始流量数据具有维数高、冗余量大的特点,因此有必要对原始数据进行数据预处理操作。在本文中,采用主成分分析达到降维和消除变量之间相关性的目的。采用聚类分析剔除冗余数据,并且得到数据中心点和近邻点。
     应用交通仿真软件对典型路网结构进行仿真,得到在各种仿真条件下的流量数据。对于创建数据库所需的数据,也就是仿真过的路网结构的流量模式,采用较大跨度的参数设置,得到各种流量模式的边缘状态;而对于检验过程所需的数据,采用较小跨度的参数设置,这样更有利于研究模式的演变状态。重点对于数据库的两种数据结构在预测准确度和预测所需时间上进行比较。结果表明,一维搜索结果优于多维结构。
Short-term traffic volume forecasting is one of key technologies of the Intelligent Transport Systems (ITS). Perfect performance of forecasting and meeting real-time requirement concern the effective realizations of traffic control and transportation induction system.
     Based on the analysis of the properties of traffic flows, this dissertation begins to recognize Non-Parametric Regression (NPR) from two different angles: deductive-inductive method and theories about non-linear time-variant system. NPR is suitable for short-term traffic volume forecasting theoretically. The main steps and influencing factors are discussed in applying NPR.
     NPR as a new intelligent method has many shortcomings restricting its applications which focus on: ill-suited database structure, low searching efficiency, open loop structure etc. This dissertation improves the method to advance forecasting accuracy and meet real-time requirement.
     The main improvements include:
     (1) The original volumes and searching data are separated to be stored in two databases. The databases are based on unidimensional and multi-dimensional structures and searching strategies. The applications of balanced binary tree and R tree as logistic structures, static chain as physical structure reduce the searching time and meet the real-time requirement.
     (2) A closed feedback loop is added upon the most important step--pattern matching. The matching results are amended by forecasting errors to improve forecasting accuracy.
     (3) Analysis the factors of NPR affecting robustness and focus on the contradiction between the collection of original data and real-time forecasting when rebuilding the system. The coefficient database and the idea of batch forecasting are put forward to solve the problem.
     NPR needs the data centers and K nearest neighbors round every center. But the original data does not possess these. Furthermore, it has features of high- dimensions and large superfluous data. So the pretreatment operations to original data are necessary. In this dissertation principal component analysis is adopted to bring down input variable dimensions and eliminate the relativities among them. Superfluous data is rejected by cluster analysis.
     Typical road network is simulated by traffic simulation software and the volumes data is gotten by all kind of simulation conditions. To the data for creating database, represented by volume modes with which the network has been simulated, the simulation parameters are set by large spans to get the marginal states of volumes. To the data for testing, the simulation parameters are set by small spans to study the mode evolutions. The experiments are focused on the comparisons of the two data structures at the respects of forecasting accuracy and time consumption. The comparison results show that the unidimensional structure is superior to multidimensional one.
引文
[1]贺国光ITS系统工程导论中国铁道出版社2004-12
    [2] He Guoguang, Hartmut Keller.A new Concept of Control Strategy for UTCS based on Intelligent Control.Proceedings of 4th World Congress on Intelligent Transportation System,Oct. 1997,Berlin,Germany
    [3]刘志勇.智能交通控制理论及其应用.北京:科学出版社.2003.5
    [4] John Rise and Erik Van Zwet. A Simple and Effective Method for Predicting Travel Time on Freeways.IEEE Intelligent Transportation Systems Conference Proceedings.2001
    [5] Zhang X and Rice JA.Short-term Travel Time Prediction. Transportation Research C.2003,11(3):187~210
    [6]贺国光,徐岩宇.车辆线路引导系统的行驶时间预测模型研究.中国公路学报. 1998,11(3):79~86
    [7]徐岩宇,贺国光.车辆线路引导系统的行驶时间预测算法研究.公路交通科技. 1998,15(2):24~27
    [8]邵春福,张魁麟,谷远利.基于实时数据的网状城市快速路行驶时间预测方法研究.土木工程学报。2003,36(1):16~20
    [9]韩超,宋苏,王成红.基于ARIMA模型的短时交通流实时自适应预测.系统仿真学报.2004,16(7):1530~1535
    [10] Iwao Okutani. Dynamic Prediction of Traffic Volume Through Kalman Filtering Theory. Transportation Research C. 1984:1~11
    [11]杨兆升,朱中.基于卡尔曼滤波理论的交通流量实时预测模型.中国公路学报. 1999,12(3):63~67
    [12]朱中,杨兆升.基于卡尔曼滤波理论的实时行程时间预测模型.系统工程理论与实践.1999,9:74~78
    [13] Smith BL and Demetsky. Short-Term Traffic Flow Prediction: Neural Network Approach[j]. Transportation Research Record. 1994,1453:98~104
    [14] Zhu Zhong and Yang Zhaosheng. Dynamic Prediction of Traffic Flow By Using Backpropagation.1995,NSFC
    [15] Doughertty MS and Cobbett MR.Short-term Inter-Urban Traffic Forecasting using Neural Networks, International Journal of Forecasting.1997,Volume13:21-31
    [16] Huang SH and Ran Bin.An A Application of Neural Network on Traffic Speed Prediction Under Adverse Weather Condition. Transportation Research Board. Meeting,2003
    [17] Ulbricht C. ulti-Recurrent Networks for Traffic Forecasting .National Conference on Artificial Intelligence Proceedings,Vol.2.1994:883~888
    [18] Van Lint JWC,Hoogendoorn SP,van Zuylen HJ. Freeway Travel Time Prediction with State-space Neural Networks:Modeling State-space Dynamics with Recurrent Neural Networks[j].Transportation Research Record.2002,(1811):30~39
    [19] Park B,MesserC J, and Urbanik T.Short-term Freeway Traffic Volume Forecasting using Radial Basis Function Neural Network. Transportation Research Board,Washington D.C.1998,1651:39~47
    [20] Cheu R-L. Freeway Traffic Prediction using Neural Networks, Fifth International Conference on Applications of Advanced Technologies in Transportation Engineering .1998:247~254
    [21] Park D,Rilett LR,Han G.Forecasting Multiple-period Freeway Link Trval Times using Neural Networks with Expanded Input Nodes. Fifth International Conference on Applications of Advanced Technologies in Transportation Engineering.1998:325~332
    [22] Park D and L Rilett.Forecasting Multiple-period Freeway Link Travel Times Using Modular Neural Networks,Transportation Research Record.1998,1617:163~170
    [23]谭国真,丁浩广义神经网络的研究及其在交通流预测中的应用控制与决策2002,17(增刊):777~780
    [24]徐启华,丁兆奎,毕训银一种基于动态递归神经网络的交通流量实时预测方法淮海工学院学报2003,12(4):14~17
    [25]况爱武,黄中祥基于RBF神经网络的短时交通流预测系统工程2004,22(2):63~65
    [26]杨世坚,贺国光基于模糊C均值聚类和神经网络的短时交通流预测方法系统工程2004,22(8):83~86
    [27] Smith BL and Demetsky MJ. Short-term Traffic Flow Prediction Models:A Comparison of Neural Network and Nonparametric Regression Approaches. International Conference on System,Man and Cybernetics. Humans,Information and Technoloyy. 1994,2:1706~1717
    [28] Smith BL and Demetsky MJ. Multiple-interval Freeway Traffic Flow Forecasting. Transportation Research Record.1996,1554:136~141
    [29] Smith BL,Oswald RK. Effects of Rarameter Selection on Forecast Accuracy and Execution Time in Nonparametric Regression. IEEE Intelligent Transportation Systems Conference Proceedings.2000
    [30] Oswald RK, Scherer WT, and Smith BL. Traffic Flow Forecasting Using Approximate Nearest Neighbor Nonparametric Regression. Research Report for the National ITS Implementation Reaearch Center.N.UVACTS-15-13-7,2001
    [31] Smith BL,Oswald RK. Comparison of Parametric and Nonparametric Models for Traffic Flow Forecasting. Transportation Researh C.2002,10(4):303~321
    [32] Clark s. Traffic Prediction using Multivariate Nonparametric Regression.Journal of Transportation Engineering.2003,129(2):161~168
    [33]宫晓燕,汤淑明.基于非参数回归的短时交通流预测与实践检测综合算法.中国公路学报.2003,16(1):82~86
    [34] Abdulhai B,Porwal H, and Recker. WW. Short Term Freeway Traffic Flow Prediction Using Genetcally Optimized Time-delay-based Neural Networks. Irvine: University of California,Irvine.1998
    [35] Abdulhai B,Porwal H,and Pecker. Short-term Traffic Flow Prediction using Neural-Genetic Algorithms. ITS Journal.2002,7(1):3~41
    [36] Matsui H and Fujita M. Travel Time Prediction for Freeway Traffic Information by Neural Network Driven Fuzzy Reasoning. Neural Networks in Transport Application[C]. Brookfield:Ashgate Publishing Company.1998:335~364
    [37]初连禹,杨兆升.基于模糊神经网络的实时路段行程时间估计.系统工程理论与实践. 2000,11:111~116
    [38] Yin H,Wong SC,Xu J,and Wong CK. Urban Traffic Flow Prediction using a Fuzzy-Neural Approach. Transportation Research(Part C). 2002,10(2):85~98
    [39]贺国光,马寿峰,李宇.基于小波分解与重构的交通流短时预测法.系统工程理论与实践,2002,22(9):101~106
    [40]李存军,杨儒贵,张家树基于小波分析的交通流量预测方法计算机应用2003,12
    [41] Davis Gary A and Nihan Nancy L. Nonparameteric Regression and Short-term Freeway Traffic Forecasting. Journal of Transportation Engineering. 1991,117(2):178~188
    [42]王进,史其信短期交通流预测模型和方法研究清华大学博士学位论文2005,4
    [43]张守一,葛新权,王斌非参数回归及其应用数量经济技术经济研究1997,10
    [44] Brian L.Smith R.Keith Oswald. Effects of Parameter Selection on Forecast Accuracy and Execution Time in Nonparametric Regression 2000 IEEE intelligent Transportation Systems Conference Proceedings October 1-3,2000
    [45] Ganede V., Gunther O. Multidimensional access methods. ACM Computing Surveys,1996,30(2):170~231
    [46] Sellis T.K, Roussopoulos N., Faloutsos C. Multidimensional access methods: Trees have grown everywhere. In: proceedings of the 23rd VLDB, Althens, Greens, 1997,13~14
    [47] Ahn H,K., Mamoulis N,, Wong H.M. A survey on multidimensional access methods. UU-CS, Utrecht, The Netherlands: Technical Report 2001-14,2001
    [48] Lu Hongjun, Ooi Beng Chin. Spatial indexing: past and future. IEEE Data Engineering Bulletin, 1993, 16(3):16~21)
    [49]Faloutsos C., Roseman S. Fractals for Secondary key retrieval. In: proceedings of the 8th PODS, Philadelphia, Pennsylvania, 1989, 247~252
    [50]陆锋,周成虎一种基于Hibert排列码的GIS空间索引方法计算机辅助设计与图形学学报,2001,13(5): 424~429)
    [51] Sellis T.K, Roussopoulos N,, Faloutsos C. The R+ Tree: A dynamic index for multi-dimensional objects. In: proceedings of the 13th VLDB, Brighton England, 1987,505~518
    [52] Gunther O. Efficient Structures for Geometric Data Management. New York: Springer-Verlag, 1988
    [53] Gunther O. The design of the cell tree: A object-oriented index structure for geometric databases. In: proceedings of ICDE, Los Angeles, CA, 1989,598~605)
    [54] Gargantint I. An effective way to represent quadtrees. Communications of the ACM, 1982, 25(12): 905~910
    [55] Samet H. The Desigh and Analysis of Spatial Data Structures. Reading, MA: Addison-Wesley, 1990
    [56] Guttman A. R-tree: Adynamic index structure for spatial searching. In: proceedings of ACM SIGMOD, Boston, MA, 1984,47~57
    [57] Beckmann N,, Kriegel H.P., Schneider R. , Seeger B. The R*-tree: An efficient and robust access method for points and rectangles. In: proceedings of SIGMOD, Atlantic City, New Jersey, 1990, 322~331
    [58]杨薇薇张胜利荫贤亮数据结构[M].高等教育出版社,2004
    [59]袁方杨柳张红霞基于k-近邻方法的渐进式中文文本分类技术华南理工大学学报(自然科学版), 2004,S1
    [60]刘宇朱仲英施颂椒空间k近邻查询的新策略上海交通大学学报, 2001年09期
    [61]吴丽娟郑冕张彩明海量空间数据点k近邻的快速搜索算法小型微型计算机系统, 2007,1
    [62]Jim Z.C. Lai, Yi-Ching Liaw, Julie Liu Fast K-nearest-neighbor search based on projection and triangular inequality Pattern Recognition 40(2007)351~359
    [63]廖巍吴秋云基于扩展时空距离度量的连续k近邻查询方法国防科技大学学报,2007,1
    [64]湛燕K-近邻、K-均值及其在文本分类中的应用河北大学硕士学位论文2004,02
    [65] Jun Zhang,Nikos Mamoulis,Dimitris Papadias,All-Nearest-Neighbors Queries in Spatial Databases,Proceedings of the 16th International Conference on Scientific and Statistical Database Management,2004 IEEE
    [66] Agrawal R, Faloutsos C, Swami A. Efficient similarity search in sequence database [A]. In: Proceedings of the 4th Conference on Foundations of Data Organization and Algorithms, Chicago, 1993. 69~84
    [67] Rafiei D, Mendelzon A. Efficient retrieval of similar time sequences using DFT [A]. In: Proceedings of the 5th International Conference on Foundations of Data Organizations and Algorithms, Kobe, 1998,249~257
    [68] Das G, Link, Mannila H, et al. Rule discovery from time series[A]. In: Proceedings of the 4th International Conference of Knowledge Discovery and Data Mining, New York, 1998. 16~22
    [69] R.A Finkel, J.L Bentley, Quad Trees– A Data Structure for Retrieval on Composite Keys, Acta Informatics 4(1974), 1-9
    [70] J.L Bentley, D.F Stanat, E.H Wilhams, The complexity of fixed radius near neighbor searching, Inf Porc Lett 6,6 (December 1977), 209-212
    [71] A Guttman, M Stone braker, Using a Relational Database Management System for Computer Aided Design Data, IEEE Database Engineering 5,2(June 1982)
    [72] J T Robmson, The K-D-B Tree A Search Structure for Large Multl-dimensional Dynamic Indexes, ACM SIGMOD Conference Proc , April 1981, l0-18
    [73] Gaede V. , Gunther O. Multidimensional access methods. ACM Computing Surveys , 1998 , 30 (2) : 170~231
    [74] Ahn H. K, Mamoulis N, Wong H. M A survey on multidimensional access method. UU-CS , Utrecht , The Netherlands : Technical Report 2001-14 , 2001
    [75] Lu Hongjun , Ooi Beng Chin. Spatial indexing: Past and future. IEEE Data Engineering Bulletin , 1993 , 16 (3) : 16~21
    [76] Guttman A. R-Trees: A dynamic index structure for spatial searching(C)P roc. ACM SIGMOD Conf, Ann. Meeting, 1984, 47~57
    [77]张志兵王元珍李华,基于R-Tree的空间查询代价模型研究,小型微型计算机系统,24(6),2003,6
    [78] N. Beckmann, H.P. Kriegel, R. Schneider, B.Seeger, The R*-tree: an Efficient and Robust Access Method for Points and Rectangles, SIGMOD, 1990
    [79]张明波,陆锋,申排伟R树家族的演变和发展,计算机学报,28(3),2005,3
    [80]刘振鹏,张晓莉,郝杰数据结构北京:中国铁道出版社,2003
    [81] N. Roussopoulos, F. Kelley, F. Vincent, Nearest Neighbor Queries, SIGMOD, 1995
    [82]郑玉明,廖湖声,陈镇虎空间数据库引擎的R树索引,计算机工程,30(5),2004,3
    [83] G. Hjaltason, H. Samet, Incremental Distance Join Algorithms for Spatial Databases, SIGMOD,1998.
    [84] Zhang Chi. (1997) Design and Accomplishment of Computer Microscopic Simulation System for Urban Traffic Flow. Tianjin University M.S. Dissertation.
    [85]丹尼尔. L.鸠洛夫等,交通流理论,北京:人民交通出版社,1983
    [86]马寿峰智能交通系统控制与诱导问题的研究:[博士学位论文],天津;天津大学,1999
    [87]黄宁关于主成分分析应用的思考数理统计与管理1999,5
    [88] Slowinski R. Rough set reasoning about uncertain data .Fundamental Information. 1996, 27(2,3) :229-243
    [89]韩祯祥,张琪粗糙集理论及其应用综述控制理论与应用1999,2
    [90]陈奇南,梁洪峻模糊集和粗糙集计算机工程2002,8
    [91]王晓丹,王积勤支持向量机训练和实现算法综述计算机工程与应用2004,13
    [92]董春曦,饶鲜等支持向量机参数选择方法研究系统工程与电子技术2004,8
    [93] Hsu C W, Lin C J. A comparison of methods for multi-class support vector machines .IEEE Trans on Neural Networks. 2002, 13(2) :415~425 .
    [94] Richard A. Johnson, Dean W. Wichern. Applied Multivariate Statistical Analysis [M]. Person Prentice Hall 2001.4:347~348
    [95]何晓群编著回归分析与经济数据建模[M]北京中国人民大学出版社,1997. 5 :321 ~354
    [96] NgR T, Han J. Efficient and effective clustering methods for spatial data mining. In: Proc of the 20th VLDB Conf. Santiago: Morgan Kaufmann, 1994. 144~155
    [97] Guha S. CURE: An efficient clustering algorithm for large databases. In: Proc of the ACM SIGMOD Int’l Conf on Management of Data. Seattle: ACM Press, 1998. 73~84
    [98] Zhang W. STING: A statistical information grid approach to spatial data mining. In: P roc of the 23rd VLDB Conf. Athens: Morgan Kaufmann, 1997. 186~195
    [99] A grawal R et al. Automatic subspace clustering of high dimensional data for data mining applications. In: Proc of the ACM SIGMOD Int’l Conf on Management of Data. Seattle: ACM Press, 1998. 73~84
    [100]吴雪琴DBSCAN算法研究软件导刊2007,4
    [101]周水庚,周傲英,曹晶基于数据分区的DBSCAN算法计算机研究与发展2000,37(10)
    [102]周水庚周傲英曹晶胡运发一种基于密度的快速聚类算法计算机研究与发展2000,37(11)
    [103]楼顺天基于MATLAB的系统分析与设计--模糊系统[M].西安电子科技大学出版社,2001
    [104]马帅,王腾蛟等一种基于参考点和密度的快速聚类算法软件学报2003,6
    [105]贺玲,吴玲达,蔡益朝数据挖掘中的聚类算法综述计算机应用研究2007,1

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700