Application of a simulation-based dynamic traffic assignment model

M. Florian, M. Mahut, N. Tremblay
{"title":"Application of a simulation-based dynamic traffic assignment model","authors":"M. Florian, M. Mahut, N. Tremblay","doi":"10.1109/ITSC.2002.1041258","DOIUrl":null,"url":null,"abstract":"The evaluation of on-line intelligent transportation system (ITS) measures, such as adaptive route-guidance and traffic management systems, depend heavily on the use of faster than real time traffic simulation models. Fast-running traffic models are needed off-line for use in iterative approaches that imitate drivers' adaptation to changes to the network topology. The paper describes a simulation-based dynamic-equilibrium traffic assignment model. The determination of time-dependent path flows is modeled as a master problem that is solved using the method of successive averages (MSA). The determination of path travel times for a given set of path flows is the network-loading sub-problem, which is solved using the space-time queueing approach of Mahut (2000). This loading method has been shown to provide reasonably accurate results with very little computational effort. The model was applied to the Stockholm road network, which consists of 4342 links, 1980 nodes and 250 zones, representing over 11,000 turns. The results show that this model is applicable to medium-size networks with a very reasonable computation time.","PeriodicalId":365722,"journal":{"name":"Proceedings. The IEEE 5th International Conference on Intelligent Transportation Systems","volume":"64 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"136","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. The IEEE 5th International Conference on Intelligent Transportation Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITSC.2002.1041258","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 136

Abstract

The evaluation of on-line intelligent transportation system (ITS) measures, such as adaptive route-guidance and traffic management systems, depend heavily on the use of faster than real time traffic simulation models. Fast-running traffic models are needed off-line for use in iterative approaches that imitate drivers' adaptation to changes to the network topology. The paper describes a simulation-based dynamic-equilibrium traffic assignment model. The determination of time-dependent path flows is modeled as a master problem that is solved using the method of successive averages (MSA). The determination of path travel times for a given set of path flows is the network-loading sub-problem, which is solved using the space-time queueing approach of Mahut (2000). This loading method has been shown to provide reasonably accurate results with very little computational effort. The model was applied to the Stockholm road network, which consists of 4342 links, 1980 nodes and 250 zones, representing over 11,000 turns. The results show that this model is applicable to medium-size networks with a very reasonable computation time.
基于仿真的动态交通分配模型的应用
在线智能交通系统(ITS)措施的评估,如自适应路线引导和交通管理系统,在很大程度上依赖于使用比实时更快的交通仿真模型。在模拟驾驶员对网络拓扑变化的适应的迭代方法中,离线需要快速运行的交通模型。本文提出了一种基于仿真的动态均衡交通分配模型。将时变路径流的确定建模为一个主问题,用逐次平均法求解。给定一组路径流的路径行进时间的确定是网络加载子问题,该问题采用Mahut(2000)的时空排队方法解决。这种加载方法已被证明可以用很少的计算量提供相当精确的结果。该模型应用于斯德哥尔摩的道路网络,该网络由4342条线路,1980个节点和250个区域组成,代表超过11,000个转弯。结果表明,该模型适用于中等规模的网络,计算时间非常合理。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信