共查询到20条相似文献，搜索用时 31 毫秒
1.
最短路径是现代物流配送研究中热点问题之一,在分析传统启发式搜索算法的基础上,针对算法在路径优化中存在的不足,提出基于二叉树优化启发式搜索算法（A＊）实现所需结点之间最短路径查询,在引入已知的全局信息条件下选择下一个被检查的结点,并根据用户给出的起始顶点与目标顶点以及搜索的角度查找最短路径,从而搜索可能性较大的结点,提高搜索过程的效率.实验表明,基于二叉树的A＊比A＊效率提高11％～26％. 相似文献
2.
3.
将Isomap流形学习方法应用于高光谱影像非线性降维时,在构建最短路径过程中,其边界点往往被忽略而没有低维流形坐标。对此,引入偏最小二乘方法来模拟修复遗失点的流形坐标,并从两个方面进行了综合评价。实验结果表明,模拟流形坐标与实际坐标吻合很好。 相似文献
4.
路网环境下的k最近邻查询方法在地理信息系统、智慧城市、数据挖掘、医疗营救和物流配送等领域都有着较为重要的作用,已有路网环境下的最近邻查询方法无法直接解决查询对象为点而数据对象为点和线段混合的复杂数据的近邻查询问题,为了弥补已有方法的不足,提出了路网环境下混合复杂数据的最近邻查询算法。将查询过程分为预处理、数据集约减和数据集精炼3个部分,并与3种对比算法进行对比实验,研究了测试数据对象的数量、路网规模的大小对中央处理器运行时间以及输入/输出代价的影响。结果表明,所提算法能有效地处理路网环境下混合数据的最近邻查询问题。 相似文献
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 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. 相似文献
6.
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. 相似文献
7.
8.
9.
最短路径分析是GIS空间分析中最基本和最关键的问题,Dijkstra算法是有效解决该问题的理论基础。本文基于GIS空间分析特征,从数据存储结构、搜索技术及网络算法本身等方面对传统Dijkstra算法进行了优化与改进,并对该算法在交通导航系统中的应用进行了探讨。 相似文献
10.
最短路径问题是地理网络分析中的重要问题之一，具有重要的应用价值。搜索最短路径的方法很多，在研究了各种方法后，本文提出了在ArcGIS矢量图中搜索最短路径的新方法。首先，提取经过ArcGIS简单处理的矢量图的信息，然后，借助Floyd算法，用MATLAB建模来提取节点间的最短路径，最后根据模型运算的结果在矢量图中绘出最短路径。试验证明，该方法操作简单，效果良好。 相似文献
11.
将行人的生理因素与GIS路径分析有机结合起来,根据生理学研究进展,建立了步行体能消耗计算模型,并提出了基于坡度转换的等效水平距离计算原则,从而将三维空间距离转换为等体能消耗平面距离,实现了顾及地形起伏的最优路径算法。实验结果表明,该算法具有兼顾坡度与距离关系的优势,提高了路径分析方法的有效性。 相似文献
12.
13.
The problem of finding the K shortest paths (KSPs) between a pair of nodes in a road network is an important network optimization problem with broad applications. Yen's algorithm is a classical algorithm for exactly solving the KSP problem. However, it requires numerous shortest path searches, which can be computationally intensive for real large networks. This study proposes a fast algorithm by introducing a generalized spur path reuse technique. Using this technique, shortest paths calculated during the KSP finding process are stored. Accordingly, many shortest path searches can be avoided by reusing these stored paths. The results of computational experiments on several large‐scale road networks show that the introduced generalized spur path reuse technique can avoid more than 98% of shortest path searches in the KSP finding process. The proposed algorithm speeds up Yen's algorithm by up to 98.7 times in experimental networks. 相似文献
14.
15.
基于最少换乘的公交最优路径算法的设计与实现 总被引：13，自引：0，他引：13
提出了基于最少换乘的公交最优路径理论，在此基础上设计了公交最少换乘的算法。由于算法本身的独特性，笔者将“图算法”部署到空间网络数据库中加以实现，利用数据库的快速查询、索引支持和在集合运算方面的优秀性能解决了算法的效率问题。同时还利用此类数据库系统对空间查询的支持，确保算法在求取最少换乘后可以兼顾距离最短的要求。 相似文献
16.
实现控制网最小独立异步环的计算机自动搜索是一项较为复杂、繁琐的工作,目前介绍此工作方法的文献大多是阐述过程中的某一部分,并且部分细节问题讨论得较少。文中以帮助初学者对此项工作形成完备的认识并能够自主编程实现为目的,以GNSS控制网为例,详细介绍基于生成树的控制网最小独立异步环自动搜索方法,内容包括生成树的定义及建立方法,最短路径搜索-Dijkstra算法的原理与实现步骤,利用生成树与最短路径搜索算法搜索最小独立闭合环的原理及具体实现步骤,以及同步观测环的自动搜索方法。最后以一个控制网实例说明此方法的可行性。 相似文献
17.
基于Harris与RANSAC算法的无人机影像拼接方法研究 总被引：1，自引：0，他引：1
针对Harris算法在进行无人机影像拼接时的特征点误匹配问题,利用RANSAC算法对误匹配的特征点进行剔除,进而实现无人机影像的无缝拼接。首先,基于Harris算法提取兴趣点,利用最短欧式距离进行特征匹配;然后,利用RANSAC算法实现对特征点的精确匹配;最后,利用RANSAC算法得到的单应性矩阵完成无人机影像拼接。实验结果表明:本文方法能够较好地剔除无人机影像拼接时误匹配的特征点,实现对无人机影像的拼接,拼接效果良好。 相似文献
18.
本文提出了一种抛物线加权平均曲线光滑插值算法。它满足了一个特殊的要求，即曲线通过全部节点且到弦的垂直距离最短。同时，将张力系数引入该方法中，并给出了包含张力系数的光滑方程。 相似文献
19.
针对障碍存在情况下距离变换研究较少的问题,提出了一种基于元胞自动机的绕障欧氏距离变换方法。以南海为例,基于海陆分布数据和目标点数据,以最短绕障路径长度为元胞状态,设计了包含距离算子的元胞状态转换规则。通过元胞自动机模拟距离扩散计算过程,得到绕障距离变换结果,并分析了绕障效果和精度。结果表明:本文方法动态直观地展示了绕障距离变换过程,能够自动计算绕过障碍的最短距离;具有更新机制,能够根据邻域的变化修正状态值;为绕障距离变换问题提供了一种近似的解决途径,错误率低于3.96%,可应用于航线设计、海上救助等领域。 相似文献