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 9 of 9 for “"Routing policy"”.
-
Optimal adaptive routing and traffic assignment in stochastic time-dependent networks
… time-wise and link-wise stochastic dependency. A routing policy is a decision rule which specifies what node to take next out of the current node based on the current time and online information. A formal framework is established for optimal routing policy problems in STD networks, including …
-
Analysis of some simple policies for dynamic resource allocation
… control problem. Variants of a simple least load routing policy are shown to lead to a fluid type limit and to be asymptotically optimal. Either finite capacity constraints or migration of load can be incorporated into the setup.
-
Analytic modelling of agent-based network routing algorithms.
Interest in adaptive and distributed systems for routing control in networks has led to the development of a new class of algorithms, which is inspired by the shortest path finding behaviours observed in biological ant colonies. This class utilizes ant-like agents, which autonomously traverse the …
-
An integrated stock assignment model for a warehouse fast picking area
… walking distance traveled within an S-shaped routing policy. The assignment of SKUs to a location is formulated as a Binary Mixed Integer Linear Programming (BMILP) model which is able to solve small scale problems to optimality. In the cases where the BMILP model does not find the optimal …
-
Routing problems in stochastic time-dependent networks with applications in dynamic traffic assignment
… parts in this thesis. We first study the best routing policy problems in stochastic and time-dependent networks, and then develop policy-based stochastic dynamic traffic assignment models and algorithms. Routing problems are not only useful to develop dynamic traffic assignment (DTA) methods, …
-
Modeling And Optimization Of Non-Profit Hospital Call Centers With Service Blending
… calls service blending. </p> <p>First, the routing policy for inbound and outbound calls is considered. The objective is to improve the system utilization under constraints of service quality and operators' quantity. A collection of practical staffing assignment methods, separating and …
-
Power-Demand Routing in massive geo-distributed systems
… areas of concern. We introduce Power-Demand Routing (PDR), a technique that redistributes traffic between replicas with the express purpose of spatially redistributing the system's power consumption, in order to reduce operating costs. Cost can be described in monetary terms or in terms of …
-
Strategic dynamic vehicle routing with spatio-temporal dependent demands
Dynamic vehicle routing problems address the issue of determining optimal routes for a set of vehicles, to serve a given set of demands that arrive sequentially in time. Traditionally, demands are assumed to be generated over time by an exogenous stochastic process. This thesis is concerned with …
-
Locality-aware cache hierarchy management for multicore processors
… 2-D mesh network by making simple changes to its routing policy without requiring any additional virtual channels. Second, a locality-aware replication scheme that better manages the private caches is proposed. This scheme controls replication based on data reuse information and seamlessly adapts …