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

发布时间：2018-01-16 20:22

本文关键词：面向出行时间可靠性的最优路径规划　出处：《公路》2017年02期 　论文类型：期刊论文

【摘要】：目前城市道路交通普遍存在交通拥挤、交通出行困难等问题。尤其是一些大城市,交通拥挤问题已成为制约城市进一步发展的重要问题。因此,提高出行者的出行效率和可靠性对解决交通拥挤问题具有重大意义。城市道路交通网络是一个典型的动态随机网络,网络中弧和节点的耗费是随机的,且随时间变化。其最优路径问题可以转化为图论网络中的最短路径问题。提出一种基于蒙特卡罗模拟和遗传算法的动态随机网络最短路径算法来解决城市道路交通网络的最优路径问题,并提出基于出行时长95%可靠性的最优路径选择方法来保证出行时间的可靠性。实验表明该算法可以很好地解决城市道路交通网络出行时间可靠性的问题,可以很好地运用到交通出行的路径规划中去。
[Abstract]:At present, there are many problems in urban road traffic, such as traffic congestion and travel difficulties. Especially in some big cities, traffic congestion has become an important problem restricting the further development of cities. Improving the travel efficiency and reliability of travelers is of great significance to solve the problem of traffic congestion. Urban road traffic network is a typical dynamic random network, the cost of arcs and nodes in the network is random. The optimal path problem can be transformed into the shortest path problem in graph theory network. A dynamic stochastic network shortest path algorithm based on Monte Carlo simulation and genetic algorithm is proposed to solve the urban road intersection. The optimal path problem of the network. An optimal path selection method based on trip time 95% reliability is proposed to ensure the reliability of travel time. Experiments show that the algorithm can solve the problem of travel time reliability of urban road traffic network. It can be well applied to the path planning of traffic travel.
【作者单位】：北京大学深圳研究生院城市规划与设计学院;
【分类号】：U491
【正文快照】： 城市交通问题是城市发展过程中不可回避的问题。随着小汽车持有量的持续增加,导致了城市道路交通流量的迅速增长。世界上的大城市都面临着交通拥堵、交通事故等问题。如何提高交通运输效率已成为交通领域的研究热点[1]。城市道路交通网络具有动态性和随机性的特点,这使得交通

【相似文献】