Sökning: "Lägsta kostnadsväg"

Hittade 2 avhandlingar innehållade orden Lägsta kostnadsväg.

  1. 1. Sensitivity, Variation, and Application of Least-Cost Path Models in Landscape Connectivity Analysis and Corridor Planning

    Författare :Rachel Mundeli Murekatete; Takeshi Shirabe; Gyözö Gidofalvi; Jean Pierre Bizimana; Gerhard Navratil; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Landscape connectivity; Conservation corridor; Stepping stones; Effective distance; Geographic Information Systems; Raster data; Land evaluation; Suitability analysis; Cost surface; Suitability surface; Ordinal scale; Least-cost path; Spatial resolution; Landskapsanslutning; Bevarandekorridor; Stegbräda; Effektivt avstånd; Geografiska informationssystem; Rasterdata; Markutvärdering; Lämplighetsanalys; Kostnadsyta; Lämplighetsyta; Ordinal skala; Lägsta kostnadsväg; Rumslig upplösning; Geoinformatik; Geoinformatics;

    Sammanfattning : 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. LÄS MER

  3. 2. Modeling Width in Spatial Optimization in Raster Space

    Författare :Lindsi Seegmiller; Takeshi Shirabe; Lars Harrie; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; raster-based geographic information system; spatial optimization; region selection; width; optimal routing; raster data modeling; distortion; corridor; rasterbaserat geografiskt informationssystem; rumslig optimering; regionval; bredd; optimal routing; rasterdatamodellering; distorsion; korridor; Geoinformatik; Geoinformatics;

    Sammanfattning : 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. LÄS MER