摘要
以吸引马尔可夫链为理论基础，在广义出行路径意义下，给出了交通量在路网节点间的一步转移概率矩阵，并以此为依据，得到了在给定Ｏ—Ｄ量下交通分配算法。
Taking the absorbing Markov chain as the theoretical basis, one-step transition probability matrix of traffic on general road network is defined in view of generalized O-D route. Then, the algorithm for traffic assignment problem with given O-D volume is putforwarded and the numerical example indicates that the usage of the model and algorithm are efficient.
出处
《控制与决策》
EI
CSCD
北大核心
1998年第A07期408-412,共5页
Control and Decision
基金
广东省自然科学基金
关键词
广义出行路径
交通分配
马尔可夫链
O-D量
generalized O-D route, traffic assignment, Markov chain, transition probability
