| 摘 要: 城市交通情况复杂多变，交通事故、突发事件等更增加了车辆行驶时间的不确定性。本文是在此基础上进 行的最优路径的研究，旨在不确定条件下，找到可靠、快速、安全的最优路径。首先，不确定条件下分析不同车辆经过 每条路径的时间均值和标准差，给出每条路径的时间代价，所有路径中花费时间代价最小的即为最优路径。而最优路径 模型就是在合理的假设下利用迪杰斯特拉算法得到最小的时间代价，并实际应用到市区交通网络，得到绕过拥挤路段的 最优路径。本文主要叙述不确定条件下两点交通的最优路径以及交通网络的最优路径研究。 |
| 关键词: 最优路径;时间代价;迪杰斯特拉算法;两点交通;交通网络 |
|
中图分类号: TP311
文献标识码: A
|
|
| Study on Optimal Routing under Uncertain Conditions |
|
GU Aihua，GUO Qinghui
|
( College of Information Engineering, Yancheng Teachers University, Yancheng 224002, China)
|
| Abstract: Urban traffic is complicated and changeable.Traffic accidents,emergencies,etc.also increased the vehicle driving time of uncertainty.This paper is based on the optimal path of the study,aimed at uncertain conditions,to find a reliable,fast and safe optimal path.First,under the uncertain conditions,the time mean and standard deviation of each vehicle passing through each path are analyzed,and the time cost of each path is given.The minimum cost of all paths is the optimal path.The optimal path model is to use the Dijkstra algorithm to get the minimum time cost under reasonable assumptions, and apply it to the urban traffic network,and get the optimal path to bypass the crowded road.In this paper,the optimal path of two-point traffic under uncertain conditions and the optimal path of traffic network are discussed. |
| Keywords: optimal path;time cost;dijkstra algorithm;two-point traffic;traffic network |
