| 基于最短路径搜索的动态随机交通分配 |
| |
| 引用本文： | 温惠英,王晓巍,曹更永,黄永刚.基于最短路径搜索的动态随机交通分配[J].交通与计算机,2009,27(3):32-34,38. |
| |
| 作者姓名： | 温惠英 王晓巍 曹更永 黄永刚 |
| |
| 作者单位： | 华南理工大学,广州,510641 |
| |
| 摘 要： | 提出了一个基于Logit方法的动态交通随机分配模型，该模型通过最短路算法和随机分配来解决动态均衡交通分配中的出行选择问题，避免了以往动态交通均衡分配中解凸规划或非线性规划问题，同时不需要路径枚举，从而使本模型更适合于大型路网的动态交通分配．随后的算例证实了该模型的可行性。
|
| 关 键 词： | 动态交通分配 Logit模型 最短路算法 随机用户均衡 |
Dynamic Stochastic Traffic Assignment Based on Shortest Path Search |
| |
| WEN Huiying,WANG Xiaowei,CAO Gengyong,HUANG Yonggang.Dynamic Stochastic Traffic Assignment Based on Shortest Path Search[J].Computer and Communications,2009,27(3):32-34,38. |
| |
| Authors: | WEN Huiying WANG Xiaowei CAO Gengyong HUANG Yonggang |
| |
| Institution: | South China University of Technology;Guangzhou 510641;China |
| |
| Abstract: | 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 a... |
| |
| Keywords: | dynamic traffic assignment Logit model the shortest path algorithm stochastic user equilibrium |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
