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 7 of 7 for “"Dynamic shortest path"”.
-
Development of a dynamic shortest path algorithm and a traffic simulation model
Shortest path determination in a dynamic transportation network has been a real challenge where network traffic scenario changes continuously. The shortest path between any two nodes in the network depends not only on the travel time of links that constitutes the path but also on the time spent at …
-
Selected Topics in Network Optimization: Aligning Binary Decision Diagrams for a Facility Location Problem and a Search Method for Dynamic Shortest Path Interdiction
… variant of the facility location problem, and a dynamic version of the Shortest-Path Interdiction (DSPI) problem. However, these problems all have the following core idea in common: They all stem from representing an optimization problem as a decision diagram. We begin from cases in which such a …
-
Time constrained shortest paths in stochastic and dynamic transportation networks
… develops methodologies for solving constrained shortest path problems in dynamic and random conditions. Due to the randomness of the network, the decisions need to account for uncertainty of the future real-time network state. Currently the randomness of the arc attributes is not taken into …
-
Dynamic routing and service network design for less-than-truckload (LTL) motor carriers
<p>This research tries to address the dynamic priority shipment routing problem and dynamic service network design problem for the less-than-truckload (LTL) carriers. First, described is a decision support tool to assist LTL managers in studying, analyzing and planning LTL operations so that scarce …
-
Network Design and Analysis Problems in Telecommunication, Location-Allocation, and Intelligent Transportation Systems
… p-median problem (PMED), and the estimation of dynamic origin-destination path ows or trip tables in a general network. For the LATA network problem, we develop a model and apply the Reformulation-Linearization Technique (RLT) to construct various enhanced tightened versions of the proposed …
-
Efficient Algorithms for Solving Size-Shape-Topology Truss Optimization and Shortest Path Problems
… numerical algorithms for solving structural and Shortest Path (SP) problems are proposed and explained in this study. A variant of the Differential Evolution (DE) algorithm for optimal (minimum) design of 2-D and 3-D truss structures is proposed. This proposed DE algorithm can handle …
-
Αποτίμηση ερωτημάτων σε συλλογές διαδρομών
… updated route collection the goal is to find a path, i.e., a sequence of spatial locations, that satisfies a number of constraints. According to the first problem a large collection of touristic routes is available and the goal is find a path that connects two landmarks through locations …