.png){kind=icon}
返回
A gradient approximation approach for adjusting temporal origin-destination matrices
.png){kind=icon}
PRE
AI
DOI：10.1016/j.trc.2010.05.013.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The temporal demand matrix is an essential input to both on-line and off-line applications of dynamic traffic assignment (DTA). This paper presents a new method to solve the simultaneous adjustment of a dynamic traffic demand matrix, searching for a reliable solution with acceptable computational times for off-line applications and using as an input traffic counts and speeds, prior O-D matrices and other aggregate demand data (traffic demand productions by zone). The proposed solving procedure is a modification of the basic Simultaneous Perturbation Stochastic Approximation (SPSA) path search optimization method; it can find a good solution when the starting point (the seed matrix) is assumed to be near the optimal one, working with a gradient approximation based on a simultaneous perturbation of each demand variable. (C) 2010 Elsevier Ltd. All rights reserved.
Keyword:
Dynamic traffic assignment
Demand adjustment
SPSA
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.9
论文数:
4.9K
被引数:
3.2W
机构
引用论文
Calibrating aggregate travel demand models with traffic counts: Estimators and statistical performance.png)
TRANSPORTATION
TRANSPORTATIONIF3.3
PREAI
分享收藏
没有更多内容
没有更多内容