基质(化学分析)
计算机科学
路径(计算)
旅行时间
数学优化
钥匙(锁)
链接(几何体)
估计
算法
数学
工程类
程序设计语言
计算机网络
材料科学
计算机安全
系统工程
运输工程
复合材料
作者
K. Ashok,Moshe Ben‐Akiva
出处
期刊:Transportation Science
[Institute for Operations Research and the Management Sciences]
日期:2002-05-01
卷期号:36 (2): 184-198
被引量:215
标识
DOI:10.1287/trsc.36.2.184.563
摘要
This paper presents a new suite of models for the estimation and prediction of time-dependent Origin-Destination (O-D) matrices. The key contribution of the proposed approach is the explicit modeling and estimation of the dynamic mapping (the assignment matrix) between time-dependent O-D flows and link volumes. The assignment matrix depends upon underlying travel times and route choice fractions in the network. Since the travel times and route choice fractions are not known with certainty, the assignment matrix is prone to error. The proposed approach provides a systematic way of modeling this uncertainty to address both the offline and real-time versions of the O-D estimation/prediction problem. Preliminary empirical results indicate that generalized models with a stochastic assignment matrix could provide better results compared to conventional models with a fixed matrix.
科研通智能强力驱动
Strongly Powered by AbleSci AI