...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Intelligent Transportation Systems >Estimation of Dynamic Origin–Destination Matrices Using Linear Assignment Matrix Approximations
【24h】

Estimation of Dynamic Origin–Destination Matrices Using Linear Assignment Matrix Approximations

机译：使用线性分配矩阵逼近估算动态原点到目的地矩阵

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This paper presents a general solution scheme for the problem of offline estimation of dynamic origin–destination (OD) demand matrices using traffic counts on some of the network links and historical demand information. The proposed method uses linear approximations of the assignment matrix, which maps the OD demand to link traffic counts. Several iterative algorithms that are based on this scheme are developed. The various algorithms are implemented in a tool that uses the mesoscopic traffic simulation model Mezzo to conduct network loadings. A case study network in Stockholm, Sweden, is used to test the proposed algorithms and to compare their performance with current state-of-the-art methods. The results demonstrate the applicability of the proposed methodology to efficiently obtain dynamic OD demand estimates for large and complex networks and that, computationally, this methodology outperforms existing methods.
机译：本文提出了一种通用解决方案，该方案使用某些网络链路上的流量计数和历史需求信息来离线估算动态来源-目的地（OD）需求矩阵。所提出的方法使用分配矩阵的线性近似，该线性近似将OD需求映射到链接流量计数。开发了几种基于该方案的迭代算法。各种算法是在使用介观流量模拟模型Mezzo进行网络负载的工具中实现的。瑞典斯德哥尔摩的一个案例研究网络用于测试提出的算法，并将其性能与当前的最新方法进行比较。结果表明，所提出的方法可有效地获取大型和复杂网络的动态OD需求估计值，并且在计算上，该方法优于现有方法。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号