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 5 of 5 for “"Time-dependent shortest path problem"”.

  1. New Multiobjective Shortest Path Algorithms

    The main problem 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 …

    fu-berlin Repository record for New Multiobjective Shortest Path Algorithms (opens in a new tab)

  2. Adaptive routing in schedule based stochastic time-dependent transit networks

    In this thesis, an adaptive transit routing (ATR) problem in a schedule based stochastic time-dependent transit network is defined and formulated as a finite horizon Markov Decision Process (MDP). The transit link travel times are assumed to be random with known probability distributions. Routing …

    texas Repository record for Adaptive routing in schedule based stochastic time-dependent transit networks (opens in a new tab)

  3. Single-objective and bi-objetive parallel heuristics for the travel planning problem

    … realistic formulations of the travel planning problem. Given a travel time window and a set of destinations with their corresponding dwelling times, the goal of our single-objective approach is to find a route that produces a budget travel’s itinerary, involving flights, hotels and …

    brazil-ufv Repository record for Single-objective and bi-objetive parallel heuristics for the travel planning problem (opens in a new tab)

  4. Optimization Algorithms for the Flight Planning Problem

    The Flight Planning Problem is a type of Shortest Path Problem that deals with calculating a minimal-cost flight trajectory between two airports. This trajectory must take into account various types of operative restrictions constraining it both horizontally and vertically. Further factors such as …

    fu-berlin Repository record for Optimization Algorithms for the Flight Planning Problem (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)