改进的交通分配起点用户均衡算法

上海交通大学学报（自然版） ›› 2011, Vol. 45 ›› Issue (04): 510-516.

改进的交通分配起点用户均衡算法

张天然

（上海市城市综合交通规划研究所，上海 200040）

收稿日期:2010-06-17 出版日期:2011-04-29 发布日期:2011-04-29

Improved Origin User Equilibrium Algorithm for Traffic Assignment

ZHANG Tian-Ran

（Shanghai City Comprehensive Transportation Planning Institute, Shanghai 200040, China）

Received:2010-06-17 Online:2011-04-29 Published:2011-04-29

摘要/Abstract

摘要： 对起点用户均衡算法的流量转移、起点限制子网(Bush)的更新、成本更新策略及计算流程等关键问题进行了分析改进.探讨了Bush的最长和最短路径对查找方法，提出了流量转移的步长搜索方法及加速算法收敛的Bush更新方法.该方法优化了适合多线程开发的算法流程，并用不同规模的城市交通网络模型对算法进行效率测试和与其他算法进行对比.结果表明，该算法效率有较大的提高，可满足大规模城市交通网络模型计算速度和精度的要求.

关键词: 用户均衡交通分配, 起点用户均衡算法, 无环网络

Abstract: Key tactics of an origin user equilibrium (OUE) algorithm such as flow shift from max to minpaths, bush update and the algorithm’s procedure were studied. The finding of max and minpaths segmentation pair, the step size of bush flow shift and bush construction were studied to speed up the convergence. The algorithm’s procedure was also optimized to take the advantage of multithread process. Convergence performances were compared with other algorithms by different size of urban transportation network. The improved OUE algorithm is more efficient and converges satisfactorily in a practical application.

Key words: traffic assignment, origin user equilibrium algorithm, acyclic network

中图分类号:

U491

张天然. 改进的交通分配起点用户均衡算法[J]. 上海交通大学学报（自然版）, 2011, 45(04): 510-516.

ZHANG Tian-Ran. Improved Origin User Equilibrium Algorithm for Traffic Assignment[J]. Journal of Shanghai Jiaotong University, 2011, 45(04): 510-516.

参考文献

［1］Wardrop J G. Some theoretical aspects of road traffic research［J］. Proceedings of the Institute of Civil Engineers, 1952:1(3):325 －378.

［2］Beckmann M, McGuire C B, Winsten C B. Studies in the economics of transportation［M］. New Haven, Connecticut: Yale University Press, 1956.

［3］Leblance L J, Morlok E K, Pierskalla W. An efficient approach to solving the road network equilibrium traffic assignment problem ［J］. Transportation Research, 1975, 9(5): 309318.

［4］Boyce D, RalevicDekic B, BarGera H. Convergence of traffic assignments: How much is enough? ［J］. Journal of Transportation Engineering, 2004,130(1): 4955.

［5］Slavin H B, Rabinowicz A. An empirical comparison of alternative user equilibrium traffic assignment methods［DB/CD］. Strasbourg: Association for European Transport and contributors, 2006.

［6］Daneva M， Lindberg P O. A conjugate direction FrankWolfe method with applications to the traffic assignment problems［C］// International Conference on Operations Research 2002. New York: Springer,2002:133138.

［7］BarGera H. Originbased algorithm for the traffic assignment problem［J］. Transportation Science,2002,36(4):398417.

［8］Dial R B. A pathbased userequilibrium traffic assignment algorithm that obviates path storage and enumeration［J］. Transportation Research Part B, 2006: 40(10): 917936.

［9］Florian M. New look at projected gradient method for equilibrium assignment［DB/CD］. Washington: Transportation Research Board, 2009.

［10］Chen D H, Jayakrishnan L R. Computational study of stateoftheart pathbased traffic assignment algorithms［J］. Mathematics and Computers in Simulation,2002,59: 509518.

［11］Gentile G. Linear user cost equilibrium: A new algorithm for traffic assignment［DB/CD］. Washington: Transportation Research Board, 2008.

［12］Marco Y N. A class of bushbased algorithms for the traffic assignment problem［J］. Transportation Research Part B, 2010: 44(1): 7389.

[1]	林徐勋1, 隽志才1, 张伟华2, 倪安宁3. 基于停车换乘随机网络可靠性交通分配模型[J]. 上海交通大学学报（自然版）, 2011, 45(12): 1836-1840.
[2]	曲昭伟1, 路婷1, 王殿海1, 2, 郭伟伟1, 孙迪1. 协调交叉口间人行横道信号优化方法[J]. 上海交通大学学报（自然版）, 2011, 45(05): 682-686.
[3]	陈鹏,严新平,李旭宏，吴超仲,. 基于可拓学的轨道交通与常规公交换乘收益分配[J]. 上海交通大学学报（自然版）, 2010, 44(06): 797-0802.