作　　者： ; ; ; ;

机构地区： 华南理工大学

出　　处： 《交通信息与安全》 2009年第3期32-34,38,共4页

摘　　要： 提出了一个基于Logit方法的动态交通随机分配模型,该模型通过最短路算法和随机分配来解决动态均衡交通分配中的出行选择问题,避免了以往动态交通均衡分配中解凸规划或非线性规划问题,同时不需要路径枚举,从而使本模型更适合于大型路网的动态交通分配.随后的算例证实了该模型的可行性。 A path search algorithm was presented, which combined dynamic departure time with stochastic user equilibrium assignment model （DDSUE）. In each iteration, this algorithm assigns O-D traffic demand to the generated paths by Logit method, then updates sections traffic volume and traveling time correspondingly, and then generates shortest path according to current sections traveling time. Traffic assignment was finished on the searched paths. It solves the problem of travel choices in the dynamic equilibrium traffic assignment, avoiding convex planning or nonlinear program- ming algorithm and it also does not require paths enumeration. Thus, it is suitable for applying to a large scale road network. The example proves that this algorithm is effective and feasible.

关 键 词： 动态交通分配 模型 最短路算法 随机用户均衡

领　　域： [交通运输工程] [交通运输工程]