共查询到20条相似文献，搜索用时 31 毫秒
1.
Takeshi Shirabe 《International journal of geographical information science》2016,30(8):1469-1485
Given a grid of cells each having an associated cost value, a raster version of the least-cost path problem seeks a sequence of cells connecting two specified cells such that its total accumulated cost is minimized. Identifying least-cost paths is one of the most basic functions of raster-based geographic information systems. Existing algorithms are useful if the path width is assumed to be zero or negligible compared to the cell size. This assumption, however, may not be valid in many real-world applications ranging from wildlife corridor planning to highway alignment. This paper presents a method to solve a raster-based least-cost path problem whose solution is a path having a specified width in terms of Euclidean distance (rather than by number of cells). Assuming that all cell values are positive, it does so by transforming the given grid into a graph such that each node represents a neighborhood of a certain form determined by the specified path width, and each arc represents a possible transition from one neighborhood to another. An existing shortest path algorithm is then applied to the graph. This method is highly efficient, as the number of nodes in the transformed graph is not more than the number of cells in the given grid and decreases with the specified path width. However, a shortcoming of this method is the possibility of generating a self-intersecting path which occurs only when the given grid has an extremely skewed distribution of cost values. 相似文献
2.
为解决传统地图查询方法中对复杂地址对象难以定位的问题,该文面向地理网格的时空大数据分析需求,结合面要素特点与语义分析,提出一种面要素语义位置的GeoSOT网格定位方法。首先通过最小外包矩形(Minimum Bounding Rectangle,MBR)将面要素以九宫格形式分割成9个区块,单独计算各区块的网格编码集合;然后提取位置语句中的名称与空间关系,根据具体情境进行直接查询,或利用网格编码计算目标位置;最后根据语义考虑是否对编码结果做差集运算,从而得到目标的GeoSOT网格定位范围。实验表明,对比现有的地图服务,该方法能够实现语境更加复杂的位置定位,具有可行性和有效性,其提供的未知要素推理定位方法能够有效补充、扩展原有的面要素数据集,可为后续针对面状区域的时空大数据分析提供网格化的数据资源。 相似文献
3.
Rachel Mundeli Murekatete 《International journal of geographical information science》2018,32(11):2169-2188
Planners who are involved in locational decision-making often use raster-based geographic information systems to quantify the value of land in terms of suitability or cost for a certain use. From a computational point of view, this process can be seen as a transformation of one or more sets of values associated with a grid of cells into another set of such values through a function reflecting one or more criteria. While it is generally anticipated that different transformations lead to different ‘best’ locations, little has been known on how such differences arise (or do not arise). The paper attempts to answer this question in the context of path planning through a series of computational experiments using a number of random landscape grids with a variety of spatial and nonspatial structures. In the experiments, we generated least-cost paths on a number of cost grids transformed from the landscape grids using a variety of transformation parameters and analyzed the locations and (weighted) lengths of those paths. Results show that the same pair of terminal cells may well be connected by different least-cost paths on different cost grids though derived from the same landscape grid and that the variation among those paths is affected by how given values are distributed in the landscape grid as well as by how derived values are distributed in the cost grids. Most significantly, the variation tends to be smaller when the landscape grid contains more distinct patches of cells potentially attracting or distracting cost-saving passage or when the cost grid contains a smaller number of low-cost cells. 相似文献
4.
Dana Tomlin 《International journal of geographical information science》2013,27(9):1391-1413
To calculate the minimum cost of travel to each location within a geographical area from a specified set of locations, most geographic information systems represent that area as a rectangular grid of discrete cells, each indicating the cost of traversing that cell's particular location. These increments of cost are then accumulated by proceeding from cell to adjacent cell in a manner that resembles the propagation of waves. Because this propagation is limited to the eight directions associated with each cell's eight neighbors, however, it is often misdirected, and travel costs are therefore often overestimated. This article discusses the context, precedent, design, implementation, performance, and implications of a new algorithm that eliminates such problems in a straightforward manner. It does so by retaining the octangular propagation mechanism of earlier algorithms while keeping track of the particular locations at which propagated waves of accumulating travel cost either refract or diffract. The approach also holds promise for significant improvement in areas ranging from dispersion modeling and shape analysis to interpolation and the delineation of cost-minimizing paths. 相似文献
5.
等高线蕴含的历史高程信息可有效延长地形研究的时间序列,有利于深入挖掘地形变化长期规律,然而,图幅接边处的高程属性错误降低了等高线的数据质量,制约着等高线高程信息的实际应用。针对这一问题,该文提出一种基于层次格网索引的图幅接边处等高线高程错误识别和自动修正方法:首先,将层次格网索引与方向性二邻域算法相结合,以减少数据重复计算;然后,利用等高线空间位置标签及快速排序算法构建强空间位置关系,解决图幅接边处等高线匹配的准确性问题;最后,以高程冲突位点为驱动因子进行逻辑判断,实现等高线高程错误的识别及自动修正。实验结果表明:该方法运算效率较未进行效率优化时提高了203倍,接边处等高线高程错误识别与修正精度的最大值分别达97.71%和91.40%;相较于现有方法,该方法在精度和效率方面表现更佳,对区域性错误和变形等高线具有更高的适用性。 相似文献
6.
Alexandre B. Gonçalves 《International journal of geographical information science》2013,27(7):983-996
The computation of least-cost paths over a cost surface is a well-known and widely used capability of raster geographic information systems (GISs). It consists in finding the path with the lowest accumulated cost between two locations in a raster model of a cost surface, which results in a string-like, thin and long sequence of cells. In this article, a new extension of raster-based least-cost path modelling is proposed. The new modelling approach allows the computation of paths or corridors with a fixed width, larger than one cell. These swaths are called wide paths and may be useful in circumstances where the detail level of the raster cost surfaces is higher than the width of the desired path or corridor. The wide path model presented in the article is independent of the choice of least-cost algorithms, because the transformation from regular to wide paths is applied to the construction of nodes and edges of an induced graph. The article gives the foundations and discusses the particularities of such paths, regardless of the imposed width, and explores the difference from the usual least-cost path model. Test cases were included, one hypothetical and the other with real data. The results are coherent and indicative of the applicability of wide paths. 相似文献
7.
8.
H. Skov-Petersen M. Zachariasen P.K. Kefaloukos 《International journal of geographical information science》2013,27(11):1745-1758
Analysis of potential spatial behavior in transport infrastructures is usually carried out by means of a digital network. A basic condition for such a network analysis has traditionally been the desire to find solutions to optimization problems and to achieve greater efficiency in industry. Geographic information system (GIS) tools for network analysis are overwhelmingly targeted at finding solutions to optimization problems, which include the shortest path problem and the traveling salesman problem. This article addresses the problem of the lack of tools for finding solutions to a class of constraint satisfaction problems that are of potential interest to behavioral geographers. Constraint satisfaction problems differ from optimization problems in that they lack an expression to be maximized or minimized. We describe how a constraint-based approach to network analysis can be applied to search for ‘excess routes’ that are longer or in other ways exceed single, optimal routes. Our analysis considers both round-trips and travel from A to B and defines a set of constraints that can characterize such paths. We present a labeling algorithm that can generate solutions to such excess route problems. 相似文献
9.
韦伯型设施区位的可计算模型及其应用 总被引：4，自引：0，他引：4
设施布局是城市规划中的热点问题,其中具有代表性的韦伯型设施区位应用广泛,能够于离散的空间点区位中配置设施的最佳位置,可解决诸多类型设施的选址问题。以多设施重心模型、最大福利模型和p-中心模型为例,从地计算的角度出发研究其模型及可计算方法。运用可视化开发工具Delphi 7.0作为开发平台,使用建立在OCX技术基础上的专业GIS控件MapObjects进行集成二次开发,建立设施区位分析系统,实现模型的计算及地理分析功能,并以上海市松江区新桥镇社会事业发展规划为例,运用该系统解决其社会事业发展对应设施选址问题。结果表明具有合理性,能够作为设施规划布局的辅助决策依据。 相似文献
10.
Yong Gao Dan Jiang Yan Xu 《International journal of geographical information science》2018,32(8):1677-1696
The efficiency of taxi services in big cities influences not only the convenience of peoples’ travel but also urban traffic and profits for taxi drivers. To balance the demands and supplies of taxicabs, spatio-temporal knowledge mined from historical trajectories is recommended for both passengers finding an available taxicab and cabdrivers estimating the location of the next passenger. However, taxi trajectories are long sequences where single-step optimization cannot guarantee the global optimum. Taking long-term revenue as the goal, a novel method is proposed based on reinforcement learning to optimize taxi driving strategies for global profit maximization. This optimization problem is formulated as a Markov decision process for the whole taxi driving sequence. The state set in this model is defined as the taxi location and operation status. The action set includes the operation choices of empty driving, carrying passengers or waiting, and the subsequent driving behaviors. The reward, as the objective function for evaluating driving policies, is defined as the effective driving ratio that measures the total profit of a cabdriver in a working day. The optimal choice for cabdrivers at any location is learned by the Q-learning algorithm with maximum cumulative rewards. Utilizing historical trajectory data in Beijing, the experiments were conducted to test the accuracy and efficiency of the method. The results show that the method improves profits and efficiency for cabdrivers and increases the opportunities for passengers to find taxis as well. By replacing the reward function with other criteria, the method can also be used to discover and investigate novel spatial patterns. This new model is prior knowledge-free and globally optimal, which has advantages over previous methods. 相似文献
11.
滑坡负样本在统计型滑坡危险度制图中具有重要作用,能抑制统计模型对滑坡危险度的高估。当前滑坡负样本采样方法采集的负样本可信度未知,在负样本采样过程中,极有可能将那些潜在滑坡点错选为负样本,这些假的负样本会降低负样本集的质量和训练样本集的质量,进而影响统计模型的精度。本文基于“地理环境越相似、地理特征越相似”的地理学常识,认为与正样本有着相似地理环境的点极有可能是未来发生滑坡的点;与正样本的地理环境越不相似的点,则越有可能是负样本。基于此假设提出一种基于地理环境相似度的负样本可信度度量方法,将该方法应用于滑坡灾害频发的陇南山区油房沟流域,对油房沟进行滑坡负样本可信度评价制图;使用油房沟流域的滑坡发生初始面来验证该方法的有效性。结果发现：滑坡发生初始面上所有栅格点的负样本可信度平均值为0.26,超过95%的栅格点的负样本可信度都小于0.5,说明本文提出的负样本可信度度量方法合理。 相似文献
12.
基于GIS的社会统计数据空间化处理方法 总被引：6，自引：1，他引：6
社会统计数据的空间化是当前地理科学和社会科学共同研究的热点问题之一,根据社会统计数据的特点可以将其分为和值(extensive)变量型统计数据和均值(intensive)变量型统计数据两种类型.分析了这两类社会统计数据在区域拆分与合并时的特点,并尝试将网格单元面积权重内插(GCAWI)法引入社会统计数据的空间化的工作中,提出了确定网格单元大小的原则和采用图像平滑技术改进空问化结果的方法.以徐州市人均GDP数据(均值变量型统计数据)空间化为研究实例,采用网格单元面积权重内插法实现了徐州市人均GDP数据的空间化,而且运用图像平滑技术得到了比较满意的结果. 相似文献
13.
竞争型公共设施区位决策——概念、选址原则及模型构建 总被引：4，自引：3，他引：1
竞争型公共设施竞争性、公益性并存,其区位决策相对更加复杂。首先提出了“竞争型公共设施”的概念,指出“兼顾效率与公平的空间均衡”是其选址的基本原则,并概括出具体选址要求：遵循供需双方的空间相互作用模式、限制至邻近设施的最大出行成本、追求总出行成本最小化、约束设施规模门槛、与低层级设施在出行成本上相区分等。其次构建了基于概率分配规则的重力P中值模型,通过纳入设施规模因子实现区位和规模同步求解,并对邻近设施最大出行成本和设施最小规模进行约束,以实现空间公平-效率、服务质量公平与规模效率等多重目标。最后经过实证检验,优化后的设施布局更为均衡合理。 相似文献
14.
多叉树蚁群算法及在区位选址中的应用研究 总被引：3，自引：0，他引：3
本文提出了基于多叉树蚁群算法(ant colony optimization based on multi-way tree) 的区 位选址优化方法。在多目标和大型空间尺度约束条件下,地理区位选址的解决方案组合呈现 海量规模、空间搜索量庞大,难以求出理想解。基于多叉树的蚁群算法对地理空间进行多叉树划分,在多叉树的层上构造蚂蚁路径(ant path),让蚂蚁在多叉树的搜索路径上逐步留下信息 素,借助信息素的通讯来间接协作获得理想的候选解。采用该方法用于广州市的地理区位选址,取得良好结果。实验结果表明：采用基于多叉树的蚁群算法,改善了蚂蚁在空间搜索能 力,适合求解大规模空间下的区位选址问题。 相似文献
15.
问卷调查了酒泉市和嘉峪关市的41家工业企业,收集了大型工业企业的资料,了解影响工业企业选址和发展的主要区位条件。研究表明:韦伯工业区位论强调的成本因素和当地市场是影响内陆河流域工业企业选址和发展的主要区位条件,其中最重要的成本因素是临近原料地和优惠政策;远离大经济中心和经济发达区的相对区位劣势制约大部分企业的发展;虽然只有少部分企业认为水量、水质和水价是企业选址和发展的制约因素,但分析认为,水资源短缺对当地工业发展有不利影响,而受访企业可能没有意识到这些间接影响;相较其他城市,酒泉市企业选址中集聚经济因素的影响小。 相似文献
16.
The U.S. Geological Survey (USGS) is proposing to conduct a global mineral-resource assessment using geologic maps, significant deposits, and exploration history as minimal data requirements. Using a geologic map and locations of significant pluton-related deposits, the pluton-related-deposit tract maps from the USGS national mineral-resource assessment have been reproduced with GIS-based analysis and modeling techniques. Agreement, kappa, and Jaccard's C correlation statistics between the expert USGS and calculated tract maps of 87%, 40%, and 28%, respectively, have been achieved using a combination of weights-of-evidence and weighted logistic regression methods. Between the experts' and calculated maps, the ranking of states measured by total permissive area correlates at 84%. The disagreement between the experts and calculated results can be explained primarily by tracts defined by geophysical evidence not considered in the calculations, generalization of tracts by the experts, differences in map scales, and the experts' inclusion of large tracts that are arguably not permissive. This analysis shows that tracts for regional mineral-resource assessment approximating those delineated by USGS experts can be calculated using weights of evidence and weighted logistic regression, a geologic map, and the location of significant deposits. Weights of evidence and weighted logistic regression applied to a global geologic map could provide quickly a useful reconnaissance definition of tracts for mineral assessment that is tied to the data and is reproducible. 相似文献
17.
新重力P中值模型及其在城市综合医院区位决策中的实证检验——以无锡市为例 总被引：1，自引：0，他引：1
区位—分配模型是实现公共服务设施最适配置的有效方法之一。传统的P中值模型以效率作为导向,采用“邻近分配”规则,不考虑设施容量(规模),难以适应城市综合医院供需之间相互作用规律下适度均衡、居民随机概率式选择和区位与规模同步求解的布局要求。本文尝试以P中值模型为基础框架,在对P中值模型来源及其适用性进行分析的基础上,构建出基于供需双方(居民—综合医院)空间相互作用的重力P中值模型。新模型通过纳入“邻近就医”最大出行成本因子,确保居民至少邻近1所综合医院(保障空间公平);通过追求总加权出行成本最小化,确保设施空间配置效率;通过纳入设施容量规模因子实现设施区位和规模同时求解;通过纳入最小规模因子,保障设施规模效率和服务质量公平。进一步通过无锡市区综合医院空间配置进行实证检验发现：采用新模型优化后,综合医院空间配置更加公平、居民邻近就医更加便捷,且能够实现与社区卫生设施协同布局,使整个医疗设施体系空间布局更加合理。本文构建的新重力P中值模型(模型的变量参数可作适当调整)可用于竞争型公共设施区位决策,为相关设施布局调整或者规划提供决策依据。 相似文献
18.
Mountain glaciers are sensitive to environment. It is important to acquire ice flow velocities over time for glacier research and hazard forecast. For this paper, cross-correlating of optical images is used to monitor ice flow velocities, and an improvement, which is called ＂moving grid,＂ is made to this method. For this research, two remote-sensing images in a certain glacier area, dur-ing different times are selected. The first image is divided into grids, and we calculated the correlation coefficient of each window in the grid with the window on the second image. The window with the highest correlation coefficient is considered the counter-part one on the first image. The displacement of the two corresponding windows is the movement of the glacier, and it is used to calculate glacier surface velocity. Compared to the traditional way of dividing an image with ascertain grid, this method uses small steps to move the grid from one location to another adjacent location until the whole glacier area is covered in the image, thus in-creasing corresponding point density. We selected a glacier in the Tianshan Mountains for this experiment and used two re-mote-sensing images with a 10-year interval to determine this method. 相似文献
19.
城市边界识别是定性和定量研究城市的基础和前提,已有的关于城市边界提取的研究大都需要提前设定阈值或依赖人口统计数据。基于分形几何学,利用矢量建筑物分布数据识别城市边界,虽可克服这一缺陷,但国内城市边界的研究往往受阻于矢量建筑物分布数据获取困难。本文提出了一种基于道路交叉点的邻域扩张曲线作为识别城市边界的新方法。结果表明：该方法以电子地图为数据源,基于道路交叉点矢量数据进行研究时,城市集群数据随搜索半径增大而改变,城市扩张曲线中的最佳距离阈值是提取城市边界的关键;提取成都、西安、武汉、南京和长沙城市边界的最佳距离阈值分别为133、114、139、124和129 m,各城市的集群面积分别为769、350、270、317和359 km2。利用道路交叉点提取城市边界,方法简便可行,数据较易获得,本文结论有望为城市形态发展演变和城市规划等相关研究提供参考。 相似文献
20.
Dieudonné Tsatcha Éric Saux Christophe Claramunt 《International journal of geographical information science》2014,28(7):1355-1377
Route planning is an important problem for many real-time applications in open and complex environments. The maritime domain is a relevant example of such environments where dynamic phenomena and navigation constraints generate difficult route finding problems. This paper develops a spatial data structure that supports the search for an optimal route between two locations while minimizing a cost function. Although various search algorithms have been proposed so far (e.g. breadth-first search, bidirectional breadth-first search, Dijkstra’s algorithm, A*, etc.), this approach provides a bidirectional dynamic routing algorithm which is based on hexagonal meshes and an iterative deepening A* (IDA*) algorithm, and a front to front strategy using a dynamic graph that facilitates data accessibility. The whole approach is applied to the context of maritime navigation, taking into account navigation hazards and restricted areas. The algorithm developed searches for optimal routes while minimizing distance and computational time. 相似文献