Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 40 for “"SHORTEST PATH ALGORITHMS"”.
-
New Multiobjective Shortest Path Algorithms
… studied in this thesis is the Multiobjective Shortest Path (MOSP) problem. We focus on the problem variant with three or more objectives. It is a generalization of the classical Shortest Path problem in which arcs in the input graph are weighted with vectors instead of scalars. The main …
-
SAFE NAVIGATION: ROUTE PLANNING IN CONTESTED ENVIRONMENTS USING SHORTEST PATH ALGORITHMS
… investigates whether dynamic programming (DP) algorithms can be adapted to generate safe, optimal paths by integrating probabilistic risk into an urban road network. To model contested environments, we utilized open-source crime data from the cities of Oakland and Cleveland as a proxy for …
-
Estimating managed lanes door-to-door travel timesavings using shortest path algorithms
… This study develops a framework that utilizes a shortest path algorithm to compare before and after commute routes and estimate the change in door-to-door travel time offered by managed lane facilities. Using this modeling approach, a case study is explored for the Northwest Corridor (NWC) …
-
Application of shortest path algorithms to find paths of minimum radiation dose
Presented here is the use of two path-optimization algorithms, Dijkstra's Algorithm, and the Bellman-Ford Algorithm, to find paths through radiologically contaminated environments such that the accumulated dose is minimal. Such paths will be very useful for personnel whose job requires them to …
-
The application of single-source shortest path algorithms to an OJSC contingency planning model and a vehicle routing model
… thesis investigates the use of" single-source shortest path algorithms in two unrelated contexts. In the first application, the label setting and label correcting algorithms are examined for applicability to and implementation within a J-S. Organization of the Joint Chiefs of Staff contingency …
-
Understanding Work-Efficiency of label correcting Single Source Shortest Path Algorithms - How does relaxed data structures affect the work-efficiency of parallel algorithms?
… the scalability of parallel Single-Source Shortest Path (SSSP) algorithms by reducing synchronization overhead. However, relaxation introduces deviations from strict priority ordering, which may generate redundant work and reduce work-efficiency. This thesis investigates the relationship …
-
Transportation Shortest Path Search Area Model
<p>Although many studies on shortest-path algorithms have been conducted in the past, few of them have considered the time and effort required to obtain and update the weight property of the network arcs. For transportation-related problems – due to the size and complexity of the network – …
-
On labeled paths
… investigation of their intersection, the labeled paths. This dissertation examines three results in the area of labeled path problems. The first result presents an empirical analysis of two context-free labeled all-pairs shortest-path algorithms using MapReduce as the experimental platform. The …
-
Optimal Path Queries in Very Large Spatial Databases
… or constrained queries. Many main memory based algorithms have been developed to deal with the optimal route query problem. Among these, Dijkstra's shortest path algorithm is one of the most popular algorithms for the unconstrained route query problem. The constrained route query problem is more …
-
Bipartite Matching and Routing with Congestion Costs: A convex approach to robot task assignment and the multi-agent pathfinding problem
Motivated by the congestion-aware path planning and task assignment problem emerging from traffic assignment, ride-sharing, and multi-robot task assignment problems, this thesis incorporates shortest path and assignment problems with congestion by formulating them as a convex optimization problem …
-
Algorithms and data structures for cache-efficient computation: theory and experimental evaluation
… modern computers which facilitates the design of algorithms that can use the caches (i.e., memory levels) in the hierarchy efficiently without using the knowledge of cache parameters. In addition to possibly running faster than traditional flat-memory algorithms due to reduced cache-misses, these …
-
Meshed Trees: A Framework for Resilient Network Algorithms and Protocols
… tasked with maintaining optimal data-forwarding paths. These protocols commonly rely on shortest-path algorithms to determine where network data should be propagated and how it should be analyzed for inclusion in forwarding tables. However, problems arise during reconvergence, the process in …
-
Design of a System for Multiple Route Selection in the Presence of Flooding
… certain impedance. The earliest study of path finding started in the late 1800s forming the basis of depth-first search techniques. This was followed by the introduction of a lot of popular algorithms including Dijkstra’s, A*and Bellman-Ford. Recently, the study of path planning – for road …
-
Shortest Path Queries in Very Large Spatial Databases
Finding the shortest paths in a graph has been studied for a long time, and there are many main memory based algorithms dealing with this problem. Among these, Dijkstra's shortest path algorithm is one of the most commonly used efficient algorithms to the non-negative graphs. Even more efficient …
-
The use of travel demand models with geographic information systems in transportation planning
… turning movement display, calibration plot and shortest path algorithms. The second article covers the quality assurance functions incorporated into the interface. These functions include model documentation, verification of centroid loading, external trip table editing, one-way link versus turn …
-
Application of Integer Programming for Mine Evacuation Modeling with Multiple Transportation Modes
… of miners during an emergency within the shortest possible time is very important for the success of a mine evacuation program. Despite developments in the field of mine evacuation, little research has been done on the use of mine vehicles during evacuation. Current research into mine …
-
Semi-automated modeling approaches to route selection in GIS
… location. The results illustrate that different shortest-path algorithms do not necessarily result in markedly different linear routes. However, differing results can occur when using different neighboring-cell links in the cell-based route network construction. Cell-based algorithmic approaches …
-
TOPOLOGICAL ANALYSIS OF DISTANCE WEIGHTED NORTH AMERICAN RAILROAD NETWORK: EFFICIENCY, ECCENTRICITY, AND RELATED ATTRIBUTES
… and graph theory and improvements in all-pairs shortest path algorithms make it more feasible to process certain characteristics on large networks with reduced computation time and resources. The characteristics of networks at issue to support network-level risk and resilience studies include …
-
Transition Path Theory for Markov Processes
… thesis, we present the framework of transition path theory (TPT) for time continuous Markov processes with continuous and discrete state space. TPT provides statistical properties of the ensemble of reactive trajectories between some start and target sets and yields properties such as the …
Page 1 of 2