共查询到18条相似文献,搜索用时 78 毫秒
1.
在建立时间依赖的动态交通网络模型的基础上,提出了基于遗传算法(GA)和GIS的动态路径诱导算法。针对动态交通网络的特性,设计了特定个体适应值函数和选择、交叉、变异算子。仿真实验结果验证了此算法的高效性。 相似文献
2.
传统网络图模型无法满足交通网络表达的需求,结点-连接模型与伪二重图等模型可以通过增加结点或孤段的数量来表达部分交通限制信息,但会导致查询代价的增加.网络超点模型通过结点的限制矩阵,表达交通网络中的交通限制信息,可以较好地解决了这一问题.论文针对超点模型及所表达的交通限制信息对最短路径算法加以改进,设计了基于超点模型的数据结构,并编程实现基于超点模型的最短路径查询方法. 相似文献
3.
针对动态变化交通流下的最优路径问题,提出基于Bellman-Ford算法的动态最优路径算法。并用试验与仿真说明该算法可以迅速完成动态最优路径的计算。结果显示,在处理该路段突发的交通堵塞状况时,该算法可以节约行驶权重百分比大约在30%~60%。 相似文献
4.
5.
交通限制条件下的最短路径算法分析与优化 总被引:3,自引:0,他引:3
通过对交通网络本身的特点及要求的分析与研究,介绍了一些适合道路网的经典最短路算法和数据存贮模式,探讨了在交通网络路线优化过程中需要特别处理的几个问题,如路口延误、禁行状态等,并在理论上给出了相应的解决方案。最后给出了一个路径搜索的实例。 相似文献
6.
7.
8.
城市交通网络面向对象的时空数据模型研究 总被引:3,自引:0,他引:3
原有的城市交通网络数据模型无法对大比例地图中道路的面状特征进行描述。本文引入面向对象的时空数据模型 ,把各种实体作为对象 ,把道路作为面状要素描述。作为面状要素的道路对象直接继承原有道路的非空间特征 ,通过道路中心线对象和交点对象来继承原有线状要素的道路特征 ,包括网络关系和叠加关系等 ,通过车道段对象来增加作为面状要素的道路特征 相似文献
9.
10.
11.
An optimum vehicular path algorithm for traffic network based on hierarchical spatial reasoning 总被引:5,自引:0,他引:5
Human beings' intellection is the characteristic of a distinct hierarchy and can be taken to construct a heuristic in the shortest path algorithms.It is detailed in this paper how to utilize the hierarchical reasoning on the basis of greedy and directional strategy to establish a spatial heuristic,so as to improve running efficiency and suitability of shortest path algorithm for traffic network.The authors divide urban traffic network into three hierarchies and set forward a new node hierarchy division rule to avoid the unreliable solution of shortest path.It is argued that the shortest path,no matter distance shortest or time shortest,is usually not the favorite of drivers in practice.Some factors difficult to expect or quantify influence the drivers' choice greatly.It makes the drivers prefer choosing a less shortest,but more reliable or flexible path to travel on.The presented optimum path algorithm,in addition to the improvement of the running efficiency of shortest path algorithms up to several times,reduces the emergence of those factors,conforms to the intellection characteristic of human beings,and is more easily accepted by drivers.Moreover,it does not require the completeness of networks in the lowest hierarchy and the applicability and fault tolerance of the algorithm have improved.The experiment result shows the advantages of the presented algorithm.The authors argued that the algorithm has great potential application for navigation systems of large-scale traffic networks. 相似文献
12.
Human beings’ intellection is the characteristic of a distinct hierarchy and can be taken to construct a heuristic in the shortest path algorithms. It is detailed in this paper how to utilize the hierarchical reasoning on the basis of greedy and directional strategy to establish a spatial heuristic, so as to improve running efficiency and suitability of shortest path algorithm for traffic network. The authors divide urban traffic network into three hierarchies and set forward a new node hierarchy division rule to avoid the unreliable solution of shortest path. It is argued that the shortest path, no matter distance shortest or time shortest, is usually not the favorite of drivers in practice. Some factors difficult to expect or quantify influence the drivers’ choice greatly. It makes the drivers prefer choosing a less shortest, but more reliable or flexible path to travel on. The presented optimum path algorithm, in addition to the improvement of the running efficiency of shortest path algorithms up to several times, reduces the emergence of those factors, conforms to the intellection characteristic of human beings, and is more easily accepted by drivers. Moreover, it does not require the completeness of networks in the lowest hierachy and the applicability and fault tolerance of the algorithm have improved. The experiment result shows the advantages of the presented algorithm. The authors argued that the algorithm has great potential application for navigation systems of large-scale traffic networks. 相似文献
13.
针对GIS空间分析需要经常解决的路径优化问题,本文研究了一种新型的群体智能空间路径优化算法,即海鸥优化算法(SOA)。通过重新定义海鸥位置的表示方式和更新策略,将海鸥优化算法从连续域转换到离散域,建立离散海鸥优化算法(DSOA),同时引入随机异变因子,使海鸥有能力跳出局部最优值。为了验证DSOA的可靠性,通过定义适应度函数和可行解空间,实现利用离散海鸥优化算法求解经典的旅行商最短路径问题。试验结果表明,DSOA在解决最优路径问题上具有良好的稳健性,在空间分析方面具有较强应用潜力。 相似文献
14.
15.
本文在分析Dijkstra算法基础上,考虑城市路网的特点及该算法在路径优化中的不足,提出一种基于双向搜索的Dijkstra改进算法,它可以减少路网节点的搜索范围和计算复杂度.仿真结果表明,改进算法在最短路径搜索中可使候选节点数减少15%~25%,当节点越多这种减少越明显,可提高搜索路径的实时性. 相似文献
16.
17.
18.
节点重要性对大规模道路网下最短路径的计算有着重要影响。本文提出了顾及节点重要性的最短路径估计方法,该方法基于Critic方法与复杂网络理论评价节点的重要性,结合限制策略实现网络划分,通过层次结构网络的构建,实现大规模道路网数据的有效化简和最短路径的快速有效计算。试验结果表明,该方法能够使中心节点均衡地分布于网络,更好地均衡划分后子网络的规模;随着限制参数的增大,网络规模逐渐降低,查询精度最高达到1.026,相比于单一指标和无限制参数的方法,本文方法显著降低了网络的规模,在最短路径的近似计算上保持了较高的准确性,为大规模复杂网络的近似分析提供分析思路。 相似文献