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 6 of 6 for “"Fastest paths"”.

  1. A decision support system for goods distribution planning in urban areas

    … we perform vehicle allocations and generate fastest paths for goods delivery to customers using modified Dijkstra’s algorithm. All these decisions are made considering realistic conditions associated with goods distribution in urban areas such as presence of congestion, municipal regulations, …

    concordia Download PDF for A decision support system for goods distribution planning in urban areas (opens in a new tab)

  2. Game Theoretical Analysis for Selfish Routing with Oblivious Users

    … high-level QoS services will be routed on the fastest paths available. Networks with selfish users may lead to a stable state or Nash equilibrium, where no selfish users can decrease his or her travel time by changing his or her route unilaterally. Traffic equilibria refer to Nash equilibria in …

    mcmaster Repository record for Game Theoretical Analysis for Selfish Routing with Oblivious Users (opens in a new tab)

  3. A Computational Model for Simulation, Visualization and Evaluation of Mandatory and Optional Building Occupancy Scenarios

    … scenarios are often based on finding shortest or fastest paths and for optional scenarios mainly rely on the field of visibility. The original contribution of the simulation models that this study suggests is simultaneous consideration of environmental qualities, path simplicity, and visibility in …

    tamu Repository record for A Computational Model for Simulation, Visualization and Evaluation of Mandatory and Optional Building Occupancy Scenarios (opens in a new tab)

  4. Hierarchical Graphs as Organisational Principle and Spatial Model Applied to Pedestrian Indoor Navigation

    … considerations, such as not only finding shortest/fastest paths across rooms and floors, but also by providing descriptions for these paths which are easily understood by people. Beyond this, two novel aspects of using a hierarchy are discussed: one as an informed heuristic exploiting the specific …

    lmu-germany Repository record for Hierarchical Graphs as Organisational Principle and Spatial Model Applied to Pedestrian Indoor Navigation (opens in a new tab)

  5. Scalable Approaches to Time-Dependent Path and Routing Problems

    Many combinatorial optimization problems involve an aspect of time, whether due to changing conditions, updated information, or being under a continuous decision-making process. A popular domain for time-based decision making is logistics, where it is not only important to decide along which routes …

    gatech Repository record for Scalable Approaches to Time-Dependent Path and Routing Problems (opens in a new tab)

  6. Δυναμική πρόβλεψη επιλογής μεταφορικού μέσου για αλληλοεξαρτώμενες μετακινήσεις με μεταβαλλόμενους προορισμούς

    … method that deleted aggressively alternative paths that violate constraints and converges in real time into an optimal solution with an accuracy of more than 90% as validated from applications in simulated dense and sparse networks with up to 300 intersections and 30,000 transport links.

    greece Repository record for Δυναμική πρόβλεψη επιλογής μεταφορικού μέσου για αλληλοεξαρτώμενες μετακινήσεις με μεταβαλλόμενους προορισμούς (opens in a new tab)