SEARCH · Engineering Papers
Results for “mixed-integer”
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Grid Optimization Competition on Synthetic and Industrial Power Systems
This paper summarizes a grid optimization (GO) competition effort in the United States to find the best solution strategies for up to interconnect-scale power system networks with around 32,000 buses. The optimization problem is a mixedinteger, non-convex non-linear problem, (MINLP) and includes discrete variables such as unit commitment and line switching, control settings (transformer taps and phase shifters with impedance correction tables), and bus shunts. The case study includes six actual industry grids as well as 16 realistic synthetic grids created by three different dataset teams. The winners are selected and ranked based on scoring criteria, which consider the solution quality (such as objective functions) within time limits. Nine winner teams are selected from 26 competitor teams. The results achieved by different teams are described and the performance of different algorithms on synthetic grids and actual industry grids are compared and analyzed.
Dynamic Programming Method to Optimally Select Power Distribution System Reliability Upgrades
Not Available
Proactive Frequency Stability Scheme Based on Bayesian Filters and Spectral Clustering
Not Available
Integrated Transmission and Distribution Systems Restoration with Distributed Generation Scheduling
The self-healing smart grids enable system operators to quickly and efficiently recover transmission and distribution systems from outages and blackouts. The current restoration procedure solves the transmission and distribution system restoration problems separately without considering their impacts on each other, which may prolong the restoration process. However, with the emerging active distribution networks, distributed generators can contribute into the bottom-up restoration strategy. The interaction between the restoration of two interconnected systems should be taken into account. In this paper, a hybrid model of transmission and distribution systems restoration (HTDSR) is proposed by exchanging data of power and voltage between two separate optimization problems. The effectiveness of the HTDSR algorithm is demonstrated through case studies of the integrated IEEE 13-bus distribution network and IEEE 39-bus transmission grid. Simulation results demonstrate that the integrated restoration strategy with optimal scheduling of distributed generation sources can expedite the restoration process.
Chance-constrained Service Restoration for Distribution Networks with Renewables
Power systems operation is facing great challenges from natural disasters and cyber-attacks. It is critical but also difficult to enhance the reliability and resilience against extreme events. To better response to inevitable outages or blackouts, service restoration in distribution networks is important to minimize the disastrous impacts of catastrophic events. The increasing penetration of distributed energy resources (DERs) provides new opportunities to expedite the restoration process. However, the coordination with conventional distribution system control devices and the uncertainty and variability of intermittent renewable energy resources requires new operation and control strategies for distribution service restoration (DSR). This paper develops an optimal bottom-up DSR strategy by coordinating DERs with voltage regulators and capacitor banks. The chance-constrained (CC) programming approach is used to model the probabilistic output limit of solar radiation and PV generation. The Markov's inequality and Latin hypercube sampling techniques are applied to convert and incorporate the chance constraints into the DSR optimization problem. The CC-DSR problem is formulated as a mixed integer convex programming problem, considering various operational cost functions and bidirectional three-phase unbalanced load flow. Simulation results on the modified IEEE 13-node test feeder system demonstrate the effectiveness and flexibility of the bottom-up DSR strategy.
Two-Stage Adaptive Restoration Decision Support System for a Self-Healing Power Grid
Power outages cost American industries and businesses billions of dollars and jeopardize the lives of hospital patients. The losses can be greatly reduced with a fast, reliable, and flexible self-healing tool. This paper is aimed to tackle the challenging task of developing an adaptive restoration decision support system (RDSS). The proposed RDSS determines restoration actions both in planning and real-time phases and adapts to constantly changing system conditions. The comprehensive formulation encompasses practical constraints including ac power flow, dynamic reserve, and load modeling. Here, the combinatorial problem is decomposed into a two-stage formulation solved by an integer L-shaped algorithm. The two stages are then executed online in the RDSS framework employing a sliding window method. The IEEE 39-bus system has been studied under normal and contingency conditions to demonstrate the effectiveness and efficiency of the proposed online RDSS.
Strengthened MILP formulation for certain gas turbine unit commitment problems
In this study, we derive a strengthened MILP formulation for certain gas turbine unit commitment problems, in which the ramping rates are no smaller than the minimum generation amounts. This type of gas turbines can usually start-up faster and have a larger ramping rate, as compared to the traditional coal-fired power plants. Recently, the number of this type of gas turbines increases significantly due to affordable gas prices and their scheduling flexibilities to accommodate intermittent renewable energy generation. In this study, several new families of strong valid inequalities are developed to help reduce the computational time to solve these types of problems. Meanwhile, the validity and facet-defining proofs are provided for certain inequalities. Finally, numerical experiments on a modified IEEE 118-bus system and the power system data based on recent studies verify the effectiveness of applying our formulation to model and solve this type of gas turbine unit commitment problems, including reducing the computational time to obtain an optimal solution or obtaining a much smaller optimality gap, as compared to the default CPLEX, when the time limit is reached with no optimal solutions obtained.
A Data-Driven Approach to Improve Wind Dispatchability
Explore the source record for details and available documents.
Transmission Constraint Filtering in Large-Scale Security-Constrained Unit Commitment
When solving the security-constrained unit commitment problem, one of the most complicating factors is handling the large number of transmission constraints, corresponding to both base case and N - 1 line contingency scenarios. Although it is well known that only a few of these constraints need to be enforced, identifying this critical subset of constraints efficiently remains a challenge. In this letter, we propose a novel and simple iterative contingency-screening procedure that is able to eliminate 99.4% of the constraints selected by existing iterative methods, allowing for the solution of much larger-scale problems. We report computational results in realistic instances with up to 6468 buses and 9000 transmission lines. Furthermore, the method was also independently implemented and evaluated at MISO, where it performed faster than alternative methods.
A Flexible Operation of Distributed Generation in Distribution Networks With Dynamic Boundaries
Distributed generators performing black start to form isolated microgrids offer a flexible and resilient solution to service restoration in distribution systems. Employing the dynamic microgrid concept, distributed generators can form isolated microgrids by changing their physical boundaries through smart switches and conventional circuit breakers. However, the flexibility of distributed generators has not been thoroughly investigated and utilised in existing works. To address this issue, this letter presents a new model to the reconfiguration formulation in active distribution networks considering different operation modes of distributed generators. Compared with the existing models, this study provides a new formulation supporting different DGs' operation modes and fully making use of their flexibility. Illustrative results on IEEE 34-test systems verify the effectiveness of the proposed model.
A Configuration Based Pumped Storage Hydro Model in the MISO Day-Ahead Market
Pumped storage hydro units (PSHU) can provide flexibility to power systems. This becomes particularly valuable in recent years with the increasing shares of intermittent renewable resources. However, due to emphasis on thermal generation in the current market practices, the flexibility from PSHUs have not been fully explored and utilized. This paper proposes a configuration based pumped storage hydro (PSH) model for the day-ahead market, in order to enhance the use of PSH resources in the system. A strategic design of incorporating and fully optimizing PSHUs in the day-ahead market is presented. Here, we show the compactness of the proposed model. Numerical studies are presented in an illustrative test system and the Midcontinent Independent System Operator (MISO) system.
Security-Constrained Unit Commitment for Electricity Market: Modeling, Solution Methods, and Future Challenges
This paper summarizes the technical activities of the IEEE Task Force on Solving Large Scale Optimization Problems in Electricity Market and Power System Applications. This Task Force was established by the IEEE Technology and Innovation Subcommittee to first review the state-of-the-art of the security-constrained unit commitment (SCUC) business model, its mathematical formulation, and solution techniques in solving electricity market clearing problems. The Task Force then investigated the emerging challenges of future market clearing problems and presented efforts in building benchmark mathematical and business models.
Data-Based Resilience Enhancement Strategies for Electric-Gas Systems Against Sequential Extreme Weather Events
Some extreme weather events, such as the hurricane, pass through an area sequentially and thus are called sequential extreme weather events (SEWEs). This paper proposes a data-based robust optimization (RO) model to enhance the resilience of the integrated electricity and gas system (IEGS) against SEWEs. Specifically, the SEWE strikes the IEGS sequentially. After each attack, the system state is adjusted immediately to minimize the maximized expected system cost caused by the SEWE. The attack-defense procedures are repeated alternatively during the SEWE. Preventive measures, hardening, are made in advance to reduce the impact of sequential attacks. The entire process is formulated as a multi-period RO model. Furthermore, it is proved that the most effective resilience enhancement strategies for this model are the same as those for a two-stage RO model, which can be solved by the nested column-and-constraint generation (C&CG) algorithm. In addition, the property of SEWEs, sequentially endangering limited regions of the IEGS, is incorporated to build a data-based uncertainty set and reduce its conservativeness. Simulation results on two IEGSs validate the effectiveness of the proposed model.
A Bilevel Approach for Identifying the Worst Contingencies for Nonconvex Alternating Current Power Systems
We address the bilevel optimization problem of identifying the most critical attacks to an alternating current (AC) power flow network. The upper-level binary maximization problem consists of choosing an attack that is treated as a parameter in the lower-level defender minimization problem. Instances of the lower-level global minimization problem by themselves are NP-hard due to the nonconvex AC power flow constraints, and bilevel solution approaches commonly apply a convex relaxation or approximation to allow for tractable bilevel reformulations at the cost of underestimating some power system vulnerabilities. Our main contribution is to provide an alternative branch-and-bound algorithm whose upper bounding mechanism (in a maximization context) is based on a reformulation that avoids relaxation of the AC power flow constraints in the lower-level defender problem. Lower bounding is provided with semidefinite programming (SDP) relaxed solutions to the lower-level problem. We establish finite termination with guarantees of either a globally optimal solution to the original bilevel problem, or a globally optimal solution to the SDP-relaxed bilevel problem which is included in a vetted list of upper-level attack solutions, at least one of which is a globally optimal solution to the bilevel problem. We demonstrate through computational experiments applied to IEEE case instances both the relevance of our contribution, and the effectiveness of our contributed algorithm for identifying power system vulnerabilities without resorting to convex relaxations of the lower-level problem. We conclude with a discussion of future extensions and improvements.
Optimal Renewable Resource Allocation and Load Scheduling of Resilient Communities
This paper presents a methodology for enhancing community resilience through optimal renewable resource allocation and load scheduling in order to minimize unserved load and thermal discomfort. The proposed control architecture distributes the computational effort and is easier to be scaled up than traditional centralized control. The decentralized control architecture consists of two layers: The community operator layer (COL) allocates the limited amount of renewable energy resource according to the power flexibility of each building. The building agent layer (BAL) addresses the optimal load scheduling problem for each building with the allowable load determined by the COL. Both layers are formulated as a model predictive control (MPC) based optimization. Simulation scenarios are designed to compare different combinations of building weighting methods and objective functions to provide guidance for real-world deployment by community and microgrid operators. The results indicate that the impact of power flexibility is more prominent than the weighting factor to the resource allocation process. Allocation based purely on occupancy status could lead to an increase of PV curtailment. Further, it is necessary for the building agent to have multi-objective optimization to minimize unserved load ratio and maximize comfort simultaneously.
A Novel Matching Formulation for Startup Costs in Unit Commitment
We present a novel formulation for startup cost computation in the unit commitment problem (UC). Both the proposed formulation and existing formulations in the literature are placed in a formal, theoretical dominance hierarchy based on their respective linear programming relaxations. The proposed formulation is tested empirically against existing formulations on large-scale unit commitment instances drawn from real-world data. While requiring more variables than the current state-of-the-art formulation, our proposed formulation requires fewer constraints, and is empirically demonstrated to be as tight as a perfect formulation for startup costs. This tightening reduces the computational burden in comparison to existing formulations, especially for UC instances with large variability in net-load due to renewables production.