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 32 for “"shortest path problem"”.
-
The O-D shortest path problem and connectivity problems on periodic graphs
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 1992.
-
Algorithms for the shortest path problem with time windows and shortest path reoptimization in time-dependent networks
Thesis (M.Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2001.
-
The Approach-dependent, Time-dependent, Label-constrained Shortest Path Problem and Enhancements for the CART Algorithm with Application to Transportation Systems
In this dissertation, we consider two important problems pertaining to the analysis of transportation systems. The first of these is an approach-dependent, time-dependent, label-constrained shortest path problem that arises in the context of the Route Planner Module of the Transportation Analysis …
-
Stochastic shortest path algorithm based on Lagrangian relaxation
… widely used and graph structure can model many problems. As technology continues to scale into nanometer design, the effects of process variation become more crucial and design parameters also change. Hence, taking stochastic variations into account, probability distributions are used as edge …
-
Metaheuristics for Multi Criteria Path Optimisation
In real world applications, the path-planning problem is one that is multi-criteria in nature though given the complexity of the task is one that is often condensed to a single criterion issue, either by the consideration of only a single objective or condensing several criteria into a single …
-
Optimal Risk-based Pooled Testing in Public Health Screening, with Equity and Robustness Considerations
… and allow us to model the testing design problems as network flow problems, develop efficient algorithms, and derive insights on equity and robustness versus accuracy trade-off. One of our models reduces to a constrained shortest path problem, for a special case of which we develop a …
-
Combinatorial incremental problems
… class of Incremental Combinatorial optimization problems, where solutions are evaluated as they are built, as opposed to only measuring the performance of the final solution. Even though many of these problems have been studied, it has' usually been in isolation, so the first objective of this …
-
Low probability-high consequence considerations in a multiobjective approach to risk management
… value of the consequence. More specifically, the problem we wish to address involves finding a path that minimizes the conditional expectation of a catastrophic outcome such that the expected risk is lesser than or equal to a pre-determined value, v. The value v, is user-prescribed and is prompted …
-
Time Dynamic Label-Constrained Shortest Path Problems with Application to TRANSIMS: A Transportation Planning System
… is to find time-dependent label-constrained shortest paths for transportation activities performed by travelers in the system. There are several variations of shortest path problems and algorithms that vary by application, contexts, complexity, required data, and computer implementation …
-
Autonomous Underwater Vehicle (AUV) path planning and adaptive on-board routing for adaptive rapid environmental assessment
… is considered in AREA. In this thesis, the AUV path planning is modeled as a Shortest Path problem. However, due to the sound velocity correlation effect, the size of this problem can be very large. A method is developed to simplify the graph for a fast solution. As a significant step, a linear …
-
Network security and min-cost max-flow problem
… for a variety of design and operational problems. This has resulted in the development of computational algorithms for the study of classical operations research problems such as the maximum flow problem, the shortest path problem, and the network interdiction problem. However, in …
-
Models and algorithms for the optimization of traffic flows and emissions using dynamic routing and pricing
… pricing in dynamic traffic networks. A set of problems that arise in this context are studied. These include: (1) the development of a probabilistic approach to model acceleration, (2) the study of the dynamic capacitated minimum cost flow problem, (3) an experimental analysis of improvements …
-
Balancing actuation energy and computing energy in low-power motion planning
… we identify a new class of motion planning problems in which the energy consumed by the computer while planning a path can be as large as the energy consumed by the actuators during the execution of the path. As a result, minimizing energy requires minimizing both actuation energy and …
-
Performance Evaluation of Competing Data Structures in Pathfinding
Pathfinding is an essential part of many applications, including video games and robot navigation. A pathfinding algorithm usually finds a path from the given starting point to the endpoint. Many different implementations of pathfinding solutions exist in the industry. One of the most known and …
-
Acceleration of Iterative Methods for Markov Decision Processes
… will impact the ones made the day after. Problems in Engineering, Science, and Business often pose similar challenges: a large number of options and uncertainty about the future. MDP is one of the most powerful tools for solving such problems. There are several standard methods for finding …
-
Modeling Customer Behavior for Revenue Management
… decision making upon the revenue maximization problem of a monopolist firm. First, we study the revenue maximization problem of a monopolist firm selling a homogeneous good to a market of risk-averse, strategic customers. Using a discrete (but arbitrary) valuation distribution, we show how the …
-
Path planning for an autonomous vehicle
… necessitated the need for more research into the problems faced by these vehicles. One classic problem faced by UAVs concerns how the vehicle should traverse its environment in order to leave the current position and arrive at a desired location. The path to this goal location must maneuver the …
-
LEARNING UNDER STRUCTURE AND UNCERTAINTY: ALGORITHMS FOR BANDIT AND ONLINE DECISION MAKING
… captures a wide range of sequential decision problems and serves as the unifying perspective for the contributions of this thesis. We address this challenge across four distinct, fundamental problems in online learning. First, we address settings in which the learner receives no additional …
-
Multiset Model Selection and Averaging, and Interactive Storytelling
… and the surrounding theory to model selection problems. In such problems efficient exploration of the model space becomes a challenge since independent and ad-hoc proposals might not be able to jointly propose multiple parameter sets which correctly explain a new pro- posed model. In order to …
Page 1 of 2