交通约束下的行车最优路径规划
|
摘要
路径规划是车辆导航系统的核心组成部分，随着我国地理信息数据的不断增加以及汽车保有量的迅速提高，国内交通复杂程度不断增大，驾驶员的个性化需求也越来越多，因此开发适应交通约束下的路径规划算法以满足车载导航系统的需求已成为一项亟待解决的问题。针对以上问题，文中提出了带交通预测的最优路径规划算法，区域约束下的通过性路径规划算法以及特殊路网约束下的目标引导算法。
首先建立了浮动车样本量计算模型，验证当前浮动车数量是否满足动态路径规划的需求。在精度满足要求的情况下，应用阈值控制算法对接收的动态交通信息进行过滤，同时使用加权平均及指数平滑的方法对缺失数据进行补全，在此基础上结合路网拓扑特性用相邻路段数据补全缺失数据，最后应用主成分重建的方法对噪声数据进行修复。对修复后的交通数据采用聚类分析算法建立匹配模板，并利用多因子模式匹配和预测误差的自适应校正方法对交通数据进行短期预测，从而建立城市道路交通模型，使基于预测的时间最优路径规划成为可能。
带交通预测的最优路径规划在原有静态路径规划的基础上考虑动态交通信息的约束，使驾驶员避开拥堵走最佳行驶路线。为实现动态交通数据的快速读取和更新，文中建立了动态交通数据库，为电子地图的动态更新提供快捷的底层支持。带交通预测的最优路径规划利用城市路网交通模型计算节点通行代价，并考虑车辆在路口的等待时间，实现了平面路网下的动态路径规划。
通过性寻路提出了一种新的路径规划方法，可以由用户根据自己的趋好选择通过区域，实现了区域约束下的路径规划。算法建立了通过性路网模型，保证寻路结果通过指定区域，并分两步实现通过性寻路：虚终点寻路和变方向寻路。虚终点寻路通过设置虚终点并利用A*算法引导路径通过指定区域，变方向寻路通过更改寻路诱导代价引导路径从指定区域向终点规划。
特殊路网约束下的目标引导路径规划在蛛式路网分块的基础上，以块为单位对路网数据进行预处理，计算路网中其它节点到达块边界节点的代价，从而判断有向节点对是否在到达该块的最优路上。目标引导寻路只拓展约束范围内有最优标志的节点，从而减少拓展节点，加快路径规划速度。
Path planning is one of the most important parts of the vehicle navigation system.With the rapid increase of geographic information data and car ownership in China, thetransportation system becomes more and more complex, which makes it quitechallenging to meet the requirement of individualized demand of drivers. Therefore,developing the path planning algorithm under traffic restriction to meet therequirement of the vehicle navigation system has become a critical problem that needsto be solved. In this dissertation, the algorithms of transportation-forecast optimumpath planning, area-through path planning, and target guiding under the restraint ofspecial road net were proposed.
A computation model that can evaluate whether the number of the floating car canmeet the requirement of the dynamic path planning was initially developed. Thethreshold control method was adopted to filter the received dynamic traffic informationon the premise that the accuracy can meet the requirement. At the same time, themethods of weighted average and exponential smoothing were first used to supplementthe missing data, then using the data from the adjacent road segment, together withtopo characteristics of the road net, to further complete the missing data. The noisedata was repaired using the method of reconstruction of the principal components. Theclustering analysis method was applied to the repaired traffic data to build thematching template, and short-term forecast on the traffic data was performed using themethods of multi-factor pattern matching and adaptive correction based on theforecasting error. The traffic model of the urban road net was then developed, whichmakes it possible to develop the time optimal path planning based on forecast.
Compared with the original static path planning, the optimum vehicular pathplanning with traffic forecast can take the dynamic traffic restriction into consideration,thus it enables the driver travels along the optimum route avoiding the traffic jam. Inorder to rapidly read and update the dynamic traffic data, the dynamic traffic databasewas established in this dissertation, which can provide convenient basic support for thedynamic updates of the electronic map. The optimum path planning with traffic forecast can fulfill the dynamic path planning of the plane road net through calculatingthe cost between two nodes using traffic model of the urban road net and computingthe waiting time at the cross.
The area-through path planning proposes a new method of path planning. Theusers can select the passing area according to their own needs. As a result of that, pathplanning under area restriction was realized. The algorithm proposed in thisdissertation develops the model of area-through path planning, enabling the results topass the designated area. The area-through path planning was fulfilled through twosteps: the virtual target path planning and the direction-changing path planning. Thevirtual target path planning is achieved by leading the car to pass the designated areaby setting the virtual-target point and using A*algorithm, while the direction-changingpath planning can lead the car to pass the target area through changing the pathplanning heuristic cost.
Based on the basis of the spider-web road network the target guiding pathplanning restrained under the special road net preprocesses the road net data in block.It estimates whether the directional joint-node is on the optimum path to this blockthrough calculating the cost from other nodes to boundary nodes of the block. Thetarget guiding path planning only topo the nodes with optimal flags in the restraint area,thus it can reduce the topological nodes and increase the speed of path planning.
首先建立了浮动车样本量计算模型，验证当前浮动车数量是否满足动态路径规划的需求。在精度满足要求的情况下，应用阈值控制算法对接收的动态交通信息进行过滤，同时使用加权平均及指数平滑的方法对缺失数据进行补全，在此基础上结合路网拓扑特性用相邻路段数据补全缺失数据，最后应用主成分重建的方法对噪声数据进行修复。对修复后的交通数据采用聚类分析算法建立匹配模板，并利用多因子模式匹配和预测误差的自适应校正方法对交通数据进行短期预测，从而建立城市道路交通模型，使基于预测的时间最优路径规划成为可能。
带交通预测的最优路径规划在原有静态路径规划的基础上考虑动态交通信息的约束，使驾驶员避开拥堵走最佳行驶路线。为实现动态交通数据的快速读取和更新，文中建立了动态交通数据库，为电子地图的动态更新提供快捷的底层支持。带交通预测的最优路径规划利用城市路网交通模型计算节点通行代价，并考虑车辆在路口的等待时间，实现了平面路网下的动态路径规划。
通过性寻路提出了一种新的路径规划方法，可以由用户根据自己的趋好选择通过区域，实现了区域约束下的路径规划。算法建立了通过性路网模型，保证寻路结果通过指定区域，并分两步实现通过性寻路：虚终点寻路和变方向寻路。虚终点寻路通过设置虚终点并利用A*算法引导路径通过指定区域，变方向寻路通过更改寻路诱导代价引导路径从指定区域向终点规划。
特殊路网约束下的目标引导路径规划在蛛式路网分块的基础上，以块为单位对路网数据进行预处理，计算路网中其它节点到达块边界节点的代价，从而判断有向节点对是否在到达该块的最优路上。目标引导寻路只拓展约束范围内有最优标志的节点，从而减少拓展节点，加快路径规划速度。
Path planning is one of the most important parts of the vehicle navigation system.With the rapid increase of geographic information data and car ownership in China, thetransportation system becomes more and more complex, which makes it quitechallenging to meet the requirement of individualized demand of drivers. Therefore,developing the path planning algorithm under traffic restriction to meet therequirement of the vehicle navigation system has become a critical problem that needsto be solved. In this dissertation, the algorithms of transportation-forecast optimumpath planning, area-through path planning, and target guiding under the restraint ofspecial road net were proposed.
A computation model that can evaluate whether the number of the floating car canmeet the requirement of the dynamic path planning was initially developed. Thethreshold control method was adopted to filter the received dynamic traffic informationon the premise that the accuracy can meet the requirement. At the same time, themethods of weighted average and exponential smoothing were first used to supplementthe missing data, then using the data from the adjacent road segment, together withtopo characteristics of the road net, to further complete the missing data. The noisedata was repaired using the method of reconstruction of the principal components. Theclustering analysis method was applied to the repaired traffic data to build thematching template, and short-term forecast on the traffic data was performed using themethods of multi-factor pattern matching and adaptive correction based on theforecasting error. The traffic model of the urban road net was then developed, whichmakes it possible to develop the time optimal path planning based on forecast.
Compared with the original static path planning, the optimum vehicular pathplanning with traffic forecast can take the dynamic traffic restriction into consideration,thus it enables the driver travels along the optimum route avoiding the traffic jam. Inorder to rapidly read and update the dynamic traffic data, the dynamic traffic databasewas established in this dissertation, which can provide convenient basic support for thedynamic updates of the electronic map. The optimum path planning with traffic forecast can fulfill the dynamic path planning of the plane road net through calculatingthe cost between two nodes using traffic model of the urban road net and computingthe waiting time at the cross.
The area-through path planning proposes a new method of path planning. Theusers can select the passing area according to their own needs. As a result of that, pathplanning under area restriction was realized. The algorithm proposed in thisdissertation develops the model of area-through path planning, enabling the results topass the designated area. The area-through path planning was fulfilled through twosteps: the virtual target path planning and the direction-changing path planning. Thevirtual target path planning is achieved by leading the car to pass the designated areaby setting the virtual-target point and using A*algorithm, while the direction-changingpath planning can lead the car to pass the target area through changing the pathplanning heuristic cost.
Based on the basis of the spider-web road network the target guiding pathplanning restrained under the special road net preprocesses the road net data in block.It estimates whether the directional joint-node is on the optimum path to this blockthrough calculating the cost from other nodes to boundary nodes of the block. Thetarget guiding path planning only topo the nodes with optimal flags in the restraint area,thus it can reduce the topological nodes and increase the speed of path planning.
引文
[1]田明星.路径规划在车辆导航系统中的应用研究[硕士学位论文].北京:北京交通大学,2009.
[2]吕晓建.车辆导航系统中路径规划技术的研究[硕士学位论文].上海:上海交通大学,2011.
[3]龚勃文.大规模路网下中心式动态交通诱导系统关键技术研究[博士学位论文].长春:吉林大学,2010.
[4]葛艳,王健,孟友新,等.车辆导航动态路径规划研究进展[J].公路交通科技,2010,27(11):113-117.
[5]李清泉,萧世伦,方志祥,等.交通地理信息系统技术与发展前沿.北京:科学出版社.2012.
[6] Wang Chao, Quddus M A, Ison S G. Impact of traffic congestion on road accidents: A spatialanalysis of the M25motorway in England [J]. Accident Analysis and Prevention,2009,41(4):798-808.
[7] Ding J W, Wang C F, Meng F H, et al. Real-time vehicle route guidance usingvehicle-to-vehicle communication [J]. IET Communications,2010,4(7):870-883.
[8]毕振山.北京通勤时间全国平均第一达1.32小时[N/OL].工人日报,2012-5-13(3).
[9]北京关于进一步推进缓解首都交通拥堵工作意见.[2013-01-26].http://politics.gmw.cn/2010-12/24/content_1494214_3.htm.
[10]赵亦林.车辆定位与导航系统.谭国真,译.北京:电子工业出版社，1999:1-15.
[11]李宏海,刘冬梅,王晶.日本VICS系统的发展介绍[J].交通工程,2011,8(15):107-113.
[12]杨兆升,初连寓.动态路径诱导系统的研究进展[J].公路交通科技,2000,17(1):34-38.
[13] Pang G, Takahashi K, Yokota T, et al. Adaptive route selection for dynamic routeguidancesystem based on fuzzy-neural approaches [J]. IEEE Transactions on Vehicular Technology,1999,48(6):2028-2041.
[14]颜波.车载自主导航系统中的动态最优路径规划[硕士学位论文].北京:清华大学,2004.
[15] Boyce D. A Memoir of the ADVANCE Project [J]. ITS Journal,2002,7(2):105-130.
[16] Demers A, List G F, Wojtowicz J, et al. Experimenting with real-time ATIS: Steppingforward from ADVANCE [C]. Proceedings of the Ninth International Conference onApplications of Advanced Technology in Transportation, Chicago, USA,325-330.
[17] Michel Van Aerde and Hesham Rakha. TravTek Evaluation Modeling Study. Report No.FHWA-RD-95-090, U.S. Department of Transportation. Federal Highway Administration.1996.
[18]丁芳.国际车载导航应用的现状及趋势.中国测绘报.2011-1-11(003).
[19] Hadj-Alouane A, Hadj-Alouane N, Juma0, et al. The Ali-Scount Route Guidance Simulation
[R]. Ann Arbor, Michigan: The University of Michigan,1996.
[20] Von Tomkewitsch R. Dynamic Route Guidance and Interactive Transport Management withALI-SCOUT [J]. IEEE Transactions on Vehicular Technology,1991,40(1):45-50.
[21] Dongjoo Park, Hansoo Kim, Chungwon Lee, et al. Location-Based Dynamic RouteGuidance System of Korea: System Design, Algorithms and Initial Results [J]. KSCEJournal of Civil Engineering,2010,14(1):51-59.
[22]杨兆升.城市交通流诱导系统理论与模型.北京:人民交通出版社，2000.
[23]杨兆升,姜桂艳.城市交通流诱导系统结构框架研究[J].公路交通科技,1997,14(3):6-10.
[24]北京工业大学交通研究中心.交通诱导(车辆导航)系统技术与设备课题投标方案书.北京:北京工业大学,2003.
[25]王猛.新型交通诱导信息屏现身北京街头.[2013-01-27]. http://gb.cri.cn/14714/2007/02/01/106@1432711_1.htm.
[26] Cooke K L, Halsey E. The shortest route through a network with time-dependent internodaltransit times [J]. Journal of Mathematical Analysis and Application,1966,14(3):493–498.
[27] Dreyfus S E. An Appraisal of Some Shortest-Path Algorithms [J]. Operations Research,1969,17(3):395-412.
[28] Chabini I, Lan S. Adaptations of the A*Algorithm for the Computation of Fastest Paths inDeterministic Discrete-Time Dynamic Networks [J]. IEEE Transaction on intelligenttransportation systems,2002,3(1):60-74.
[29] Chabini I. Discrete dynamic shortest path problems in transportation applications:complexity and algorithms with optimal run time [J]. Transportation Research Record,1998,(1645):170-175.
[30] Abram J M, Rhodes I B. Some shortest Path algoritbms with decentralized information andcommunication requirments [J]. IEEE Transactions on Automatic Control,1982(27):570-582.
[31]俞峰.复杂动态随机网络最短路径[博士学位论文].杭州:浙江大学,2009.
[32] Orda A, Rom R. Minimum weight paths in time-dependent networks [J]. Networks,1991,21(3):295-319.
[33] Stentz A. Optimal and efficient path planning for partially-known environments [C]//Inproceedings of the IEEE International Conference on Robotics and Automation, Pittsburgh,USA, May1994:3310-3317.
[34] Stentz A, Institute R. The Focussed D*Algorithm for Real-Time Replanning [C]//Inproceedings of the International Joint Conference on Artificial Intelligence, MontrealQuebec, August1995:1652-1659.
[35] Ziliaskopoulos A K, Mahmassani H S. A note on least time path computation consideringdelays and prohibitions for intersection movements [J]. Transportation Research Part B,1996,30(5):359-367.
[36] Ziliaskopoulos A K, Kotzinos D, Mahmassani H S. Design and implementation of paralleltime-dependent least time path algorithms for its applications [J]. Transportation ResearchPart C,1997,5(2):95-107.
[37] Ziliaskopoulos A K, Wardell W. An intermodal optimum path algorithm for multimodalnetworks with dynamic arc travel times and switching delays [J]. European Journal ofOperational Research,2000,125(3):486-502.
[38] Hall R W. The fastest path through a network with random time-dependent travel times [J].Transportation Science,1986,20(3):182-188.
[39] Miller-Hooks E D, Mahmassani H S. Least possible time paths in stochastic, timevaryingnetworks [J]. Computers and Operations Research,1998,25(12):1107-1125.
[40] Miller-Hooks E D, Mahmassani H S. Least expected time paths in stochastic, timevaryingtransportation networks [J]. Transportation Science,2000,34(2):198-215.
[41] Miller-Hooks E D. Adaptive least-expected time paths in stochastic, time-varyingtransportation and data networks [J]. Networks,2001,37(1):35–52.
[42]吴成东,杨丽英,许可.神经网络和遗传算法在动态路径诱导中的应用[J].计算机应用研究,2006(5):177-179.
[43]林澜,闫春钢,蒋昌俊,等.动态路网最短路径问题的复杂性与近似解法[J].计算机学报,2007,30(4):608-614.
[44]谭国真.时变、随机网络最优路径规划算法及其应用研究[博士学位论文].大连：大连理工大学,2002.
[45]谭国真,高文.时间依赖的网络中最小时间路径算法[J].计算机学报,2002,25(2):165-172.
[46]杨易,谷正气,胡林,等.病毒遗传算法在动态路径规划中的运用研究[J].汽车工程,2007,29(1):86-88.
[47]高立兵.汽车导航系统的动态路径规划优化模型及算法研究[J].甘肃联合大学学报(自然科学版),2012,26(1):55-58,68.
[48]颜波,杨殿阁,丁捷,等.基于分时路网模型的车辆导航自适应寻路算法[J].汽车工程,2003,25(6):606-609.
[49]孙海鹏,翟传润,战兴群,等.基于实时交通信息的动态路径规划技术[J].微计算机信息,2007,23(8-3):177-178.
[50]付梦印,李杰,邓志红.限制搜索区域的距离最短路径规划算法.北京理工大学学报,2004,24(10):881-884.
[51]苏永云,晏克非,黄翔,等.车辆导航系统的动态最优路径搜索方法研究.系统工程,2000,18(4):32-37.
[52]张国强,晏克非.动态随机状态下的车辆导航及其路径寻优算法.长沙交通学院学报,2002,18(3):72-76.
[53] Zhang Tao, Yang Diange, Li Ting, et al. An improved virtual intersection model for vehiclenavigation at intersections [J]. Transportation Research Part C,2011,19(3):413-423.
[54] Ding J W, Wang C F, Meng F H, et al. Real-time vehicle route guidance usingvehicle-to-vehicle communication [J]. IET Communication,2010,4(7):870-883.
[55] Dion F, Oh J S, Robinson R. Virtual Testbed for Assessing Probe Vehicle Data in IntelliDriveSystems [J]. IEEE Transaction on Intelligent Transportation System,2011,12(3):635–644.
[56]王力.移动交通流检测系统关键技术研究[博士学位论文].北京:北京交通大学,2005.
[57] Naranjo J E, Jiménez F, Serradilla F J, et al. Comparison between floating car data andinfrastructure sensors for traffic speed estimation [C]//In Proceeding13th InternationalIEEE Conference Intelligent Transportation System, Madeira Island Portugal, September2010.
[58]杨喆.大规模浮动车数据处理的研究与实现[硕士学位论文].合肥:中国科学技术大学,2010.
[59] Jarema F, Dahlin C, Gillmann R, FHWA study tour for European traffic monitoringprograms and technologies. Federal Highway Administration, U.S. Department ofTransportation, Washington DC,1997.
[60]冮龙晖,姜桂艳,张晓东,等.智能运输系统交通传感器数据的筛选与检验[J].吉林大学学报(工学版),2004,34(1):122-126.
[61] Chen Chao, Kwon J, Rice J. et al. Detecting Errors and ImPuting Missing Data for SingleLooP Surveillance System.82nd Annual Meeting of the Transportation Research Board,2003.
[62] Jacobson L N, Nihan N L, Bender J D. Detecting Erroneous Loop Detector Data in aFreeway Traffic Management System [J]. Transportation Research Record,1990(1287):151-166.
[63] Coifman B. Improved Velocity Estimation Using Single Loop Detectors [J]. TransportationResearch Part A,2001,35(10):863-880.
[64] Jain M, Coifman B. Improved Speed Estimates from Freeway Traffic Detectors.83rd AnnualMeeting of the Transportation Research Board, CDROM, Washington D.C.,2004.
[65]裴玉龙,马冀.实时交通数据的筛选与恢复研究[J].土木工程学报,2003,36(7):78-83.
[66] Sun Lu, Zhou Jie. Development of Multi regime Speed-Density Relationships by ClusterAnalysis [J]. Transportation Research Record,2005(1934):64-71.
[67] Xia Jingxin, Chen Mei. Analyzing Traffic Flow Phases Using ITS Data.83rd AnnualMeeting of the Transportation Research Board, CDROM, Washington D.C.,2004.
[68]宫晓燕.基于数据挖掘的交通流数据过滤算法[C].年全国智能交通系统交通信息采集与融合技术研讨会论文集,杭州,浙江，2003,163-173.
[69] Yu liu, Yu Lei, Qi Yi, et al. Traffic Incident Detection Algorithm for Urban ExpresswaysBased on Probe Vehicle Data [J]. Journal of Transportation Systems Engineering andInformation Technology.2008,8(4):36-41.
[70] Ban Xuegang, Li Yuwei, Skabardonis A, et al. Performance Evaluation of Travel-TimeEstimation Methods for Real-Time Traffic Applications [J]. Journal of IntelligentTransportation Systems,2010,14(2):54-67.
[71] Lv Weifeng, Yun Liang, Zhu Tongyu, et al. An FCD compensation model based on trafficcondition trends matching [C]//4th International Conference on Computer Sciences andConvergence Information Technology. Seoul, Nov2009:1201-1206.
[72] Du Bowen, Xu Leishi, Ma Dianfu, et al. Missing Data Compensation Model in Real-TimeTraffic Information Service System [C]//5th International Conference on Fuzzy Systems andKnowledge Discovery, Jinan, Shandong, Oct2008:371-378.
[73]陆海亭,张宁,黄卫,等.短时交通流预测方法研究进展[J].交通运输工程与信息学报,2009,4(7):84-91.
[74] Sun Shiliang, Zhang Changshui, Yu Guoqiang. A bayesian network approach to traffic flowforecasting [J]. IEEE Transactions on Intelligent Transportation Systems,2006,7(1):124-132.
[75] Tebaldi C, West M, Karr A F. Statistical analyses of freeway traffic flows [J]. Journal ofForecasting,2002,21(1):39-68.
[76] Ben-Akiva M, Cascetta E, Gunn H. Recent Progress in Short-Range Traffic Prediction [C]//Compendium of Technical Papers, ITE,63rd Annual Meeting, Hague, Netherlands,Sep.1993:262-265.
[77] Hamed M M, AI-Masaeid H R, Bani Said Z M. Short-term prediction of traffic volume inurban arterials [J]. Journal of Transportation Engineering,1995,121(3):249-254.
[78] Williams B M, Hoel L A. Modeling and forecasting vehicular traffic flow as a seasonalARIMA processs: theoretical basis and empirical results [J]. Journal of TransportationEngineering,2003,129(6):664-672.
[79] Stathopoulos A, Karlaftis M G. A multivariate state space approach for urban trafficmodeling and prediction [J]. Transportation Research Part C,2003,11(2):121-135.
[80] Ghosh B, Basu B, Mahony M O. Multivariate short-term traffic flow forecasting usingtime-series analysis [J]. IEEE Tansactions on Intelligent Transportation Systems,2009,10(2):246-254.
[81] Min Wanli, Wynter L. Real-time road traffic prediction with spatio-temporal correlations [J].Transportation Research Part C,2011,19(4):606-611.
[82]李士宁，闫焱，覃征.基于FARIMA模型的网络流量预测[J].计算机工程与应用,2006,29(3):148-150.
[83]童明荣，薛恒新，林琳.基于季节ARIMA模型的公路交通量预测[J].公路交通科技,2008,25(1):124-128.
[84]薛可,李增智,刘浏,等.基于ARIMA模型的网络流量预测[J].微电子学与计算机,2004,21(7):84-87.
[85] Okutani I, Stephanedes Y J. Dynamic prediction of traffic volume through Kalman filteringtheory [J]. Transportation Research Part B,1984,18(1):1-11.
[86]聂佩林,余志,何兆成.基于约束卡尔曼滤波的短时交通流量组合预测模型[J].交通运输工程学报,2008,8(5):54-90.
[87] Hyndman R J, Koehler A B, Ord J K, et al. Forecasting with exponential smoothing: the statespace approach. Berlin, Germany: Springer-Verlag.2008.
[88] Taylor J W. Exponentially weighted methods for forecasting intraday time series withmultiple seasonal cycles [J]. International Journal of Forecasting,2010,26(4):627-646.
[89] Vlahogianni E I, Karlaftis M G, Golias J C, et al. Optimized and meta-optimized neuralnetworks for short-term traffic flow prediction: A genetic approach [J]. TransportationResearch Part C,2005,13(3):211-234.
[90] Reuter U, Moller B. Artificial Neural Networks for Forecasting of Fuzzy Time Series [J].Computer-Aided Civil and Infrastructure Engineering,2010,25(5):363-374.
[91] etiner B G, Sari M, Borat O. A Neural Network Based Traffic-flow Prediction Model [J].Mathematical and Computational Applications,2010,15(2):269-278.
[92] Xie Yuanchang, Zhao Kaiguang, Sun Ying, et al. Gaussian Processes for Short-Term TrafficVolume Forecasting [J]. Transportation Research Record,2010(2165):69-78.
[93] Xie Yuanchang, Huynh N. Kernel-Based Machine Learning Models for Predicting DailyTruck Volume at Seaport Terminals [J]. Journal of Transportation Engineering-ASCE,2010,136(12):1145-1152.
[94] Ghosh B, Basu B, Mahony M O, et al. Random Process Model for Urban Traffic Flow Usinga Wavelet-Bayesian Hierarchical Technique [J]. Computer-Aided Civil and InfrastructureEngineering,2010,25(8):613–624.
[95] Boto-Giralda D, Diaz-Pernas F J, Gonzalez-Ortega D, et al. Wavelet-based denoising fortraffic volume time series forecasting with self-organizing neural networks [J].Computer-Aided Civil and Infrastructure Engineering,2010,25(7):530-545.
[96]雷霆,余镇危.一种网络流量预测的小波神经网络模型[J].计算机应用，2006,26(3):526-528.
[97]谭满春,李英俊,徐建闽.基于小波消噪的ARIMA与SVM组合交通流预测[J].公路交通科技,2009,26(7):127-133.
[98]张涛,陈先,谢美萍,等.基于K临近非参数回归的短时交通流预测方法[J].系统工程理论与实践,2010,30(2):376-384.
[99] Yakowitz S. Nearest-neighbour methods for time series analysis [J]. Journal of Time SeriesAnalysis,1987,8(2):10-26.
[100] Clark S. Traffic Prediction using Multivariate Nonparametric Regression [J].Journal ofTransportation Engineering,2003,129(2):161-168.
[101]宫晓燕,汤淑明.基于非参数回归的短时交通流预测与实践检测综合算法[J].中国公路学报,2003,16(1):82-86.
[102]张晓利.基于非参数回归的短时交通流量预测方法研究[博士学位论文].天津:天津大学，2007.
[103] Smith B L, Oswald R K. Effects of Parameter Selection on Forecast Accuracy and ExecutionTime in Nonparametric Regression [C]. Proceedings of2000IEEE Intelligent TransportationSystem，Dearborn(MI), USA, Oct2000:252-257.
[104]张文星.回避禁行道路的路径规划方法、导航方法及终端:中国,201210217391.3.2012-10-03.
[105] Yen J Y. Finding the k shortest loopless paths in a network [J]. Management Science,1971,17(11):712-716.
[106] Hershberger J, Maxel M, Suri S. Finding the k shortest simple paths: A new algorithm and itsimplementation [J]. ACM Transactions Algorithms,2007,3(4), No.45.
[107] Malviya N, Madden S, Bhattacharya A. A Continuous Query System for Dynamic RoutePlanning. In Proceedings of International Conference on Data Engineering, Apr2011:792-823.
[108] Martins E Q V, Pascoal M M B, Santos J L E. Deviation algorithms for ranking shortestpaths [J]. International Journal of Foundations of Computer Science,1999,10(3):247-261.
[109] Jimenez V M, Marzal A. Computing the K shortest paths: a new algorithm and anexperimental comparison [J]. Springer-Verlag, Lecture Notes in Computer Science Series,1999(1688):15-29.
[110]高松,陆锋. K则最短路径算法效率与精度评估[J].2009,14(8):1677-1683.
[111] Chen Y Y, Bell M G H, Bogenberger K. Reliable Pretrip Multi-path Planning and DynamicAdaptation for a Centralized Road Navigation System [J]. IEEE Transactions on IntelligentTransportation Systems,2007,8(1):257-262.
[112] Dinic E A. Algorithm for solution of a problem of maximum flow in a network with powerestimation [J]. Soviet Mathmatics Doklady,1970,11(5):248-264.
[113] Torrieri D. Algorithms for finding an optimal set of short disjoint paths in a communicationnetwork [J]. IEEE Transactions on Communications,1992,40(11):1698-1702.
[114] Dees J, Geisberger R, Sanders P, et al. Defining and Computing Alternative Routes in RoadNetworks. Technical report, Feb2010.
[115] Bader R, Dees J, Geisberger R, et al. Alternative Route Graphs in Road Networks.Proceedings of the First international ICST conference on Theory and practice of algorithmsin (computer) systems,2011,21-32.
[116] Dijkstra E W. A note on two problems in connexion with graphs [J]. Numerical mathematics，1959(1):269-271.
[117] Hart E P, Nilsson N J, Raphael B. A Formal Basis for the Heuristic Determination ofMinimum Cost Paths [J]. IEEE Transcations on Systems Science and Cybernetics,1968,4(2):100-107.
[118] Nicholson T A J. Finding the shortest route between two points in a network [J]. TheComputer Journal,1966,9(3):275-280.
[119]宋青,汪小帆.路径规划算法加速技术研究综述[J].电子科技大学学报,2012,41(2):176-184.
[120] Dreyfus E S. An appraisal of some shortest path algorthims [J]. Operations Research.1969(17):295-412.
[121] Jagadeesh G R, Srikanthan T, Quek K H. Heuristic techniques for accelerating hierarchicalrouting on road networks [J]. IEEE Transactions on Intelligent Transportation Systems,2002,3(4):301-309.
[122] Jung S, Parmanik S. An efficient path computation model for hierarchically structuredtopographical road maps [J]. IEEE Transcations on Knowledge&Data Engineering.2002,14(5):1029-1046.
[123] Hilger M. Accelerating point-to-point shortest path computations in large scale networks [D].Berlin: Technische Universit t Berlin,2007.
[124] Song Qing, Wang Xiaofan. Efficient Routing on Large Road Networks Using hierarchicalCommunities [J]. IEEE Transactions on Intelligent Transportation Systems,2011,12(1):132-140.
[125] Goldberg A V, Harrelson C. Computing the shortest path: A*meets graph theory [C].16thACM-SIAM Symposium on Discrete Algorithms,2005:156-165.
[126] Goldberg A V, Werneck R F. Computing Point-to-Point Shortest Paths from ExternalMemory [C]. In workshop on Algorithm Engineering and Experiment,2005:26-40.
[127] Lauther U. An extremely fast, exact algorithm for finding shortest paths in static networkswith geographical background. Geoinformation und Mobilitat.2004(22):219-230.
[128] Schultes D. Fast and Exact Shortest Path Queries Using Highway Hierarchies [D]. Germany:Universitt des Saarlandes, Department of Computer Science,2005.
[129] Schultes D. Route Planning in Road Networks [D]. Karlsruhe: Universit t Fridericiana zuKarlsruhe,2008.
[130] Geisberger R. Contraction Hierarchies: Faster and Simpler Hierarchical Routing in RoadNetworks [D]. Karlsruhe: Universit t Fridericiana zu Karlsruhe,2008.
[131] Holzer M, Schulz F, Willhalm T. Combining speed-up techniques for shortest-pathcomputations. Lecture Notes in Computer Science, Springer,2004,3059:269-284.
[132] Bauer Reinhard, Delling D, Sanders P, et al. Combining Hierarchical and Goal-DirectedSpeed-Up Thchniques for Dijkstra’s Algorithm [J]. Lecture Notes in Computer Science,2008(5038):303-318.
[133]李挺.车辆自主导航的广域蛛式地图与点状路网跨层路径规划[博士学位论文].北京.清华大学,2008.
[134]郭璘,陈纯,方廷健,等.浮动车样本规模的优化方法与仿真研究[J].系统仿真学报,2009,21(16):5227-5230.
[135]李清泉,尹建忠,贺奋琴.面向道路网的GPS浮动车覆盖率模型研究[J].武汉大学学报(信息科学版),2009,34(6):715-718.
[136]周舒杰,廖孝勇,赵敏,等.面向道路网的浮动车最小覆盖率模型[J].重庆工学院学报(自然科学版),2009,23(4):11-14.
[137]北京市交委.北京市“十二五”时期交通发展建设规划.[2013-01-28]. http://www.chinahighway.com/news/2012/689803.php.
[138] BOX, G.E.P., and COX, D.R. An Analysis of Transformations [J]. Journal of the RoyalStatistics Socity, Ser.B.1964(26):211-252.
[139] Lakhina A, Papagiannaki K, Crovella M, et al. Structural analysis of network traffic flows[J]. in Proc. SIGMETRICS,2004,32(1):61–72.
[140]梁保松,曹殿立.模糊数学及其应用.北京:科学出版社,2007.
[141]王钊.车辆导航电子地图的自增量更新[博士学位论文].北京:清华大学,2012.
[2]吕晓建.车辆导航系统中路径规划技术的研究[硕士学位论文].上海:上海交通大学,2011.
[3]龚勃文.大规模路网下中心式动态交通诱导系统关键技术研究[博士学位论文].长春:吉林大学,2010.
[4]葛艳,王健,孟友新,等.车辆导航动态路径规划研究进展[J].公路交通科技,2010,27(11):113-117.
[5]李清泉,萧世伦,方志祥,等.交通地理信息系统技术与发展前沿.北京:科学出版社.2012.
[6] Wang Chao, Quddus M A, Ison S G. Impact of traffic congestion on road accidents: A spatialanalysis of the M25motorway in England [J]. Accident Analysis and Prevention,2009,41(4):798-808.
[7] Ding J W, Wang C F, Meng F H, et al. Real-time vehicle route guidance usingvehicle-to-vehicle communication [J]. IET Communications,2010,4(7):870-883.
[8]毕振山.北京通勤时间全国平均第一达1.32小时[N/OL].工人日报,2012-5-13(3).
[9]北京关于进一步推进缓解首都交通拥堵工作意见.[2013-01-26].http://politics.gmw.cn/2010-12/24/content_1494214_3.htm.
[10]赵亦林.车辆定位与导航系统.谭国真,译.北京:电子工业出版社，1999:1-15.
[11]李宏海,刘冬梅,王晶.日本VICS系统的发展介绍[J].交通工程,2011,8(15):107-113.
[12]杨兆升,初连寓.动态路径诱导系统的研究进展[J].公路交通科技,2000,17(1):34-38.
[13] Pang G, Takahashi K, Yokota T, et al. Adaptive route selection for dynamic routeguidancesystem based on fuzzy-neural approaches [J]. IEEE Transactions on Vehicular Technology,1999,48(6):2028-2041.
[14]颜波.车载自主导航系统中的动态最优路径规划[硕士学位论文].北京:清华大学,2004.
[15] Boyce D. A Memoir of the ADVANCE Project [J]. ITS Journal,2002,7(2):105-130.
[16] Demers A, List G F, Wojtowicz J, et al. Experimenting with real-time ATIS: Steppingforward from ADVANCE [C]. Proceedings of the Ninth International Conference onApplications of Advanced Technology in Transportation, Chicago, USA,325-330.
[17] Michel Van Aerde and Hesham Rakha. TravTek Evaluation Modeling Study. Report No.FHWA-RD-95-090, U.S. Department of Transportation. Federal Highway Administration.1996.
[18]丁芳.国际车载导航应用的现状及趋势.中国测绘报.2011-1-11(003).
[19] Hadj-Alouane A, Hadj-Alouane N, Juma0, et al. The Ali-Scount Route Guidance Simulation
[R]. Ann Arbor, Michigan: The University of Michigan,1996.
[20] Von Tomkewitsch R. Dynamic Route Guidance and Interactive Transport Management withALI-SCOUT [J]. IEEE Transactions on Vehicular Technology,1991,40(1):45-50.
[21] Dongjoo Park, Hansoo Kim, Chungwon Lee, et al. Location-Based Dynamic RouteGuidance System of Korea: System Design, Algorithms and Initial Results [J]. KSCEJournal of Civil Engineering,2010,14(1):51-59.
[22]杨兆升.城市交通流诱导系统理论与模型.北京:人民交通出版社，2000.
[23]杨兆升,姜桂艳.城市交通流诱导系统结构框架研究[J].公路交通科技,1997,14(3):6-10.
[24]北京工业大学交通研究中心.交通诱导(车辆导航)系统技术与设备课题投标方案书.北京:北京工业大学,2003.
[25]王猛.新型交通诱导信息屏现身北京街头.[2013-01-27]. http://gb.cri.cn/14714/2007/02/01/106@1432711_1.htm.
[26] Cooke K L, Halsey E. The shortest route through a network with time-dependent internodaltransit times [J]. Journal of Mathematical Analysis and Application,1966,14(3):493–498.
[27] Dreyfus S E. An Appraisal of Some Shortest-Path Algorithms [J]. Operations Research,1969,17(3):395-412.
[28] Chabini I, Lan S. Adaptations of the A*Algorithm for the Computation of Fastest Paths inDeterministic Discrete-Time Dynamic Networks [J]. IEEE Transaction on intelligenttransportation systems,2002,3(1):60-74.
[29] Chabini I. Discrete dynamic shortest path problems in transportation applications:complexity and algorithms with optimal run time [J]. Transportation Research Record,1998,(1645):170-175.
[30] Abram J M, Rhodes I B. Some shortest Path algoritbms with decentralized information andcommunication requirments [J]. IEEE Transactions on Automatic Control,1982(27):570-582.
[31]俞峰.复杂动态随机网络最短路径[博士学位论文].杭州:浙江大学,2009.
[32] Orda A, Rom R. Minimum weight paths in time-dependent networks [J]. Networks,1991,21(3):295-319.
[33] Stentz A. Optimal and efficient path planning for partially-known environments [C]//Inproceedings of the IEEE International Conference on Robotics and Automation, Pittsburgh,USA, May1994:3310-3317.
[34] Stentz A, Institute R. The Focussed D*Algorithm for Real-Time Replanning [C]//Inproceedings of the International Joint Conference on Artificial Intelligence, MontrealQuebec, August1995:1652-1659.
[35] Ziliaskopoulos A K, Mahmassani H S. A note on least time path computation consideringdelays and prohibitions for intersection movements [J]. Transportation Research Part B,1996,30(5):359-367.
[36] Ziliaskopoulos A K, Kotzinos D, Mahmassani H S. Design and implementation of paralleltime-dependent least time path algorithms for its applications [J]. Transportation ResearchPart C,1997,5(2):95-107.
[37] Ziliaskopoulos A K, Wardell W. An intermodal optimum path algorithm for multimodalnetworks with dynamic arc travel times and switching delays [J]. European Journal ofOperational Research,2000,125(3):486-502.
[38] Hall R W. The fastest path through a network with random time-dependent travel times [J].Transportation Science,1986,20(3):182-188.
[39] Miller-Hooks E D, Mahmassani H S. Least possible time paths in stochastic, timevaryingnetworks [J]. Computers and Operations Research,1998,25(12):1107-1125.
[40] Miller-Hooks E D, Mahmassani H S. Least expected time paths in stochastic, timevaryingtransportation networks [J]. Transportation Science,2000,34(2):198-215.
[41] Miller-Hooks E D. Adaptive least-expected time paths in stochastic, time-varyingtransportation and data networks [J]. Networks,2001,37(1):35–52.
[42]吴成东,杨丽英,许可.神经网络和遗传算法在动态路径诱导中的应用[J].计算机应用研究,2006(5):177-179.
[43]林澜,闫春钢,蒋昌俊,等.动态路网最短路径问题的复杂性与近似解法[J].计算机学报,2007,30(4):608-614.
[44]谭国真.时变、随机网络最优路径规划算法及其应用研究[博士学位论文].大连：大连理工大学,2002.
[45]谭国真,高文.时间依赖的网络中最小时间路径算法[J].计算机学报,2002,25(2):165-172.
[46]杨易,谷正气,胡林,等.病毒遗传算法在动态路径规划中的运用研究[J].汽车工程,2007,29(1):86-88.
[47]高立兵.汽车导航系统的动态路径规划优化模型及算法研究[J].甘肃联合大学学报(自然科学版),2012,26(1):55-58,68.
[48]颜波,杨殿阁,丁捷,等.基于分时路网模型的车辆导航自适应寻路算法[J].汽车工程,2003,25(6):606-609.
[49]孙海鹏,翟传润,战兴群,等.基于实时交通信息的动态路径规划技术[J].微计算机信息,2007,23(8-3):177-178.
[50]付梦印,李杰,邓志红.限制搜索区域的距离最短路径规划算法.北京理工大学学报,2004,24(10):881-884.
[51]苏永云,晏克非,黄翔,等.车辆导航系统的动态最优路径搜索方法研究.系统工程,2000,18(4):32-37.
[52]张国强,晏克非.动态随机状态下的车辆导航及其路径寻优算法.长沙交通学院学报,2002,18(3):72-76.
[53] Zhang Tao, Yang Diange, Li Ting, et al. An improved virtual intersection model for vehiclenavigation at intersections [J]. Transportation Research Part C,2011,19(3):413-423.
[54] Ding J W, Wang C F, Meng F H, et al. Real-time vehicle route guidance usingvehicle-to-vehicle communication [J]. IET Communication,2010,4(7):870-883.
[55] Dion F, Oh J S, Robinson R. Virtual Testbed for Assessing Probe Vehicle Data in IntelliDriveSystems [J]. IEEE Transaction on Intelligent Transportation System,2011,12(3):635–644.
[56]王力.移动交通流检测系统关键技术研究[博士学位论文].北京:北京交通大学,2005.
[57] Naranjo J E, Jiménez F, Serradilla F J, et al. Comparison between floating car data andinfrastructure sensors for traffic speed estimation [C]//In Proceeding13th InternationalIEEE Conference Intelligent Transportation System, Madeira Island Portugal, September2010.
[58]杨喆.大规模浮动车数据处理的研究与实现[硕士学位论文].合肥:中国科学技术大学,2010.
[59] Jarema F, Dahlin C, Gillmann R, FHWA study tour for European traffic monitoringprograms and technologies. Federal Highway Administration, U.S. Department ofTransportation, Washington DC,1997.
[60]冮龙晖,姜桂艳,张晓东,等.智能运输系统交通传感器数据的筛选与检验[J].吉林大学学报(工学版),2004,34(1):122-126.
[61] Chen Chao, Kwon J, Rice J. et al. Detecting Errors and ImPuting Missing Data for SingleLooP Surveillance System.82nd Annual Meeting of the Transportation Research Board,2003.
[62] Jacobson L N, Nihan N L, Bender J D. Detecting Erroneous Loop Detector Data in aFreeway Traffic Management System [J]. Transportation Research Record,1990(1287):151-166.
[63] Coifman B. Improved Velocity Estimation Using Single Loop Detectors [J]. TransportationResearch Part A,2001,35(10):863-880.
[64] Jain M, Coifman B. Improved Speed Estimates from Freeway Traffic Detectors.83rd AnnualMeeting of the Transportation Research Board, CDROM, Washington D.C.,2004.
[65]裴玉龙,马冀.实时交通数据的筛选与恢复研究[J].土木工程学报,2003,36(7):78-83.
[66] Sun Lu, Zhou Jie. Development of Multi regime Speed-Density Relationships by ClusterAnalysis [J]. Transportation Research Record,2005(1934):64-71.
[67] Xia Jingxin, Chen Mei. Analyzing Traffic Flow Phases Using ITS Data.83rd AnnualMeeting of the Transportation Research Board, CDROM, Washington D.C.,2004.
[68]宫晓燕.基于数据挖掘的交通流数据过滤算法[C].年全国智能交通系统交通信息采集与融合技术研讨会论文集,杭州,浙江，2003,163-173.
[69] Yu liu, Yu Lei, Qi Yi, et al. Traffic Incident Detection Algorithm for Urban ExpresswaysBased on Probe Vehicle Data [J]. Journal of Transportation Systems Engineering andInformation Technology.2008,8(4):36-41.
[70] Ban Xuegang, Li Yuwei, Skabardonis A, et al. Performance Evaluation of Travel-TimeEstimation Methods for Real-Time Traffic Applications [J]. Journal of IntelligentTransportation Systems,2010,14(2):54-67.
[71] Lv Weifeng, Yun Liang, Zhu Tongyu, et al. An FCD compensation model based on trafficcondition trends matching [C]//4th International Conference on Computer Sciences andConvergence Information Technology. Seoul, Nov2009:1201-1206.
[72] Du Bowen, Xu Leishi, Ma Dianfu, et al. Missing Data Compensation Model in Real-TimeTraffic Information Service System [C]//5th International Conference on Fuzzy Systems andKnowledge Discovery, Jinan, Shandong, Oct2008:371-378.
[73]陆海亭,张宁,黄卫,等.短时交通流预测方法研究进展[J].交通运输工程与信息学报,2009,4(7):84-91.
[74] Sun Shiliang, Zhang Changshui, Yu Guoqiang. A bayesian network approach to traffic flowforecasting [J]. IEEE Transactions on Intelligent Transportation Systems,2006,7(1):124-132.
[75] Tebaldi C, West M, Karr A F. Statistical analyses of freeway traffic flows [J]. Journal ofForecasting,2002,21(1):39-68.
[76] Ben-Akiva M, Cascetta E, Gunn H. Recent Progress in Short-Range Traffic Prediction [C]//Compendium of Technical Papers, ITE,63rd Annual Meeting, Hague, Netherlands,Sep.1993:262-265.
[77] Hamed M M, AI-Masaeid H R, Bani Said Z M. Short-term prediction of traffic volume inurban arterials [J]. Journal of Transportation Engineering,1995,121(3):249-254.
[78] Williams B M, Hoel L A. Modeling and forecasting vehicular traffic flow as a seasonalARIMA processs: theoretical basis and empirical results [J]. Journal of TransportationEngineering,2003,129(6):664-672.
[79] Stathopoulos A, Karlaftis M G. A multivariate state space approach for urban trafficmodeling and prediction [J]. Transportation Research Part C,2003,11(2):121-135.
[80] Ghosh B, Basu B, Mahony M O. Multivariate short-term traffic flow forecasting usingtime-series analysis [J]. IEEE Tansactions on Intelligent Transportation Systems,2009,10(2):246-254.
[81] Min Wanli, Wynter L. Real-time road traffic prediction with spatio-temporal correlations [J].Transportation Research Part C,2011,19(4):606-611.
[82]李士宁，闫焱，覃征.基于FARIMA模型的网络流量预测[J].计算机工程与应用,2006,29(3):148-150.
[83]童明荣，薛恒新，林琳.基于季节ARIMA模型的公路交通量预测[J].公路交通科技,2008,25(1):124-128.
[84]薛可,李增智,刘浏,等.基于ARIMA模型的网络流量预测[J].微电子学与计算机,2004,21(7):84-87.
[85] Okutani I, Stephanedes Y J. Dynamic prediction of traffic volume through Kalman filteringtheory [J]. Transportation Research Part B,1984,18(1):1-11.
[86]聂佩林,余志,何兆成.基于约束卡尔曼滤波的短时交通流量组合预测模型[J].交通运输工程学报,2008,8(5):54-90.
[87] Hyndman R J, Koehler A B, Ord J K, et al. Forecasting with exponential smoothing: the statespace approach. Berlin, Germany: Springer-Verlag.2008.
[88] Taylor J W. Exponentially weighted methods for forecasting intraday time series withmultiple seasonal cycles [J]. International Journal of Forecasting,2010,26(4):627-646.
[89] Vlahogianni E I, Karlaftis M G, Golias J C, et al. Optimized and meta-optimized neuralnetworks for short-term traffic flow prediction: A genetic approach [J]. TransportationResearch Part C,2005,13(3):211-234.
[90] Reuter U, Moller B. Artificial Neural Networks for Forecasting of Fuzzy Time Series [J].Computer-Aided Civil and Infrastructure Engineering,2010,25(5):363-374.
[91] etiner B G, Sari M, Borat O. A Neural Network Based Traffic-flow Prediction Model [J].Mathematical and Computational Applications,2010,15(2):269-278.
[92] Xie Yuanchang, Zhao Kaiguang, Sun Ying, et al. Gaussian Processes for Short-Term TrafficVolume Forecasting [J]. Transportation Research Record,2010(2165):69-78.
[93] Xie Yuanchang, Huynh N. Kernel-Based Machine Learning Models for Predicting DailyTruck Volume at Seaport Terminals [J]. Journal of Transportation Engineering-ASCE,2010,136(12):1145-1152.
[94] Ghosh B, Basu B, Mahony M O, et al. Random Process Model for Urban Traffic Flow Usinga Wavelet-Bayesian Hierarchical Technique [J]. Computer-Aided Civil and InfrastructureEngineering,2010,25(8):613–624.
[95] Boto-Giralda D, Diaz-Pernas F J, Gonzalez-Ortega D, et al. Wavelet-based denoising fortraffic volume time series forecasting with self-organizing neural networks [J].Computer-Aided Civil and Infrastructure Engineering,2010,25(7):530-545.
[96]雷霆,余镇危.一种网络流量预测的小波神经网络模型[J].计算机应用，2006,26(3):526-528.
[97]谭满春,李英俊,徐建闽.基于小波消噪的ARIMA与SVM组合交通流预测[J].公路交通科技,2009,26(7):127-133.
[98]张涛,陈先,谢美萍,等.基于K临近非参数回归的短时交通流预测方法[J].系统工程理论与实践,2010,30(2):376-384.
[99] Yakowitz S. Nearest-neighbour methods for time series analysis [J]. Journal of Time SeriesAnalysis,1987,8(2):10-26.
[100] Clark S. Traffic Prediction using Multivariate Nonparametric Regression [J].Journal ofTransportation Engineering,2003,129(2):161-168.
[101]宫晓燕,汤淑明.基于非参数回归的短时交通流预测与实践检测综合算法[J].中国公路学报,2003,16(1):82-86.
[102]张晓利.基于非参数回归的短时交通流量预测方法研究[博士学位论文].天津:天津大学，2007.
[103] Smith B L, Oswald R K. Effects of Parameter Selection on Forecast Accuracy and ExecutionTime in Nonparametric Regression [C]. Proceedings of2000IEEE Intelligent TransportationSystem，Dearborn(MI), USA, Oct2000:252-257.
[104]张文星.回避禁行道路的路径规划方法、导航方法及终端:中国,201210217391.3.2012-10-03.
[105] Yen J Y. Finding the k shortest loopless paths in a network [J]. Management Science,1971,17(11):712-716.
[106] Hershberger J, Maxel M, Suri S. Finding the k shortest simple paths: A new algorithm and itsimplementation [J]. ACM Transactions Algorithms,2007,3(4), No.45.
[107] Malviya N, Madden S, Bhattacharya A. A Continuous Query System for Dynamic RoutePlanning. In Proceedings of International Conference on Data Engineering, Apr2011:792-823.
[108] Martins E Q V, Pascoal M M B, Santos J L E. Deviation algorithms for ranking shortestpaths [J]. International Journal of Foundations of Computer Science,1999,10(3):247-261.
[109] Jimenez V M, Marzal A. Computing the K shortest paths: a new algorithm and anexperimental comparison [J]. Springer-Verlag, Lecture Notes in Computer Science Series,1999(1688):15-29.
[110]高松,陆锋. K则最短路径算法效率与精度评估[J].2009,14(8):1677-1683.
[111] Chen Y Y, Bell M G H, Bogenberger K. Reliable Pretrip Multi-path Planning and DynamicAdaptation for a Centralized Road Navigation System [J]. IEEE Transactions on IntelligentTransportation Systems,2007,8(1):257-262.
[112] Dinic E A. Algorithm for solution of a problem of maximum flow in a network with powerestimation [J]. Soviet Mathmatics Doklady,1970,11(5):248-264.
[113] Torrieri D. Algorithms for finding an optimal set of short disjoint paths in a communicationnetwork [J]. IEEE Transactions on Communications,1992,40(11):1698-1702.
[114] Dees J, Geisberger R, Sanders P, et al. Defining and Computing Alternative Routes in RoadNetworks. Technical report, Feb2010.
[115] Bader R, Dees J, Geisberger R, et al. Alternative Route Graphs in Road Networks.Proceedings of the First international ICST conference on Theory and practice of algorithmsin (computer) systems,2011,21-32.
[116] Dijkstra E W. A note on two problems in connexion with graphs [J]. Numerical mathematics，1959(1):269-271.
[117] Hart E P, Nilsson N J, Raphael B. A Formal Basis for the Heuristic Determination ofMinimum Cost Paths [J]. IEEE Transcations on Systems Science and Cybernetics,1968,4(2):100-107.
[118] Nicholson T A J. Finding the shortest route between two points in a network [J]. TheComputer Journal,1966,9(3):275-280.
[119]宋青,汪小帆.路径规划算法加速技术研究综述[J].电子科技大学学报,2012,41(2):176-184.
[120] Dreyfus E S. An appraisal of some shortest path algorthims [J]. Operations Research.1969(17):295-412.
[121] Jagadeesh G R, Srikanthan T, Quek K H. Heuristic techniques for accelerating hierarchicalrouting on road networks [J]. IEEE Transactions on Intelligent Transportation Systems,2002,3(4):301-309.
[122] Jung S, Parmanik S. An efficient path computation model for hierarchically structuredtopographical road maps [J]. IEEE Transcations on Knowledge&Data Engineering.2002,14(5):1029-1046.
[123] Hilger M. Accelerating point-to-point shortest path computations in large scale networks [D].Berlin: Technische Universit t Berlin,2007.
[124] Song Qing, Wang Xiaofan. Efficient Routing on Large Road Networks Using hierarchicalCommunities [J]. IEEE Transactions on Intelligent Transportation Systems,2011,12(1):132-140.
[125] Goldberg A V, Harrelson C. Computing the shortest path: A*meets graph theory [C].16thACM-SIAM Symposium on Discrete Algorithms,2005:156-165.
[126] Goldberg A V, Werneck R F. Computing Point-to-Point Shortest Paths from ExternalMemory [C]. In workshop on Algorithm Engineering and Experiment,2005:26-40.
[127] Lauther U. An extremely fast, exact algorithm for finding shortest paths in static networkswith geographical background. Geoinformation und Mobilitat.2004(22):219-230.
[128] Schultes D. Fast and Exact Shortest Path Queries Using Highway Hierarchies [D]. Germany:Universitt des Saarlandes, Department of Computer Science,2005.
[129] Schultes D. Route Planning in Road Networks [D]. Karlsruhe: Universit t Fridericiana zuKarlsruhe,2008.
[130] Geisberger R. Contraction Hierarchies: Faster and Simpler Hierarchical Routing in RoadNetworks [D]. Karlsruhe: Universit t Fridericiana zu Karlsruhe,2008.
[131] Holzer M, Schulz F, Willhalm T. Combining speed-up techniques for shortest-pathcomputations. Lecture Notes in Computer Science, Springer,2004,3059:269-284.
[132] Bauer Reinhard, Delling D, Sanders P, et al. Combining Hierarchical and Goal-DirectedSpeed-Up Thchniques for Dijkstra’s Algorithm [J]. Lecture Notes in Computer Science,2008(5038):303-318.
[133]李挺.车辆自主导航的广域蛛式地图与点状路网跨层路径规划[博士学位论文].北京.清华大学,2008.
[134]郭璘,陈纯,方廷健,等.浮动车样本规模的优化方法与仿真研究[J].系统仿真学报,2009,21(16):5227-5230.
[135]李清泉,尹建忠,贺奋琴.面向道路网的GPS浮动车覆盖率模型研究[J].武汉大学学报(信息科学版),2009,34(6):715-718.
[136]周舒杰,廖孝勇,赵敏,等.面向道路网的浮动车最小覆盖率模型[J].重庆工学院学报(自然科学版),2009,23(4):11-14.
[137]北京市交委.北京市“十二五”时期交通发展建设规划.[2013-01-28]. http://www.chinahighway.com/news/2012/689803.php.
[138] BOX, G.E.P., and COX, D.R. An Analysis of Transformations [J]. Journal of the RoyalStatistics Socity, Ser.B.1964(26):211-252.
[139] Lakhina A, Papagiannaki K, Crovella M, et al. Structural analysis of network traffic flows[J]. in Proc. SIGMETRICS,2004,32(1):61–72.
[140]梁保松,曹殿立.模糊数学及其应用.北京:科学出版社,2007.
[141]王钊.车辆导航电子地图的自增量更新[博士学位论文].北京:清华大学,2012.