摘要
交通流分配,就是将预测得出的OD交通量,根据已知的道路网描述,按照一定的规则符合实际地分配到路网中的各条道路上去,进而求出路网中各路段的交通流量.而枚举OD对中所有的路径是进行交通分配的基础,对于大型复杂的路网,这项工作是比较困难的.该文提出了一种生成最短路径的方法,并结合博弈分配,将交通流分配在这些最短路径集上,避免进行大量枚举.文中将新算法与传统的logit分配算法做比较,最后用一个数值算例,说明了该算法的可行性和有效性.
The traffic flows assignment is to assign the 0D traffic volume forecasted to the each path of the road network according to the known road network description and certain rule, and then to get the traffic flow on each link. However enumerating paths between the OD pairs is the important basis of traffic assignment. It＇s difficult to enumerate paths for large and complex road network. Based on the new algorithm for generating the shortest path and game theory, a new traffic assignment model is presented, and the traffic flows are assigned on these shortest paths. In this article, the new algorithm with Logit assignment algorithm is compared. A numerical examples are given to show the model＇s feasibility and efficiency.
出处
《华南师范大学学报（自然科学版）》
CAS
北大核心
2009年第1期34-38,共5页
Journal of South China Normal University(Natural Science Edition)
基金
国家自然科学基金资助项目(60574071)
关键词
交通分配
博弈论
最短路
traffic assignment
game theory
the shortest path
