Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 7 of 7
Full-Text Articles in Entire DC Network
Optimizing Work Zone Schedules Considering Traffic Diversion With Artificial Bee Colony Algorithm, Celina Semaan
Optimizing Work Zone Schedules Considering Traffic Diversion With Artificial Bee Colony Algorithm, Celina Semaan
Dissertations
Highway maintenance activities often decrease roadway capacity and intrude traffic movements. The need to finish the project on time and under a specific budget while minimizing the traffic congestion and complying with the emission standards requires an appropriate work zone schedule optimization. The objective of this research is to improve the efficiency of work zone activities and minimize the total project cost including maintenance, user, and emission cost.
While previous studies investigated the work zone optimization problem, they did not consider the implementation of emission standards nor applied a green diversion strategy. This dissertation analyzes the optimization of work zone …
Optimization Of Vehicle Routing And Scheduling With Travel Time Variability - Application In Winter Road Maintenance, Haifeng Yu
Dissertations
This study developed a mathematical model for optimizing vehicle routing and scheduling, which can be used to collect travel time information, and also to perform winter road maintenance operations (e.g., salting, plowing). The objective of this research was to minimize the total vehicle travel time to complete a given set of service tasks, subject to resource constraints (e.g., truck capacity, fleet size) and operational constraints (e.g., service time windows, service time limit).
The nature of the problem is to design vehicle routes and schedules to perform the required service on predetermined road segments, which can be interpreted as an arc …
Adaptive Security-Aware Scheduling For Packet Switched Networks Using Real-Time Multi-Agent Systems, Ma'en Saleh Saleh
Adaptive Security-Aware Scheduling For Packet Switched Networks Using Real-Time Multi-Agent Systems, Ma'en Saleh Saleh
Dissertations
Conventional real-time scheduling algorithms are in care of timing constraints; they don’t pay any attention to enhance or optimize the real-time packet’s security performance. In this work, we propose an adaptive security-aware scheduling with congestion control mechanism for packet switching networks using real-time agentbased systems. The proposed system combines the functionality of real-time scheduling with the security service enhancement, where the real-time scheduling unit uses the differentiated-earliest-deadline-first (Diff-EDF) scheduler, while the security service enhancement scheme adopts a congestion control mechanism based on a resource estimation methodology.
The security service enhancement unit was designed based on two models: singlelayer and weighted …
Mechanisms For Quality-Of-Service Provisioning In Networks With Extended Services, Zhen Qin
Mechanisms For Quality-Of-Service Provisioning In Networks With Extended Services, Zhen Qin
Dissertations
The emerging network traffic with various Quality-of-Service (QoS) requirements creates a demand for QoS service provisioning beyond the best effort service that Internet currently provides. QoS provisioning requires a framework that satisfies users' QoS and cost demand while maximizes benefits for network service providers. It is considered that QoS provisioning involves three issues: a) estimations of the network QoS performance, which can be achieved by performing network measurement; b) dissemination of the measured QoS states throughout the network with states exchanged among different network routers; and c) QoS routing. In this dissertation, these three issues are addressed.
In QoS networks, …
Some Combinational Optimization Problems On Radio Network Communication And Machine Scheduling, Xin Wang
Some Combinational Optimization Problems On Radio Network Communication And Machine Scheduling, Xin Wang
Dissertations
The combinatorial optimization problems coming from two areas are studied in this dissertation: network communication and machine scheduling.
In the network communication area, the complexity of distributed broadcasting and distributed gossiping is studied in the setting of random networks. Two different models are considered: one is random geometric networks, the main model used to study properties of sensor and ad-hoc networks, where ri points are randomly placed in a unit square and two points are connected by an edge if they are at most a certain fixed distance r from each other. The other model is the so-called line-of-sight networks, …
Some Topics On Deterministic Scheduling Problems, Yumei Huo
Some Topics On Deterministic Scheduling Problems, Yumei Huo
Dissertations
Sequencing and scheduling problems are motivated by allocation of limited resources over time. The goal is to find an optimal allocation where optimality is defined by some problem specific objectives.
This dissertation considers the scheduling of a set of ri tasks, with precedence constraints, on m >= 1 identical and parallel processors so as to minimize the makespan. Specifically, it considers the situation where tasks, along with their precedence constraints, are released at different times, and the scheduler has to make scheduling decisions without knowledge of future releases. Both preemptive and nonpreemptive schedules are considered. This dissertation shows that optimal …
Algorithms And Complexity Analyses For Some Combinational Optimization Problems, Hairong Zhao
Algorithms And Complexity Analyses For Some Combinational Optimization Problems, Hairong Zhao
Dissertations
The main focus of this dissertation is on classical combinatorial optimization problems in two important areas: scheduling and network design.
In the area of scheduling, the main interest is in problems in the master-slave model. In this model, each machine is either a master machine or a slave machine. Each job is associated with a preprocessing task, a slave task and a postprocessing task that must be executed in this order. Each slave task has a dedicated slave machine. All the preprocessing and postprocessing tasks share a single master machine or the same set of master machines. A job may …