摘要
主要研究随机路网中的最短路径问题,首先给出随机路网的定义,建立了随机路网的模型,假定路段的费用是满足正态分布的随机变量,并给出从历史数据中得到此变量的均值和方差的统计学方法;然后得出路径出行费用的均值及方差的递推公式,将费用的方差当作一个限制条件,从而在Dijkstra算法的基础上,提出了带单一限制条件的最短路径算法,同时给出了算法的具体流程;最后用一个简单例子演示了算法的具体步骤,并在南京路网中验证了此算法的实用性。
The shortest path problem in the stochastic traffic network is studied. First, the definition of stochastic traffic network is given and the stochastic network model is built. Assuming the link cost is the normally distributed random variable, a statistic method is proposed to get this random variable from historical data. Then the formulas to acquire the mean and variance of path cost is proposed. An algorithm of shortest path based on Dijkstra with single restriction （variance of link cost） is proposed. Finally, an example is given to show the algorithm.
出处
《公路交通科技》
CAS
CSCD
北大核心
2007年第9期112-115,共4页
Journal of Highway and Transportation Research and Development
基金
国家自然科学基金资助项目(50578037)
关键词
交通工程
最短路径问题
限制条件
随机路网
期望
方差
traffic engineering
shortest path problem
restriction
stochastic traffic network
mean
variance
