Essays about: "Shortest Path Algorithm"

Showing result 21 - 25 of 44 essays containing the words Shortest Path Algorithm.

  1. 21. Deep Learning Models for Route Planning in Road Networks

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Tianyu Zhou; [2018]
    Keywords : Route Planning; Pathfinding; Shortest Path Algorithms; Road Networks; Deep Learning; Neural Networks.; Ruttplanering; Sökning; Algoritmer för att finna kortaste väg; Vägnät; Djupinlärning; Neuronnätverk.;

    Abstract : Traditional shortest path algorithms can efficiently find the optimal paths in graphs using simple heuristics. However, formulating a simple heuristic is challenging under the road network setting since there are multiple factors to consider, such as road segment length, edge centrality, and speed limit. READ MORE

  3. 22. Solving the Facility Location Problem using Graph Theory and Shortest Path Algorithms

    University essay from KTH/Optimeringslära och systemteori

    Author : Patrick Zarabi; August Denes; [2018]
    Keywords : ;

    Abstract : This thesis in systems engineering and optimization theory aims to solve a facility location problem within the context of a confined space with path and proximity constraints. The thesis was commissioned by LKAB Kiruna, to help in their decision of where to construct a new facility on their industrial premises. READ MORE

  4. 23. Experimental Evaluation of GPU Solutions to the Single Source Shortest Path Problem

    University essay from KTH/Skolan för datavetenskap och kommunikation (CSC)

    Author : Dan Hemgren; Ernst Widerberg; [2017]
    Keywords : ;

    Abstract : Originally designed for computer graphics, the modern graphics processing unit (GPU) has now become a potential powerhouse for parallel calculations through the use of platforms such as CUDA and OpenCL. This paper presents an experimental evaluation of GPU- and CPU-parallel as well as CPU-sequential implementations for solving the single source shortest path problem. READ MORE

  5. 24. Route flow estimation based on time-dependent route choice sets and historical travel times

    University essay from Linköpings universitet/Kommunikations- och transportsystem; Linköpings universitet/Tekniska högskolan

    Author : Valerie Dahl; Mikael Davidsson; [2016]
    Keywords : ;

    Abstract : Since congestion leads to variations in travel time which gives a variation in the traffic flow, it is interesting to estimate the traffic flow in larger cities where cars drive in a limited space. In order to estimate the traffic flow, different traffic models are usually used. READ MORE

  6. 25. Compressing sparse graphs to speed up Dijkstra’s shortest path algorithm

    University essay from KTH/Skolan för datavetenskap och kommunikation (CSC)

    Author : Johan Bergdorf; Jesper Norman; [2015]
    Keywords : ;

    Abstract : One of the problems that arises from the continuously growing amount of data is that it slows down and limits the uses of large graphs in real world situations. Because of this, studies are being done to investigate the possibility of compressing data in large graphs. READ MORE