Search for dissertations about: "Least-cost paths"
Found 4 swedish dissertations containing the words Least-cost paths.
-
1. Modeling and optimization of least-cost corridors
Abstract : Given a grid of cells, each having a value indicating its cost per unit area, a variant of the least-cost path problem is to find a corridor of a specified width connecting two termini such that its cost-weighted area is minimized. A computationally efficient method exists for finding such corridors, but as is the case with conventional raster-based least-cost paths, their incremental orientations are limited to a fixed number of (typically eight orthogonal and diagonal) directions, and therefore, regardless of the grid resolution, they tend to deviate from those conceivable on the Euclidean plane. READ MORE
-
2. Sensitivity, Variation, and Application of Least-Cost Path Models in Landscape Connectivity Analysis and Corridor Planning
Abstract : In recent decades, Rwanda has been affected by the loss and fragmentation of natural habitats for native species of animals and plants. As a consequence, landscape connectivity—i.e. READ MORE
-
3. An Analysis of Consequences of Land Evaluation and Path Optimization
Abstract : Planners who are involved in locational decision making often use raster-based geographic information systems (GIS) 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. READ MORE
-
4. Modeling Width in Spatial Optimization in Raster Space
Abstract : Given a grid of cells, each of which is assigned a numerical value quantifying its utility (or cost) for a certain use, a popular type of problem in geographic information science is raster-based spatial optimization. Such problems commonly seek to find a set of cells that maximizes (or minimizes) that utility (or cost) while adhering to a given set of constraints. READ MORE