期刊文献+

路段平均行程时间估计方法 被引量:23

Estimation method of average travel time for road sections
下载PDF
导出
摘要 为了有效利用线圈检测数据,精确估计路段平均行程时间,提出了一种路段平均行程时间估计方法。将路段平均行程时间分为平均行驶时间、平均排队时间和平均通过路口时间三部分。考虑线圈埋设的特点,通过估计平均行驶速度得到平均行驶时间。用分段时齐Poisson过程描述车辆驶入路段过程和驶离过程,用Markov排队模型描述车辆排队过程,用生灭过程描述排队车辆数,得到车辆排队模型,计算了路段有、无初始排队的平均排队时间。基于选取与路口相关的饱和流率和平均车长,计算了平均通过路口时间。计算结果表明:平均行程时间估计值与实测值的误差小于12%,说明路段平均行程时间估计方法可行。 In order to availably utilize loop data and estimate the average travel time of road sections accurately and quickly, an estimation method of average travel time was proposed. Average travel time was divided into average running time, average queue delay and average crossing intersection time. Average running time was calculated by using average speed based on taking account of the installation type differences of loops. Piece-wise time homogeneous Poisson process was used to describe the arrival and departure processes of vehicles, Markov model was used to describe the queue process of vehicles, birth and death process was used to model vehicles' number in queue, and two kinds of average queue times with initial queue and no initial queue were computed. Average crossing intersection time was computed based on average vehicle length and saturation volume rate at intersection. Computation result shows that the relative error between the measure value and computation value of average travel time is less than 12 %, so the method is feasible. 1 tab, 9 figs, 14 refs.
出处 《交通运输工程学报》 EI CSCD 北大核心 2008年第1期89-96,共8页 Journal of Traffic and Transportation Engineering
基金 国家863计划项目(2006AA11Z231) 国家973计划项目(2006CB705506) 国家自然科学基金项目(60374059) 轨道交通控制与安全国家重点实验室开放课题项目(SKL2007K011) 北京交通大学科技发展基金项目(DQJ05007)
关键词 智能交通系统 平均行程时间 线圈数据 Markov排队模型 POISSON过程 intelligent transportation systems average travel time loop data Markov queuemodel Poisson process
  • 相关文献

参考文献13

二级参考文献24

  • 1徐猛,史忠科.一类交通网络模型下路段行程时间的解析解[J].控制与决策,2004,19(9):1060-1063. 被引量:4
  • 2杨兆升.关于智能运输系统的关键理论——综合路段行程时间预测的研究[J].交通运输工程学报,2001,1(1):65-67. 被引量:54
  • 3邓自立,动态系统分析及其运用.建模、滤波、预报、控制的新方法和程序库,1985年
  • 4CAREY M,MCCARTNEY M.An Exit-Flow Model Used in Dynamic Traffic Assignment[J].Computers Operations Research,2004,31(10):1 583-1 602.
  • 5CAREY M,GE Y E.Comparing Whole-Link Travel Time Models[J].Transportation Research,2003,37(10):905-926.
  • 6RANB,BOYCE D E,LEBLANC L J.A New Class of Instantaneous Dynamic User-Optimal Traffic Assignment Models[J].Operations Research,1993,41(1):192-202.
  • 7RAN B,BOYCE D E.A Link-Based Variational Inequality Formulation of Ideal Dynamic Optimal Route Choice Problem[J].Transportation Research,1996,30(8):1-12.
  • 8HUANG H,LAM H.Modelling and Solving the Dynamic User Equilibrium Route and Departure Time Choice Problem in Network with Queues[J].Transportation Research,2002,36 (1):257-273.
  • 9DAGANZO C F.Properties of Link Travel Times Under Dynamic Load[J].Transportation Research,1995,29(2):95-98.
  • 10CAREY M,MCCARTNEY M.Behaviour of a WholeLink Travel-Time Model Used in Dynamic Traffic Assignment[J].Transportation Research,2002,36(1):83-95.

共引文献112

同被引文献208

引证文献23

二级引证文献117

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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