面向出行时间可靠性的最优路径规划  

Optimal Travel Route Planning of Travel Time Reliability

作　　者：吴光周 杨家文[1] 

机构地区：[1]北京大学深圳研究生院城市规划与设计学院,深圳市518000

出　　处：《公路》2017年第2期134-142,共9页Highway

摘　　要：目前城市道路交通普遍存在交通拥挤、交通出行困难等问题。尤其是一些大城市,交通拥挤问题已成为制约城市进一步发展的重要问题。因此,提高出行者的出行效率和可靠性对解决交通拥挤问题具有重大意义。城市道路交通网络是一个典型的动态随机网络,网络中弧和节点的耗费是随机的,且随时间变化。其最优路径问题可以转化为图论网络中的最短路径问题。提出一种基于蒙特卡罗模拟和遗传算法的动态随机网络最短路径算法来解决城市道路交通网络的最优路径问题,并提出基于出行时长95%可靠性的最优路径选择方法来保证出行时间的可靠性。实验表明该算法可以很好地解决城市道路交通网络出行时间可靠性的问题,可以很好地运用到交通出行的路径规划中去。Nowadays traffic congestion and traffic travel difficulty are quite common m urban roaa network, especially in some of large cities, traffic congestion has become an outstanding issue to restrict the development of cities. Therefore, improve the travel efficiency and reliability of travelers have a great significance to solve the problem of traffic congestion. Urban road network is a typical dynamic and stochastic network, the state and cost of the arcs and nodes are constantly under change. Therefore the shortest path problem of individual travel is considered as a dynamic stochastic problem. In this paper, an optimal path algorithm is proposed based on Monte Carlo method and Genetic Algorithm to solve the shortest path problem of urban road network. And then a selection method of optimal path is put forward based on 95% reliability of travel time to ensure the reliability of travel time. Experiments show that the algorithm can solve the urban road traffic network travel time reliability problems and it can be well applied to traffic travel path planning.

关 键 词：交通拥挤 动态随机网络 出行时长 95%可靠性 最短路径算法 

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