Sökning: "shortest path problem"

Visar resultat 1 - 5 av 28 avhandlingar innehållade orden shortest path problem.

  1. 1. An Analysis of Consequences of Land Evaluation and Path Optimization

    Författare :Rachel Mundeli Murekatete; Takeshi Shirabe; Gerhard Navratil; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Least-cost paths; Most-suitable paths; Raster cost surfaces; Raster suitability surfaces; Shortest path problem; Minimax path problem; Scales of measurement; Minsta-kostnad rutter; Mest-lämpliga rutter; Raster kostnadsytor; Raster lämplighets ytor; kortaste vägen problem; Minimax väg problem; Mätskalor; Geodesy and Geoinformatics; Geodesi och geoinformatik;

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

  3. 2. Shortest Path Routing Modelling, Infeasibility and Polyhedra

    Författare :Mikael Call; Kaj Holmberg; Bernard Fortz; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : The Internet is constantly growing but the available resources, i.e. bandwidth, are limited. Using bandwidth efficiently to provide high quality of service to users is referred to as traffic engineering. LÄS MER

  4. 3. From Art Galleries to Terrain Modelling --- A Meandering Path through Computational Geometry

    Författare :Mikael Hammar; Data Vetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; system; numerisk analys; Datalogi; systems; control; numerical analysis; Approximation Algorithms; Computational Geometry; Online Algorithms; Art Gallery Problem; Linear Search; Traveling Salesman Problem; R-Tree; Delaunay Triangulation; Polygon Exploration; Computer science; Shortest Watchman Routes; kontroll; Mathematics; Matematik;

    Sammanfattning : We give approximation and online algorithms as well as data structures for some well studied problems in computational geometry. The thesis is divided into three parts. In part one, we study problems related to guarding, exploring and searching geometric environments. LÄS MER

  5. 4. Online Learning for Energy Efficient Navigation in Stochastic Transport Networks

    Författare :Niklas Åkerblom; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Thompson Sampling; Online Minimax Path Problem; Multi-Armed Bandits; Online Learning; Online Shortest Path Problem; Machine Learning; Combinatorial Semi-Bandits; Energy Efficient Navigation;

    Sammanfattning : Reducing the dependence on fossil fuels in the transport sector is crucial to have a realistic chance of halting climate change. The automotive industry is, therefore, transitioning towards an electrified future at an unprecedented pace. LÄS MER

  7. 5. Constraint Programming Methods for Optimization of Single Shortest Path Routing

    Författare :Mats Petter Wallander; Data Vetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : In this thesis, we propose methods based on constraint programming (CP) for solving an optimization problem in telecommunications, the single shortest path routing problem. The problem is to find optimal values for a set of routing configuration parameters in a shortest path routing protocol, for a given network. LÄS MER