• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Applications of advanced technologies in transportation >Examination of tree building and weight selection strategies for a discrete dynamic traffic assignment model
【24h】

Examination of tree building and weight selection strategies for a discrete dynamic traffic assignment model

机译：离散动态交通分配模型的树木建造和权重选择策略研究

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

摘要

This paper examines four minimum path tree building and weight selection strategies that will likely affect the accuracy and computing time of a discrete dynamic traffic assignment process. These four strategies represent a combination of two different tree-building strategies and two different tree weight selection strategies. Slice-by-slice tree building and step-by-step tree building are the two tree building strategies that can be used, and successive average and tedious search are the two methods that are considered for the tree weight selection. It is found that the slice-by-slice tree building can save considerable computing time when combined with successive average weight selection and considerable computer memory when combined with the weight search method with a relatively reasonable dynamic assignment outcome. The step-by-step tree building combined with successive average weight selection produces the most accurate assignment result.
机译：本文研究了四种最小路径树构建和权重选择策略，这些策略可能会影响离散动态交通分配过程的准确性和计算时间。这四种策略代表了两种不同的树木构建策略和两种不同的树木权重选择策略的组合。逐切片树构建和逐步树构建是可以使用的两种树构建策略，而连续平均和乏味搜索是选择树权重的两种方法。结果发现，与连续平均权重选择结合使用时，逐个切片的树结构可以节省大量计算时间，而与权重搜索方法结合使用时，可以节省相当多的计算机内存，并具有相对合理的动态分配结果。分步进行的树形构建与连续的平均权重选择相结合，可以产生最准确的分配结果。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号