共查询到20条相似文献，搜索用时 171 毫秒
1.
为方便公众优化出行路径,规避或减少空气污染暴露损害,提出一种基于低空气污染暴露的健康出行路径动态搜索算法（dynamic healthy-route search algorithm,DHRSA）,并设计开发了相应健康出行路线规划系统。该算法通过融合土地利用回归制图、暴露风险权重估算和Dijkstra最短路径搜索算法,基于实时空气污染情景动态规划健康出行路径。以长沙主城区为例进行随机车辆出行方式测试实验,通过比较DHRSA算法规划的健康出行路径与传统最短出行路径、最快出行路径的出行暴露风险,验证了该算法的可靠性与系统的实用价值。 相似文献
2.
3.
文章针对Dijkstra和Floyd算法特点及在智能运输中的特点,将两种算法结合起来,形成求解物流配送中两点间最短路径的优化算法-混合算法.该方法用Floyd计算多对顶点之间的最短路径,在路径中少数顶点之间的邻接关系发生变化时,利用Dijkstra计算这些顶点之间的最短路径,加上其余部分路径就得到该图中各对顶点之间的新的最短路径,在约束条件下最终求出各点间最短路径.实验证明,混合算法比Dijkstra及Floyd效率提高11％-20％.本文研究结果可对物流配送中最短路径的选择有所帮助. 相似文献
4.
5.
6.
Dijkstra最短路径算法改进研究及其在GIS-T仿真分析中的应用 总被引：1，自引：0，他引：1
Dijkstra算法是求解最短路径问题的经典算法,但在实际应用中还存在一些问题。提出了对传统的Dijkstra最短路径算法改进的新方法,即对复杂的公路网数据进行预处理,生成路网拓扑结构数据文件,并结合Dijkstra算法按路径长度递增次序产生最短路径的思想来求解公路网复杂线状图形的最短路径问题。 相似文献
7.
一种基于遗传算法的多模式多标准路径规划方法 总被引：2，自引：0，他引：2
单一路径评价标准难以满足日益多样化的出行路径规划需求。多标准路径规划成为公众出行服务的研究热点。然而,多标准路径规划本质上是具有NP特性的多标准决策问题,且涉及多种交通出行模式。多个不同标准的权重设置将直接影响路径规划结果。因此,如何科学合理地设置不同标准的权重成为多标准路径规划中的技术瓶颈。本文提出了一种适应多模式交通网络环境的多标准路径规划方法,借鉴遗传算法在求解多标准优化问题中的优势,将其扩展到多模式多标准路径规划中。该方法避免了不同出行标准权重设置中的主观性和不确定性,能够实现更为灵活的交通出行模式自动化组合,为出行者提供满足个性化需求的、多标准的出行路径规划服务。 相似文献
8.
9.
10.
GIS城市道路最短路径算法研究 总被引：1，自引：0，他引：1
本文紧密结合城市公交的特点,利用改进Dijkstra算法开发出一个针对城市道路系统的最短路径自动搜索信息系统,该系统通过在ArcGIS环境下建立空间数据库和属性数据库,在VB环境下利用改进Dijsktra算法对McObjecta控件进行二次开发而设计完成,能在0.20s完成500多个交叉口的计算并找出其最短路径,是一种... 相似文献
11.
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. 相似文献
12.
13.
面向对象的覆膜农田信息遥感表征方法 总被引：1，自引：0，他引：1
为解决复杂土地利用背景下覆膜农田信息遥感提取方法缺乏的问题,该文以河套灌区为研究区,以Sentinel-2A卫星数据为基础,结合面向对象影像分析和随机森林算法,开展了复杂土地利用背景下灌水与无灌水覆膜农田信息遥感同步提取研究。首先进行遥感影像尺度分割研究,优选出最佳分割尺度。在此基础上,提取光谱特征、纹理特征、几何特征,获取优化特征子集,并采用随机森林机器学习算法表征覆膜农田信息。研究表明,结合利用Sentinel-2A数据与OBIA方法能够有效表征覆膜农田信息,总体精度达93.03%,Kappa系数为0.91;其中,灌水覆膜农田用户精度为91.35%,制图精度为88.57%;无灌水覆膜农田用户精度为97.10%,制图精度为98.63%。研究证明了Sentinel-2A卫星数据和OBIA方法和机器学习算法在覆膜农田信息遥感表征中的应用潜力,能够为地物信息遥感表征研究中提供参考依据。 相似文献
14.
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. 相似文献
15.
VC环境下最短路径算法的实现 总被引：1，自引：0，他引：1
设计了一种方便查找及显示最短路径的数据结构,对仅研究计算一条最短路径的Dijkstra算法加以了改进,并在VC下实现一个顶点到另一个顶点的所有最短路径的查找。 相似文献
16.
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. 相似文献
17.
基于道路网络分析的Voronoi面域图构建算法 总被引：3，自引：3，他引：0
提出一种基于网络分析的Voronoi面域图和加权Voronoi面域图构建算法。鉴于道路网络在城市中心地、公共设施引力传导与功能覆盖上的重要作用,采用网络最短路径距离分析和最短路径时间分析构建的Voronoi面域图可以模拟出中心功能的辐射影响范围空间划分的实际情形,进而为空间分析和空间优化提供有力支持。算法过程主要包括:设施邻近道路结点检索和分界结点计算;基于网络最短路径分析Dijkstra算法和分界结点计算的网络Voronoi划分;基于空间离散化、邻近道路分析的空间Voronoi划分及其矢量化处理算法。计算实验结果表明本文提出算法可靠和高效,能够模拟出具有预期精度和形态复杂的网络Voronoi面域图形。 相似文献
18.
A Hybrid Link‐Node Approach for Finding Shortest Paths in Road Networks with Turn Restrictions 
下载免费PDF全文
下载免费PDF全文 Turn restrictions, such as ‘no left turn’ or ‘no U‐turn’, are commonly encountered in real road networks. These turn restrictions must be explicitly considered in the shortest path problem and ignoring them may lead to infeasible paths. In the present study, a hybrid link‐node Dijkstra's (HLND) algorithm is proposed to exactly solve the shortest path problem in road networks with turn restrictions. A new hybrid link–node labelling approach is devised by using a link–based labelling strategy at restricted nodes with turn restrictions, and a node‐based labelling strategy at unrestricted nodes without turn restrictions. Computational results for several real road networks show that the proposed HLND algorithm obtains the same optimal results as the link‐based Dijkstra's algorithm, while having a similar computational performance to the classical node‐based Dijkstra's algorithm. 相似文献
19.
在个性化推荐系统中,项目的内容特征是影响推荐精度的重要因素。针对传统协同推荐不能有效考虑项目内容特征的问题,在考虑传统用户-项目评分信息的基础上,引入项目的内容特征属性,构建基于多示例(MI)的用户评分信息表达模型。根据多示例学习模式具有一定容错性的特点,设计了基于多示例聚类的协同推荐算法,通过多示例聚类计算用户的最近邻集合,根据最近邻集合对用户评分进行预测。实验结果表明,基于MI聚类的协同过滤推荐算法提高了预测评分的准确度,且有效缓解了数据稀疏性问题 相似文献