预防拥挤漂移的带约束K则最优路径算法  

Constrained K-shortest Paths Algorithm to Prevent the Congestion Shifting Problem

作　　者：王媛[1] 杨兆升[1] 高鹏[1] 

机构地区：[1]吉林大学交通学院,长春130022

出　　处：《北京工业大学学报》2009年第3期345-349,共5页Journal of Beijing University of Technology

基　　金：863国家高技术研究发展计划(2007AA12Z242;2007AA11Z245)

摘　　要：为解决城市交通流诱导系统中存在的拥挤漂移问题,对拥挤漂移现象的形成机理和预防机制进行了深入的分析,并有针对性地提出了适用于导航用户的带约束K则最优路径算法.算法基于MapX控件编程实现,并采用VISSIM仿真软件进行了分析模拟验证.模拟效果表明:该算法有效地预防了拥挤漂移现象的发生,给出行者和整个交通系统带来效益.For a better solution of the congestion shifting problem in Urban Traffic Flow Guidance System (UTFGS),this paper analyzes the root causes of the congestion shifting problem and develops a constrained K-shortest paths algorithm suitable for the travelers.With the realization in the basis of MapX Control,the actual effect of this algorithm is tested with the micro simulation tool VISSIM.Conclusions could be drawn as follows,the constrained K-shortest paths algorithm can efficiently prevent the congestion shi...

关 键 词：交通运输系统工程 城市交通流诱导系统 K则最优路径 拥挤漂移 

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