首页 | 本学科首页   官方微博 | 高级检索  
     检索      

路径信息诱导的双层规划模型
引用本文:徐丽丽,邵春福.路径信息诱导的双层规划模型[J].交通运输工程学报,2007,7(5):93-96.
作者姓名:徐丽丽  邵春福
作者单位:北京交通大学,交通运输学院,北京,100044
基金项目:国家重点基础研究发展计划(973计划) , 国家科技攻关计划
摘    要:为了缓解交通拥堵与提高路网运行效率,建立了路径诱导信息的双层规划模型。上层模型描述信息发布者通过交通诱导信息发布手段优化路网层面的性能函数,下层模型采用效用函数描述驾驶员最优路径选择行为,其决策变量为交通信息类型,从而将交通信息对于驾驶员路径选择行为的影响引入模型中。利用极点搜索算法对一个简单路网的双层规划模型进行算例分析,得出了各种交通信息条件下上层目标函数值。虽然计算结果存在8%~13%的波动范围,但交通拥堵时发布的拥堵消散信息是最优方案,定性信息带来的总体效益要好于指示信息,因此,该模型可行。

关 键 词:交通信息  双层规划模型  路径诱导  路径选择
文章编号:1671-1637(2007)05-0093-04
修稿时间:2007-04-22

Bi-level programming model of route traffic information guidance
Xu Li-li,Shao Chun-fu.Bi-level programming model of route traffic information guidance[J].Journal of Traffic and Transportation Engineering,2007,7(5):93-96.
Authors:Xu Li-li  Shao Chun-fu
Institution:School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China
Abstract:In order to reduce traffic congestion and improve road network efficiency,a bi-level programming model of route traffic information guidance was set up.Managers' optimal function about road network efficiency was optimized by providing different types of information in its upper model,the optimal route choice behavior of driver was described by using utility function in its lower model,its decision-making variables were information types,so that the influence of traffic information on the route choice behavior of driver was introduced into the model.A simple road network was analyzed by using extreme point search method,and the upper function values were computed under different traffic informations.Computation result shows that the fluctuation range of the values is from 8% to 13%,but the congestion vanishing information promulgated from the model in traffic congestion is optimal,the total benefit from qualitative information is greater than that from indication information,so the model is feasible.1 tab,3 figs,11 refs.
Keywords:traffic information  bi-level programming model  route guidance  route choice
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号