摘要
通过对网络结构进行分析,将网络模型用有向图进行表示,为其建立了基于概率预测的网络数学模型,并以解决交通拥堵问题为例,对该模型进行实际应用,为其设计出相应概率预测算法。通过对算法进行分析,进而抽象出一个更一般的网络数学模型,用线性规划算法给出这个模型的近似解法,以及迭代使用线性规划法的一个精确解法,通过精确解法的实验数据分析,得出贪婪算法在该模型中具有较高的效率。
This paper describes network model with directed graph,designs a probability precondition-based network model by analyzing network structure,using this model to solve traffic block,and gives corresponding probability prediction algorithm;another mathematical model is presented after algorithm analysis,an approximate algorithm and a precise algorithm are given for this model.Greedy algorithm is proved to be appropriate by analyzing data which of the experimental results.
出处
《计算机工程与应用》
CSCD
北大核心
2009年第18期59-61,69,共4页
Computer Engineering and Applications
关键词
网络
有向图
概率预测模型
关联矩阵
network
directed graph
probability prediction model
incidence matrix
