共查询到20条相似文献，搜索用时 15 毫秒
1.
基于栅格数据和图论算法的生态廊道识别 总被引：3，自引：0，他引：3
利用图论中最短路算法思想和ArcGIS的空间分析功能,对生境中动物迁徙廊道的识别与构建进行研究。通过对具有不同空间自相关特征的模拟景观进行分析,发现该方法具有较好的适应性,能识别出不同类型模拟景观的廊道。在模拟景观分析的基础上,将该算法应用于长沙市大河西先导区,计算了先导区重要栖息地之间的廊道。研究表明该计算方法提取的生态廊道具有明显的冗余性,充分反映了物种在不同栖息地之间迁徙的需求,具有一定的生态学意义。同时廊道提取结果在一定程度上反映了城市发展对生态系统尤其是生态廊道的胁迫与挤占。通过对廊道空间结构的分析还发现生态廊道存在一定的瓶颈区域,对该区域的生态恢复与重建将对物种多样性的保持起到关键作用。该方法为区域土地管理以及生态环境保护规划提供一定的科学依据。 相似文献
2.
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. 相似文献
3.
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. 相似文献
4.
Jonathan B. Thayn Kathryn Sampeck Matthew Spaccapaniccia 《The Professional geographer》2016,68(4):595-602
A least-cost path (LCP) analysis and a circuit theory analysis were used to estimate the path followed by Hernando de Soto as he crossed the Appalachian Mountains between Tennessee and North Carolina in 1540. The analyses were performed on the slope of the terrain and on a function of the slope that estimates hiking speed. The analyses were performed on data sets with 90-m and 180-m spatial resolutions. Three potential routes were found and compared. The most novel element of the work was the use of CircuitScape software, which returned the likelihood that each cell in the raster data was a part of de Soto's route. This clearly illuminated areas where the estimated routes were more constrained and areas where de Soto would have been free to take alternate paths without increasing travel time. The two analysis methods, LCP and circuit theory, corroborate one another and provide insight into de Soto's journey. 相似文献
5.
旅游扶贫重点村空间可达性分布特征及影响因素研究 总被引：2，自引：1，他引：1
在国家提出乡村振兴和旅游扶贫政策的大背景下,为了发挥旅游交通在区域发展中的带动作用,为旅游扶贫重点村建设和加快区域脱贫提供理论依据,文章以湖北武陵山区258个旅游扶贫重点村为研究样本,运用栅格成本加权距离算法与地理加权回归模型(GWR)对其旅游交通可达性及影响因素在空间上影响程度及作用方向的差异进行了探究。研究发现：湖北武陵山区内旅游扶贫重点村的平均可达时间为1.82 h,区域整体可达性相对较差,出行成本较高;从自然及人文2个视角对旅游扶贫重点村可达性的影响因子进行提取,各个影响因子在区域上作用大小的排序为：距最邻近县市最短路径>高程>周边旅游资源禀赋>距河流最短距离>距周边景区最短距离>坡度,距河流最短距离及周边旅游资源禀赋与可达成本呈负相关关系,其余因素均与可达成本呈正相关关系;距周边景区最短距离与坡度值大小的单位变化对可达成本空间差异的影响不显著。 相似文献
6.
Guiyun Zhou Xiaoli Liu Suhua Fu Zhongxuan Sun 《International journal of geographical information science》2017,31(6):1061-1078
With the increasing sizes of digital elevation models (DEMs), there is a growing need to design parallel schemes for existing sequential algorithms that identify and fill depressions in raster DEMs. The Priority-Flood algorithm is the fastest sequential algorithm in the literature for depression identification and filling of raster DEMs, but it has had no parallel implementation since it was proposed approximately a decade ago. A parallel Priority-Flood algorithm based on the fastest sequential variant is proposed in this study. The algorithm partitions a DEM into stripes, processes each stripe using the sequential variant in many rounds, and progressively identifies more slope cells that are misidentified as depression cells in previous rounds. Both Open Multi-Processing (OpenMP)- and Message Passing Interface (MPI)-based implementations are presented. The speed-up ratios of the OpenMP-based implementation over the sequential algorithm are greater than four for all tested DEMs with eight computing threads. The mean speed-up ratio of our MPI-based implementation is greater than eight over TauDEM, which is a widely used MPI-based library for hydrologic information extraction. The speed-up ratios of our MPI-based implementation generally become larger with more computing nodes. This study shows that the Priority-Flood algorithm can be implemented in parallel, which makes it an ideal algorithm for depression identification and filling on both single computers and computer clusters. 相似文献
7.
城市旅游空间行为路径分析及优化——以南京市为例 总被引：1，自引：0，他引：1
城市旅游空间行为路径是旅游者在目的地城市区域内的空间移动轨迹,以典型旅游城市南京市为例,可总结出现有旅游流行为路径特征的弊端及其形成原因,并在此基础上提出通过旅游线路重组、旅游营销升级、旅游活动开展等策略实施空间行为路径优化,即:远距离客源由"单节点式"向"多节点式"路径转化;邻省客源由"线形旅游"向"环形旅游"路径转化;省内客源由"链式旅游"向"轴线辐射形旅游"路径转化;城市原住民由"单节点式"向"基营式旅游"路径转化。通过对旅游流空间行为路径的科学引导促进城市旅游的全面、健康发展。 相似文献
8.
T. Arentze H. Timmermans 《International journal of geographical information science》2013,27(7):631-651
Least-costs path finding methods belong to the standard toolkit of geographical information science and allow one to assign trips with known origin and destination to a transport network. An extension of the network representation is proposed that allows one to model complete trip chains (tours) that may involve multiple transport modes and multiple activities, as a least-cost path through the network. The extension is based on the notion that link costs may change as a consequence of activity and vehicle choices during the tour. The extended network or supernetwork contains as many copies of the network as there are possible activity–vehicle states and additional state transition links to interconnect them. In this way, not only the generalized link cost function, but also the start and end points of a path can be defined state dependently. A least-cost path through a multistate network defines an optimal sequence of travelling, transferring, parking, conducting activities and dropping off products of activities. An application shows how a multistate network can be constructed and used to assess the impacts of network design variables on path choice. 相似文献
9.
Yosoon Choi Choon Sunwoo Keith C. Clarke 《International journal of geographical information science》2013,27(12):1541-1567
A new raster‐based GIS model that combines multi‐criteria evaluation and least‐cost path analysis was developed to determine the optimal haulage routes of dump trucks in large scale open‐pit mines. The model logic can consider multiple criteria simultaneously (i.e. speed, water body, ore body, curve, visibility, haul road maintenance) and can rate the adverse factor scores of truck movement using fuzzy membership functions. After establishing the weights of five factors by pairwise comparisons, the average adverse score grid can be generated by the weighted linear combination of factor and constraint scores. New software, called Dump Traveler, was implemented to improve the availability of the developed model. An application to the Roto South pit in the Pasir open‐pit coal mine, Indonesia, showed that the software can provide rational solutions to determine the optimal routes on truck haulage operations. Moreover, the layout of available haul roads can be evaluated to consider the trade‐off between road maintenance costs and the potential for traffic jams. Variations of weights for factors were found to be sensitive to the optimal haulage routes determined by least‐cost path analysis. The software provides both optimal routes on truck haulage operations and approximately estimated travel times along the routes, therefore it can support other truck dispatching software that mainly considers scheduling problems. 相似文献
10.
基于耗费场的最优路径算法研究 总被引：4，自引：0，他引：4
在GIS中,有一类应用是基于连续分布耗费场的最优路径计算问题,如公路选线等。该文首先采用规则格网对耗费场进行建模,进而基于规则格网表现,分别建立网络实现模型和元胞自动机实现模型,并探讨了基于元胞自动机模型的最优路径算法,通过实例研究,说明了算法的正确性。 相似文献
11.
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. 相似文献
12.
Gang Liu Wen Long Jingchao Wang Peichao Gao Jing He Zhiyong Luo 《International journal of geographical information science》2018,32(9):1815-1836
Traffic congestion, a common and complicated phenomenon in urban transportation systems, is attracting increasing attention from researchers in Geographical Information Science (GIS) and other fields. In this study, we illustrate a general mechanism that reveals the relationship between travel time and dynamic traffic conditions. We measure a vehicle’s travel time to its destination along any path, where the travel time is calculated based on the path length and on the real-time traffic volume and transport capacity of each road segment on the path. On the basis of this measurement, we present a simple dynamic routing strategy that allows each vehicle to dynamically choose the path to its destination while imposing the minimum travel time. The application of our routing algorithm to the Chengdu street network, Barabási–Albert scale-free network and Erdös–Rényi random network shows that the proposed strategy remarkably improves network throughput and balances traffic load distribution. Our findings suggest that mining the time mechanism of network transport is important to explore efficient time-optimization routing algorithms to enhance the transport capacity of urban street networks and other kinds of networks. 相似文献
13.
基于出租车经验路径的城市可达性计算方法 总被引：1，自引：1，他引：0
可达性计算中,始发地-目的地(Origin-Destination, 简称OD)间的路径规划是一个很重要的问题。传统基于最短路径算法的路径规划存在与现实不符的可能,因此考虑出租车载客的经验路径,更符合现实的出行。本文基于潜能模型,综合考虑了人口分布、交通路网特征,兴趣点分布等因素,提出了城市可达性的计算方法,其中OD间行程时间采用出租车经验路径行程时间。然后以广州市中心城区为研究区域,进行网格划分,不同的网格分别作为OD;并采用一个月的广州出租车GPS数据,从中提取大量的载客经验路径,建立出租车经验路径数据库,将OD间的经验路径行程时间计算出来,最后完成了广州中心城区的可达性计算和分析。结果表明,广州中心城区可达性符合典型的势能分布,城市可达性在中心区最高,然后逐步向郊区递减。该结果验证了城市可达性计算方法具有较好的实用性和可计算性。 相似文献
14.
基于GIS的复杂地形洪水淹没区计算方法 总被引：64，自引：0，他引：64
利用GIS技术计算洪水淹没区范围一直是灾害评估研究中的一个热点问题。通过给出两种情形下基于种子蔓延算法的淹没区计算方法，即有源 淹没和无源淹没。淹没区计算精度主要取决于空间数据精度的优劣；种子蔓延算法及探测分辨率决定了整个模型的效率。文中最后给出了该模型在“水利综合管理信息系统”中得到验证和实现的实例。 相似文献
15.
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. 相似文献
16.
A. Stock H. Tolvanen R. Kalliola 《International journal of geographical information science》2013,27(9):1435-1452
Geographical information systems (GIS) are important tools in coastal research and management. Coastal GIS applications involve special challenges, because the coastal environment is a complex transitional system between the terrestrial and marine realms. Also acquisition methods and responsibilities for spatial data (and thus their properties) change at the shoreline. This article explores the consequences of this land-sea divide for coastal terrain modelling. We study how methods designed for terrestrial environments can be used to create integrated raster coastal terrain models (CTMs) from coarse elevation and depth data. We focus on shore slopes, because many particularities of coastal terrain and the data which describe it as well as the resulting problems are concentrated in the shore zone. Based on shorelines, terrestrial contours, depth contours and depth points, we used the ANUDEM algorithm to interpolate CTMs at different spatial resolutions, with and without drainage enforcement, for two test areas in a highly complex archipelago coast. Slope aspect and gradient rasters were derived from the CTMs using Horn's algorithm. Values were assigned from the slope rasters to thousands of points along the test areas' shorelines in different ways. Shore slope gradients and aspects were also calculated directly from the shorelines and contours. These modelled data were compared to each other and to field-measured shore profiles using a combination of qualitative and quantitative methods. As far as the coarse source data permitted, the interpolation and slope calculations delivered good results at fine spatial resolutions. Vector-based slope calculations were very sensitive to quality problems of the source data. Fine-resolution raster data were consequently found most suitable for describing shore slopes from coarse coastal terrain data. Terrestrial and marine parts of the CTMs were subject to different errors, and modelling methods and parameters had different consequences there. Thus, methods designed for terrestrial applications can be successfully used for coastal terrain modelling, but the choice of methods and parameters and the interpretation of modelling results require special attention to the differences of terrestrial and marine topography and data. 相似文献
17.
The concept of computing least-cost paths has been proposed and discussed for a few decades but only in simplified form due to the limited computational resources in the past. With the advancement of computer technology in speed and data storage, it is now possible to implement least-cost path algorithms with realistic conditions. In this paper, we present our implementations of least-cost paths by integrating viewshed information computed from digital elevation models. Our implementations and analyses include four possible types of paths. They are scenic paths, strategic paths, hidden paths, and withdrawn paths. While possible applications of these least-cost paths include planning of civil engineering, military and environmental planning, other extensions can be formulated without much difficulty. 相似文献
18.
Landslide characteristics and slope instability modeling using GIS, Lantau Island, Hong Kong 总被引：29，自引：0，他引：29
Steep terrain and high a frequency of tropical rainstorms make landslide occurrence on natural terrain a common phenomenon in Hong Kong. This paper reports on the use of a Geographical Information Systems (GIS) database, compiled primarily from existing digital maps and aerial photographs, to describe the physical characteristics of landslides and the statistical relations of landslide frequency with the physical parameters contributing to the initiation of landslides on Lantau Island in Hong Kong. The horizontal travel length and the angle of reach, defined as the angle of the line connecting the head of the landslide source to the distal margin of the displaced mass, are used to describe runout behavior of landslide mass. For all landslides studied, the horizontal travel length of landslide mass ranges from 5 to 785 m, with a mean value of 43 m, and the average angle of reach is 27.7°. This GIS database is then used to obtain a logistic multiple regression model for predicting slope instability. It is indicated that slope gradient, lithology, elevation, slope aspect, and land-use are statistically significant in predicting slope instability, while slope morphology and proximity to drainage lines are not important and thus excluded from the model. This model is then imported back into the GIS to produce a map of predicted slope instability. The results of this study demonstrate that slope instability can be effectively modeled by using GIS technology and logistic multiple regression analysis. 相似文献
19.
Takeshi Shirabe 《International journal of geographical information science》2014,28(2):314-325
This paper considers the problem of planning a path in a circumstance where its origin is given, but its destination is not specified and is to be selected from among a set of candidate destinations during a trip. A situation like this may be experienced by a group of people who have different preferred destinations, as well as by an individual who is simply indecisive about where to go. To resolve such an uncertainty, one may stay at the origin until he decides on a destination, or choose to proceed on some path that does not overly deviate from a shortest path, whichever destination is eventually chosen, and make a decision on the way. The latter action is sensible when the risk of traveling longer is outweighed by the benefit of buying more time for a better destination decision. The problem of finding such a time-buying path is formulated and a simple algorithm is developed for its solution. Some extensions and applications are also discussed. 相似文献
20.
王维艳 《云南地理环境研究》2005,17(5):52-56
旅行社作为联结旅游者与旅游目的地之间的重要纽带,其营销行为不仅直接影响旅游者的旅游行为,对旅游目的地同样具有不可忽视的现实的和潜在的影响力,在相当程度上关系到旅游地产品乃至旅游地的前途命运:旅行社追求利润最大化的市场营销行为以及规避“外部经济”的产品开发行为可直接导致旅游产品的大众化趋势,继而加速旅游地的发展、成熟乃至衰退过程;旅行社特殊的业务功能和行业地位,使其自身拥有旅游开发与促销的影响优势,对旅游市场和旅游目的地均具备可持续发展的诱导力。以滇西北旅游区为例,进行实证分析,指出遵循协作共生原则,实施“联合营销”举措是谋求旅游地持续发展的有效途径。 相似文献