• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Networks & Spatial Economics >An Excess-Demand Dynamic Traffic Assignment Approach for Inferring Origin-Destination Trip Matrices
【24h】

An Excess-Demand Dynamic Traffic Assignment Approach for Inferring Origin-Destination Trip Matrices

机译：一种超需求的动态交通分配方法，用于推断始发地-目的地出行矩阵

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

摘要

The focus of this paper is on the development of an origin-destination (O-D) demand estimation method for dynamic equilibrium traffic networks. It is hypothesized that the underlying equilibrium conditions in such networks are a compromise result of minimization of individual routing costs, minimization of traffic count matching errors, and maximization of O-D demand entropies. By adding an upper bound of travel demand and a dummy path with constant travel cost to each O-D pair, we formulated the dynamic O-D demand estimation problem as an excess-demand dynamic traffic assignment (DTA) problem defined for an expanded network with dummy paths. Such a formulation enables us to apply existing DTA solution methods and software tools for deriving the path flow pattern in the expanded network and thus simultaneously obtaining the O-D demand pattern in the original network. Following this problem transformation and network expansion strategy, an iterative solution procedure is accordingly proposed, which resorts to repeatedly solving the excess-demand DTA problem and adjusting the dummy path costs. An application of the proposed modeling and solution methods for an example cell-based network problem favorably illustrates great promise of the methodological advance and solution performance.
机译：本文的重点是发展动态平衡交通网络的始发地（O-D）需求估算方法。假设这样的网络中的基本平衡条件是最小化单个路由成本，最小化通信量匹配错误以及最大化O-D需求熵的折衷结果。通过向每个O-D对增加旅行需求的上限和具有恒定旅行成本的虚拟路径，我们将动态O-D需求估计问题表述为为具有虚拟路径的扩展网络定义的超需求动态交通分配（DTA）问题。这样的表述使我们能够应用现有的DTA解决方案方法和软件工具来推导扩展网络中的路径流模式，从而同时获得原始网络中的O-D需求模式。根据这种问题转换和网络扩展策略，相应地提出了一种迭代解决方法，该方法将反复解决超额需求DTA问题并调整虚拟路径成本。所提出的建模和求解方法在基于示例小区的网络问题中的应用，很好地说明了方法学进步和求解性能的巨大希望。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号