动态限制搜索区域的带约束K则最优路径算法

Constrained K-shortest paths algorithm within dynamic restricted searching area

为了有效解决分布式动态诱导系统中存在的拥挤漂移问题,有针对性地根据城市交通网络的空间分布特性提出了适合于导航用户使用的动态限制搜索区域的带约束K则最优路径算法。该算法基于MAPX控件编程实现,并采用VISSIM仿真软件进行了模拟和测试。实验结果表明:该算法一方面合理限制了路网的搜索规模、显著提高了路径优化算法的执行效率;另一方面又有效均衡了路网上的交通流,预防了拥挤漂移现象的发生,为个体出行者和整个交通系统带来效益。

For a better solution of the congestion shifting problem in DDVGS(Distributed Dynamic Route Guidance System),this paper develops a constrained K-shortest paths algorithm within a dynamic restricted searching area in consideration of a real city road net spatial distribution features which is suitable for the travelers and realizes its program on the basis of MAPX Control.The actual effect of this algorithm is tested with the micro simulation tool VISSIM.Some conclusions have been drawn as follows,the constrained K-shortest paths algorithm can not only decrease the searching scale and improve its running efficiency but also efficiently balance the traffic flow and prevent the congestion shifting problem,so that both the travelers and the whole system could benefit a lot from this.