摘要
讨论了适于估计起迄点出行分布矩阵 ( OD矩阵 )的交通检测点的合理分布问题 .根据检测点应当满足的规则 ,建立了关于检测点分布的非线性规划模型 .在已知极点间转移概率的前提下 ,将检测点的分布问题描述成一个平均报酬 Markov决策过程 ,并通过转化为一个等价的整数线性规划问题来求解 .最后实例结果表明该模型是有效的。
This paper discusses how to determine the optimal number and locations of traffic counting points in a road network for estimating the origin destination trip matrix. Based on location rules, a nonlinear programming model for determining the optimal locations of traffic counting points is addressed under a given OD distribution pattern. Such problem can also be described as an average reward Markov decision process (MDP) with additional constraints, which can be equivalent to an integer linear programming problem. The computational example shows that the results obtained are satisfactory.
出处
《自动化学报》
EI
CSCD
北大核心
2000年第3期303-309,共7页
Acta Automatica Sinica
基金
国家九五科技攻关项目!( 96 -A1 5 -0 2 -0 3)
关键词
交通检测点
最优分布
OD矩阵
整数线性规划
Origin destination trip matrix, traffic counting points, average reward Markov decision process, integer linear programming.
