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 19 of 19 for “"Scheduling and routing"”.

  1. Approaches for solving some scheduling and routing problems

    We study approaches for finding good solutions, and lower bounds, for three difficult combinatorial optimisation problems.<br/>The supply ship travelling salesman problem is a simplification of a situation faced by a naval logistics coordinator who must direct a support vessel tasked with …

    soton Repository record for Approaches for solving some scheduling and routing problems (opens in a new tab)

  2. CATS: Cloud application-specific traffic scheduling and routing

    This thesis addresses the limitations and challenges faced by traditional networks via layering, with a focus on the cloud environment that a large fraction of applications and services are running on today. We separate the cloud networks into two categories: intra cloud networks and inter cloud …

    uiuc Repository record for CATS: Cloud application-specific traffic scheduling and routing (opens in a new tab)

  3. Heterogeneity-aware and energy-aware scheduling and routing in wireless sensor networks

    … communication infrastructure intended to monitor and record conditions at diverse locations. Since WSN applications are usually deployed in an open environment, the network is exposed to rough weather conditions, such as rain and snow. Another problem that WSN applications need to deal with is the …

    njit Repository record for Heterogeneity-aware and energy-aware scheduling and routing in wireless sensor networks (opens in a new tab)

  4. Enhanced Formulations for Minimax and Discrete Optimization Problems with Applications to Scheduling and Routing

    … development of enhanced formulations for minimax and mixed-integer programming models for certain industrial and logistical systems, along with the design and implementation of efficient algorithmic strategies. We first examine the general class of minimax mixed-integer 0-1 problems of the type …

    vt Repository record for Enhanced Formulations for Minimax and Discrete Optimization Problems with Applications to Scheduling and Routing (opens in a new tab)

  5. Scheduling and routing of service trucks and planning of resource replenishment locations for winter roadway maintenance

    Routing of snow plow trucks in urban and regional areas encompasses a variety of complex decisions, especially for jurisdictions with heavy snowfall. The main activities involve dispatching a fleet of plow trucks from a central depot and/or satellite facilities to clean and spread salt/chemicals on …

    uiuc Repository record for Scheduling and routing of service trucks and planning of resource replenishment locations for winter roadway maintenance (opens in a new tab)

  6. Optimizing Integrated Airport Surface and Terminal Airspace Operations under Uncertainty

    In airports and surrounding terminal airspaces, the integration of surface, arrival and departure scheduling and routing have the potential to improve the operations efficiency. Moreover, because both the airport surface and the terminal airspace are often altered by random perturbations, the …

    purdue-thes Repository record for Optimizing Integrated Airport Surface and Terminal Airspace Operations under Uncertainty (opens in a new tab)

  7. Scheduling algorithms for throughput maximization in data networks

    … performance implications of throughput optimal scheduling in physically and computationally constrained data networks. We study optical networks, packet switches, and wireless networks, each of which has an assortment of features and constraints that challenge the design decisions of network …

    mit Repository record for Scheduling algorithms for throughput maximization in data networks (opens in a new tab)

  8. A comparison of discrete and flow-based models for air traffic flow management

    … has resulted in significant economic losses and potential safety issues in the air transportation. A potential way to reduce congestion is to adopt efficient air traffic management policies, such as, optimally scheduling and routing air traffic throughout the network. In recent years, several …

    mit Repository record for A comparison of discrete and flow-based models for air traffic flow management (opens in a new tab)

  9. Optimization models and algorithms for large-scale, capacity constrained pick-up and delivery problems with time windows

    … delivery companies employ hundreds of thousands of people, generate billions of dollars in revenues and operate very large fleets of ground vehicles ranging from custom- built package cars to large tractors and trailers. A crucial point for the profitability of these companies is, for a …

    mit Repository record for Optimization models and algorithms for large-scale, capacity constrained pick-up and delivery problems with time windows (opens in a new tab)

  10. The Development of an IoT-Enabled Solid Waste Management System for a Smart City using Capacitated Vehicle Routing Problem and Agent-Based Simulation

    … causing overflowing bins, illegal dumping, and uncollected waste, especially in developing countries. Focusing on solid waste, this study proposes a smart Solid Waste Management System (SWMS) for urban environments to improve waste collection and disposal. Building on advances in …

    stellenbosch Repository record for The Development of an IoT-Enabled Solid Waste Management System for a Smart City using Capacitated Vehicle Routing Problem and Agent-Based Simulation (opens in a new tab)

  11. Probabilistic on-line transportation problems with carrying-capacity constraints

    This thesis presents new insights and techniques for the analysis and design of autonomous or technology-assisted ("intelligent") transportation systems. The focus is on cooperative, on-line planning and control, of a fleet of transport vehicles with limited carrying capacity, where new …

    mit Repository record for Probabilistic on-line transportation problems with carrying-capacity constraints (opens in a new tab)

  12. Tactical Problems in Vehicle Routing Applications

    The class of Vehicle Routing Problems (VRPs) is one the most studied topics in the Operations Research community. The vast majority of the published papers focus on single-period problems, with a few branches of the literature considering multiperiod generalisations. All of these problems though, …

    aus-cath Repository record for Tactical Problems in Vehicle Routing Applications (opens in a new tab)

  13. Tactical Problems in Vehicle Routing Applications

    The class of Vehicle Routing Problems (VRPs) is one the most studied topics in the Operations Research community. The vast majority of the published papers focus on single-period problems, with a few branches of the literature considering multiperiod generalisations. All of these problems though, …

    anu Repository record for Tactical Problems in Vehicle Routing Applications (opens in a new tab)

  14. Design of Scheduling Algorithms Using Game Theoretic Ideas

    <p>Scheduling a set of jobs over a collection of machines to optimize a certain quality-of-service measure is one of the most important research topics in both computer science theory and practice. In this thesis, we design algorithms that optimize {\em flow-time} (or delay) of jobs for scheduling

    duke Repository record for Design of Scheduling Algorithms Using Game Theoretic Ideas (opens in a new tab)

  15. Towards self-organizing wireless networks

    … to address fundamental challenges in current and future wireless networks. Not least the dense and heterogeneous nature of the networks, the scarcity of resources, and high costs of manual configurations necessitate efficient self-organization techniques that autonomously adapt crucial system …

    tu-berlin Repository record for Towards self-organizing wireless networks (opens in a new tab)

  16. Capacity Characterization of Multi-Hop Wireless Networks- A Cross Layer Approach

    … as follows: given a multi-hop wireless network and a set of source destination pairs, determine the maximum rate r at which data can be transmitted between each source destination pair. Estimating the capacity of a multi-hop wireless network is practically useful --- it yields insights into the …

    vt Repository record for Capacity Characterization of Multi-Hop Wireless Networks- A Cross Layer Approach (opens in a new tab)

  17. Some Modeling and Optimization Problems in Cognitive Radio Ad Hoc Networks

    … hardware. Due to its spectrum sensing, learning, and adaptation capabilities, CR is able to address the heart of the problem associated with spectrum scarcity (via dynamic spectrum access (DSA)) and interoperability (via channel switching). It is envisioned that CR will be employed as a general …

    vt Repository record for Some Modeling and Optimization Problems in Cognitive Radio Ad Hoc Networks (opens in a new tab)

  18. Algorithms and Optimization for Wireless Networks

    … of wireless networks have emerged for both civil and military applications, such as wireless sensor networks, ad hoc networks, among others. To improve the performance of these wireless networks, many advanced communication techniques have been developed at the physical layer. For both theoretical …

    vt Repository record for Algorithms and Optimization for Wireless Networks (opens in a new tab)