摘要
对用于随机交通分配的三种不同路径进行了比较和分析 ,研究了无环简单路径的寻求方法和无环简单路径集上的随机交通分配问题 .重新定义了有效路径 ,提出通过利用求解确定性用户均衡分配问题的迭代过程来产生有效路径的启发式方法 ,算例表明该方法是有效性的 .
This paper compares three different types of network paths which are used in stochastic traffic assignment, and presents a new method for implementing stochastic assignment excluding all cyclic flows. The paper further redefines the concept of efficient paths and develops a heuristic to create efficient paths by utilizing the iterative process of solving deterministic user-equilibrium assignment. Numerical results are presented to validate the proposed approaches.
出处
《交通运输系统工程与信息》
EI
CSCD
2003年第1期28-32,共5页
Journal of Transportation Systems Engineering and Information Technology
基金
国家杰出青年科学基金 ( 7982 5 1 0 1 )
