首页> 外文学位 >Hybrid empirical mode decomposition-neuro model for short-term travel time prediction on freeways.
【24h】

Hybrid empirical mode decomposition-neuro model for short-term travel time prediction on freeways.

机译:混合经验模式分解-神经网络模型用于高速公路的短期行驶时间预测。

获取原文
获取原文并翻译 | 示例

摘要

Accurate short-term prediction of travel time is central to many ITS systems, especially for ATIS and ATMS. In this study, we propose an innovative methodology for such prediction. Although the model can be theoretically used to predict traffic conditions using any of the three primary detector-based traffic parameters, the study was limited to the use of speed only as a single predictor. This was justified by the inherently direct derivation of travel time from speed data.; The proposed method is a hybrid one that combines the use of the Empirical Mode Decomposition (EMD) and a multilayer feedforward neural network with backpropagation. The EMD is the key part of the Hilbert-Huang Transform, which is a newly developed method at NASA for the analysis of non-stationary, nonlinear time series. The EMD is a straightforward to implement and computationally efficient method that is used to decompose any time series into a small number of its basic components, called the Intrinsic Mode Functions (IMFs). The rationale for using the EMD is that because of the highly nonlinear and non-stationary nature of link speed series, by decomposing the time series into its basic components, more accurate forecasts would be obtained.; We demonstrated the effectiveness of the proposed method by applying it to real-life loop detector data obtained from I-66 in Fairfax, Virginia. The method was used to predict link speeds for one through five periods ahead using 5-minute intervals across the eastbound direction of this corridor. To ensure proper testing, the data was compiled from different days with a wide range of traffic conditions, ranging from free-flow states to heavy congestion states. The prediction performance of the proposed method was found to be superior to previous forecasting techniques: conventional ANN, real profile, and historical profile. Rigorous testing of the distribution of prediction errors revealed that the model produced unbiased predictions of speeds. The superiority of the proposed model was also verified during peak periods, midday, and night.; In general, the method was accurate, computationally efficient, easy to implement in a field environment, and applicable to forecasting other traffic parameters. However, the proposed model requires additional effort on the part of the modeler. It also should be noted that the technique requires larger memory size for input feature expansion resulting from the EMD compared with a conventional ANN. Moreover, more testing of the effectiveness of the method under non-recurring congestion is recommended.
机译:准确的行程时间短期预测对于许多ITS系统都是至关重要的,尤其是对于ATIS和ATMS。在这项研究中,我们提出了一种创新的预测方法。尽管理论上可以使用基于三个主要检测器的交通参数中的任何一个模型来预测交通状况,但该研究仅限于将速度用作单个预测器。从速度数据固有地直接得出行程时间可以证明这一点。所提出的方法是一种混合方法,将经验模式分解(EMD)和多层前馈神经网络与反向传播相结合。 EMD是Hilbert-Huang变换的关键部分,Hilbert-Huang变换是NASA上最新开发的一种用于分析非平稳,非线性时间序列的方法。 EMD是一种易于实现且计算效率高的方法,用于将任何时间序列分解为少量的基本成分,称为本征模式函数(IMF)。使用EMD的基本原理是,由于链接速度序列具有高度非线性和非平稳的特性,因此通过将时间序列分解为基本成分,可以获得更准确的预测。通过将其应用于从弗吉尼亚州费尔法克斯市I-66获得的真实环路检测器数据,我们证明了该方法的有效性。该方法用于在该走廊的东行方向上每隔5分钟间隔预测前方一到五个时段的链接速度。为了确保进行正确的测试,数据是在不同的日期,不同的流量条件下进行编译的,流量条件从自由流动状态到严重拥塞状态不等。发现该方法的预测性能优于以前的预测技术:常规人工神经网络,真实剖面和历史剖面。对预测误差分布的严格测试表明,该模型产生了对速度的无偏预测。在高峰期,中午和晚上也验证了所提出模型的优越性。通常,该方法准确,计算效率高,易于在现场环境中实施,并且适用于预测其他交通参数。但是,建议的模型需要建模者付出额外的努力。还应该注意的是,与传统的ANN相比,该技术需要更大的存储空间来扩展EMD所导致的输入特征。此外,建议在非经常性拥塞情况下对该方法的有效性进行更多测试。

著录项

  • 作者

    Hamad, Khaled.;

  • 作者单位

    University of Delaware.;

  • 授予单位 University of Delaware.;
  • 学科 Engineering Civil.; Computer Science.; Transportation.
  • 学位 Ph.D.
  • 年度 2004
  • 页码 188 p.
  • 总页数 188
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 建筑科学;自动化技术、计算机技术;综合运输;
  • 关键词

  • 入库时间 2022-08-17 11:43:13

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号