Demand response is becoming a rational option to guarantee system reliability and reduce the investment. To tackle the possible overload caused by wind power uncertainty and N-1 contingency, a stochastic mixedinteger...
详细信息
Demand response is becoming a rational option to guarantee system reliability and reduce the investment. To tackle the possible overload caused by wind power uncertainty and N-1 contingency, a stochastic mixed integer linear programming model is proposed first. In addition, extreme scenario method is utilized to guarantee the robustness of planning scheme. The proposed method is validated in the modified Garver 6-bus system with practical scenario input. The simulation results demonstrate that the demand response helps to relieve the power flow overload and reducing transmission line investment.
In this paper, we consider a variant of the transportation problem where any demand may be dropped off elsewhere than at its destination, picked up later by the same or another vehicle, and so on until it has reached ...
详细信息
In this paper, we consider a variant of the transportation problem where any demand may be dropped off elsewhere than at its destination, picked up later by the same or another vehicle, and so on until it has reached its destination. We present two mixed integer linear programming formulations based on a space-time graph. We also develop a branch-and-cut algorithm for the problem and present some computational results
Energy conservation is a critical issue in wireless multi-hop networks since the nodes are powered by batteries only. One major metric for energy conservation is to route a communication session along the routes which...
详细信息
Energy conservation is a critical issue in wireless multi-hop networks since the nodes are powered by batteries only. One major metric for energy conservation is to route a communication session along the routes which requires the lowest total energy consumption. In this paper, based on the concepts of virtual relay, we present a constraint formulation for the minimum-energy broadcast routing problem in terms of mixed integer linear programming (MIP). Moreover the model extends its analytical capability into more general scenarios in asymmetric networks, where few studies have addressed the broadcast routing problem before. The experiment results show that in a typical multi-hop network with node less than 50, optimal solution can be always solved in a timely manner, and save up to 30% power consumption compared to the most efficient heuristic algorithm BIP known so far.
Phase shifting mask (PSM) is a promising resolution enhancement technique, which is used in the deep sub-wavelength lithography of the VLSI fabrication process. However, applying the PSM technique requires the layout ...
详细信息
ISBN:
(纸本)9781424419210
Phase shifting mask (PSM) is a promising resolution enhancement technique, which is used in the deep sub-wavelength lithography of the VLSI fabrication process. However, applying the PSM technique requires the layout to be free of phase conflicts. In this paper, we present a mixed integer linear programming (MILP) based layout modification algorithm which solves the phase conflict problem by wire spreading. Unlike existing layout modification methods which first solve the phase conflict problem by removing edges from the layout-associated conflict graphs and then try to revise the layout to match the resultant conflict graphs, our algorithm simultaneously considers the phase conflict problem and the feasibility of modifying the layout. The experimental results indicate that without increasing the chip size, the phase conflict problem can be well tackled with minimal perturbation to the layout.
With the growth of mobile users and the increasing deployment of wireless access network infrastructures, the issue of quality of service is becoming an important component of efficient wireless access network design....
详细信息
With the growth of mobile users and the increasing deployment of wireless access network infrastructures, the issue of quality of service is becoming an important component of efficient wireless access network design. In this paper, we study the survivability problem for users that are connected to the core network by fully or partially dual homed paths, or by a single path. Given a hierarchical wireless access network with the available capacity and reliability at each level, the problem is to minimize overall connection cost for multiple requests such that the capacity and minimum survivability requirements are not violated. We formulate the problem using mixed integer linear programming and propose a genetic-algorithm-based heuristic.
This paper addresses the hydrothermal electricity producer self-scheduling problem in day-ahead energy and reserves markets. A 0/1 mixedintegerlinear formulation of the producer self-scheduling problem is presented,...
详细信息
This paper addresses the hydrothermal electricity producer self-scheduling problem in day-ahead energy and reserves markets. A 0/1 mixedintegerlinear formulation of the producer self-scheduling problem is presented, which allows a realistic modeling of the unit's operating phases (synchronization, soak, dispatchable, desynchronization). Prohibited operating zones and daily hydro energy production constraints are also modeled. Test results address the effect of the energy and reserves market clearing prices on the producer units' day-ahead commitment status and profits.
Slack matching is an optimization that determines the amount of buffering that must be added to each channel of a slack elastic asynchronous system in order to reduce its cycle time to a specified target. We present t...
详细信息
Slack matching is an optimization that determines the amount of buffering that must be added to each channel of a slack elastic asynchronous system in order to reduce its cycle time to a specified target. We present two methods of expressing the slack matching problem as a mixed integer linear programming problem. The first method is applicable to systems composed of either full-buffers or half-buffers but not both. The second method is applicable to systems composed of any combination of full-buffers and half-buffers
Many critical e-commerce and financial services predominantly depend on geo-distributed data centers for scalability and availability. Recent market surveys show that failure of a data center is inevitable causing hug...
详细信息
ISBN:
(纸本)9781509021949
Many critical e-commerce and financial services predominantly depend on geo-distributed data centers for scalability and availability. Recent market surveys show that failure of a data center is inevitable causing huge financial loss. Fault-tolerant distributed data centers are typically designed by provisioning spare capacity to mask failure at a site. At the same time, data center operators are trying to reduce their carbon footprint by using renewable energy power. Thus, a key challenge in spare capacity provisioning is to distribute the additional servers across the sites, minimizing the total cost of ownership (which includes the server acquisition cost and operating cost) while maximizing the usage of renewable energy. While the existing models minimize the number of servers, we demonstrate that brown electricity price and renewable energy availability should be considered for sustainable fault tolerant data center design. We use mixed integer linear programming formulation to minimize the total cost of ownership (TCO), while handling constraints such as delay bound, partial or complete failure, and intermittent supply of renewable energy. By solving the optimization problem, we demonstrate that the proposed model reduces the TCO by 48% compared to CDN model (minimize latency), and by 24% compared to minimum server model (minimizes server cost). Results also highlight the impact of latency, number of data centers, failure percentage, and demand variation on the TCO.
This paper presents two modeling approaches for batching and scheduling jobs on parallel non-identical machines. For scheduling of jobs the due dates as a hard restriction and machine dependent processing times are co...
详细信息
This paper presents two modeling approaches for batching and scheduling jobs on parallel non-identical machines. For scheduling of jobs the due dates as a hard restriction and machine dependent processing times are considered. Between each of the jobs a setup may be necessary or not, depending on the predecessor. The setup of the machines is done by a single worker who needs to be scheduled as well, since only he can serve one machine at a time. The objective is to maximize the overall workload of the machines meeting the constraint of the due dates. While the first approach uses mixed integer linear programming to calculate an optimal schedule, the second one uses a simulation, based on colored Petri nets. Both methods are tested and evaluated using illustrative simulation examples.
In this work, we focus on securing cyber-physical systems (CPS) in the presence of network-based attacks, such as Man-in-the-Middle (MitM) attacks, where a stealthy attacker is able to compromise communication between...
详细信息
In this work, we focus on securing cyber-physical systems (CPS) in the presence of network-based attacks, such as Man-in-the-Middle (MitM) attacks, where a stealthy attacker is able to compromise communication between system sensors and controllers. Standard methods for this type of attacks rely on the use of cryptographic mechanisms, such as Message Authentication Codes (MACs) to ensure data integrity. However, this approach incurs significant computation overhead, limiting its use in resource constrained systems. Consequently, we consider the problem of scheduling multiple control tasks on a shared processor while providing a suitable level of security guarantees. Specifically, by security guarantees we refer to control performance, i.e., Quality-of-Control (QoC), in the presence of attacks. We start by mapping requirements for QoC under attack into constraints for security-aware control tasks that, besides standard control operations, intermittently perform data authentication. This allows for the analysis of the impact that security-related computation overhead has on both schedulability of control tasks and QoC. Building on this analysis, we introduce a mixed-integerlinearprogramming-based technique to obtain a schedulable task set with predefined QoC requirements. Also, to facilitate optimal resource allocation, we provide a method to analyze interplay between available computational resources and the overall QoC under attack, and show how to obtain a schedulable task set that maximizes the overall QoC guarantees. Finally, we prove usability of our approach on a case study with multiple automotive control components.
暂无评论