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 discretization discovery"”.

  1. Secure Distribution Networks: From Design to Operations

    … Logistics Network Design Problem and a Dynamic Discretization Discovery method that solves it efficiently over time-expanded networks. The third chapter addresses adaptive routing for expeditionary logistics under nonparametric uncertainty, casting the problem as a Markov decision …

    gatech Repository record for Secure Distribution Networks: From Design to Operations (opens in a new tab)

  2. Dynamic and continuous-time service network design

    … the price of this approximation caused by the discretization of parameters involving time, and introduce two algorithms that efficiently solve the continuous-time problem. Both algorithms dynamically build and refine a subset of the full time-expanded network, so that the associated integer …

    gatech Repository record for Dynamic and continuous-time service network design (opens in a new tab)

  3. Greedy Approaches for Large-Scale Flow and Load Planning

    … with optimistically mapped arcs. Heuristic dynamic discretization discovery (DDD) is used to detect when consolidations are not possible due to mapping error and to specify which time points must be added to prevent the infeasibility. Several improvements are made to the shortest path …

    gatech Repository record for Greedy Approaches for Large-Scale Flow and Load Planning (opens in a new tab)

  4. Exact algorithms for routing problems

    … formulations that can form the basis of a Dynamic Discretization Discovery (DDD) algorithm and demonstrate in an extensive computational study that they, by themselves, produces provably high-quality, often optimal, solutions. In Chapter 4, we study the Continuous Time IRP with Out-and-Back …

    gatech Repository record for Exact algorithms for routing problems (opens in a new tab)

  5. Advances in tactical planning decision problems in trucking service networks

    … objective value of XDTS-W. We propose an exact dynamic discretization discovery (DDD) algorithm to solve XDTS-W. DDD iterates between a lower-bound and an upper-bound model and refines the partial network in each iteration until it converges to a provably optimal solution. Through computational …

    gatech Repository record for Advances in tactical planning decision problems in trucking service networks (opens in a new tab)

  6. Routing, Scheduling, and Sorting in Consolidated Networks

    … the size of these formulations depends on the discretization of the time horizon and can become prohibitively large. The recently-developed dynamic discretization discovery (DDD) method allows many time-dependent problems to become more tractable by iteratively solving instances of the problem …

    waterloo Repository record for Routing, Scheduling, and Sorting in Consolidated Networks (opens in a new tab)

  7. 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)