• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>9th World conference on transport research (9th WCTR) >AN APPROACH FOR ESTIMATING ANDUPDATING ORIGIN-DESTINATION MATRICESBASED ON TRAFFIC COUNTS PRESERVINGPRIOR STRUCTURE
【24h】

AN APPROACH FOR ESTIMATING ANDUPDATING ORIGIN-DESTINATION MATRICESBASED ON TRAFFIC COUNTS PRESERVINGPRIOR STRUCTURE

机译：基于流量计数优先结构的原始目的地矩阵估计和更新方法

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

摘要

This paper addresses the problem of estimating and updating observed OD matrices based onavailable link flow information by means of the non-linear programming formulationcorresponding to the Augmented Lagrangian Function. Hence, one can estimate larger ODmatrices in a faster way following an efficient algorithm that minimizes the amount of storedinformation required for solving large-size problems. A solution algorithm is provided, whichhas been completely developed and designed to be used within assignment commercial codes.The case of updating a trip matrix, from a home-based survey, of a real problemcorresponding to an existing city is analysed. For this application case two methodologies arereviewed, the first one does not incorporate either constraints related to the total number oftrips, the zonal productions and attractions, or individual OD pairs; the second one takesthem into account. The results obtained by the application of the method proposed, to a priorOD trip matrix, show huge differences with respect to the results yielded when the adjustmentprocess does not limit the variations of the single terms (OD pairs) by lower and upper bounds.
机译：本文通过对应于增强拉格朗日函数的非线性规划公式，解决了基于可用链接流信息估计和更新观测到的OD矩阵的问题。因此，遵循一种有效的算法，可以以更快的方式估计较大的OD矩阵，该算法可以最大程度地减少解决大型问题所需的存储信息量。提供了一种解决方案算法，该算法已经过完全开发和设计，可用于赋值商业代码。分析了基于家庭调查的旅行矩阵更新与现有城市相对应的实际问题的情况。在本应用案例中，对两种方法进行了回顾，第一种方法未包含与行程总数，地带产量和吸引力或单个OD对相关的约束；第二个考虑到了它们。当调整过程不通过上下限限制单个项（OD对）的变化时，通过将所提出的方法应用于先前的OD行程矩阵而获得的结果与所产生的结果相比显示出巨大的差异。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号