Professional Documents
Culture Documents
A Presentation On Spatial Analysis and Modeling
A Presentation On Spatial Analysis and Modeling
A Presentation On Spatial Analysis and Modeling
GROUP-7
Dept. of Geography & Env. University Of Rajshahi.
Presentation outline
Least-Cost Path Analysis
Applications of Least-Cost Path Analysis
Network
Assembly of a Network
Network Analysis
What is Least Cost Path Analysis?
Definition:
A least-cost path analysis requires a source raster, a cost raster, cost distance measures, and an algorithm for
deriving the least accumulative cost path.
Least cost path analysis is a distance analysis tool within GIS that uses the least cost path or the path between
two locations that costs the least to those travelling along it to determine the most cost-effective route
between a source and destination.
In GIS application , Least-cost path analyses use the cost weighted distance and direction surfaces for
an area to determine a cost-effective route between a source and a destination. For example, you can use
least-cost path analysis to find the cheapest route for building a pipeline or the quickest way to a set of
observation points.
What is Source Raster ?
Definition:
A source raster defines the source cell . Only the source cell has a cell value in the source raster and all
other cells are assigned no data.
In the context of least-cost path analysis, one can consider the source cell as an end point of a path, either the
origin or the destination.
The analysis derives for a cell the least accumulated cost path to the source cell or to the closest source cell if
two or more source cells are present.
The distance is 1.0 cell for a lateral link and The cost distance to travel from one cell to another through a lateral link
1.414 cells for a diagonal link. is 1.0 cell times the average of the two cost values:
Cost distance measures
The cost distance of a lateral link is the Deriving the Least Accumulative Cost Path
average of the costs in the linked cells, for
example
Given a cost raster, we can calculate the accumulative cost between two
cells by summing the costs associated with each link that connects the
two cells.
The cost Finding the least accumulative cost path is an iterative process based on
distance of a diagonal link is the average Dijkstra’s algorithm (1959).
cost times 1.414, for example, The process begins by activating cells adjacent to the source cell and by
computing costs to the cells. The cell with the lowest cost distance is
chosen from the active cell list, and its value
is assigned to the output raster. Next, cells adjacent to the chosen cell are
activated and added to the active cell list. Again, the lowest cost cell is
chosen from the list and its neighboring cells are activated. Each time a
cell is reactivated, meaning that the cell is accessible to the source cell
through a different path, its accumulative cost must be recomputed. The
lowest accumulative cost is then assigned to the reactivated cell. This
process continues until all cells in the output raster are assigned with their
least accumulative costs to the source cell.
Deriving the Least Accumulative Cost Path
source cells at the opposite corners. Figure 17.4b represents a cost raster. To simplify the computation, both rasters are set to have a cell
size of 1. Figure 17.4c shows the cost of each lateral link and the cost of each diagonal link. Figure 17.4d shows for each cell the least
accumulative cost. Box 17.2 explains how Figure 17.4d is derived.A cost distance measure operation can result in different types of
outputs. The first is a least accumulative cost raster as shown in Figure 17.4d.
The second is a direction raster, showing the direction of the least-cost path for each cell. The third is an allocation raster, showing the
assignment of each cell to a source cell on the basis of cost distance measures. The fourth type is a shortest path raster, which shows the
least cost path from each cell to a source cell. Using the same data as in Figure 17.4, Figure 17.5a shows two examples of the least-cost
path and Figure 17.5b shows the assignment of each cell to a source cell. The darkest cell in Figure 17.5b can be assigned to either one of
the two sources.
Options for Least-Cost Path Analysis
The outcome of a least-cost path analysis is influenced by the cost raster, cost distance
measure and algorithm for deriving the least-cost path.
Least cost path analysis is a distance analysis tool within GIS that uses the least cost path or the
path between two locations that costs the least to those travelling along it to determine the most
cost-effective route between a source and destination.
Least-cost path analysis is rasterbased and has a narrower focus. Using a cost raster that defines
the cost of moving through each cell, it finds the least accumulated cost path between cells.
Least-cost path analysis is useful, for example, as a planning tool for locating a new road or a
new pipeline that is least costly (optimal) in terms of the construction costs as well as the
potential costs of environmental impacts.
Requirements for Least Cost Path Analysis
1. These are a source raster, a cost raster, cost distance measures and an algorithm for deriving
the least cost path .
2. A source raster is a raster that “defines the source to which the least-cost path from each cell
is calculated.
3. The cost raster is the raster that defines the cost or other impedance (defined by the user) to
move through each raster cell.
4. The cost distance measure portion of least cost path analysis is centered on the node-link
raster cell representation .
5. Finally, least cost path analysis requires an algorithm for deriving a least cost path. An
algorithm is an important component of least cost path analysis because accumulative cost
between two cells can be calculated by adding the costs of connecting the two cells but least
accumulative costs are challenging because there are many different ways to connect two
cells and they do not have to be immediate neighbors
Creating a Least Cost Path Analysis
Once the four requirements for conducting a least cost
path analysis are met it is important to consider and
correctly weight the rasters making up the cost raster to
create an effective least cost path analysis (“Creating the
Least Cost Path.”).
Take for example a least cost path analysis examining
routes between two campgrounds. The time it takes to
travel between them and the monetary cost of fuel are the
two are the important costs being tested. The user needs
to determine which of these is most important and weight
them accordingly. Weighted distance analysis (the
determination of the best path between the two
campgrounds considering time and fuel usage based on
terrain, etc.) is one tool that can be used to help weight
the two factors (“Distance Analysis Using ArcGIS”).
Once correctly weighted a least cost path analysis
between the two is generated based on factors such as
speed limits and terrain among others.
Creating a Least Cost Path Analysis
Determining the least-cost path between a source and a
destination is a two step process:
Route planning
1. Power lines
3. trail locations for all-terrain vehicles 5. weighted sum of cost factors such as
slope, land cover, elevation, water, and
human activities
4. wildlife management
6.archeology for studying
7.medical services