基于斯塔克尔伯格博弈的路网均衡交通分配方法  

Road Network Equilibrium Traffic Assignment Method Based on Stackelberg Game

作　　者：袁长伟[1,2] 蔚欣欣[2] 陆化普[2] 卞长志[3] 

机构地区：[1]长安大学经济与管理学院,陕西西安710064 [2]清华大学交通研究所,北京100084 [3]中国城市规划设计研究院,北京100044

出　　处：《中国公路学报》2009年第5期89-93,共5页China Journal of Highway and Transport

基　　金：国家高技术研究发展计划("八六三"计划)项目(2007AA11Z202);国家自然科学基金青年科学基金项目(50808022)

摘　　要：为探讨更加符合实际的路网均衡交通分配方法,区别于传统的以用户效用最大化为目标、根据Wardrop均衡准则进行交通分配的方法,引入博弈论,假设路网上有2种用户,一种使用混合策略Nash均衡准则,另一种使用系统最优准则,据此假设建立基于斯塔克尔伯格博弈模型的路网均衡交通分配方法,并将目标函数转化为单层规划问题,采用广义乘子法求解。算例结果表明:斯塔克尔伯格博弈模型比用户最优模型的系统效率更高,接近于系统最优,但比系统最优更符合现实情况,也表明路网上存在部分按照路径诱导信息行驶的使用者会提高交通系统效率。In order to propose more realistic equilibrium traffic assignment method and distinguish traditional traffic assignment method based on the classical Wardropian principle assuming that users minimize either individual travel cost or overall system cost, authors adopted game theory and presented a Staekelberg routing game on the network which the system optimization player is the leader and the mixed-strategy Nash equilibrium players are the followers. Based on Stackelberg model, the road network equilibrium traffic assignment method was discussed, and the generalized Lagrange multiplier method was used to calculate objective function which was transferred into a single-level planning. The example result shows that the efficient of Stackelberg model is higher than that of the user-optimal system, which closes to system optimization, but more closes to reality easily. It indicates users that follow the route guidance information will improve the efficiency of transport system.

关 键 词：交通工程 交通分配 斯塔克尔伯格博弈 用户均衡 广义乘子法 

分 类 号：U491.123[交通运输工程—交通运输规划与管理]