Implementing a projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs.
Abstract not provided.
SEARCH · Search NASA
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.
Abstract not provided.
Residential loads, especially heating, ventilation and air conditioners (HVACs) and electric vehicles (EVs), have great potentials to provide demand flexibility which is an attribute of grid-interactive efficient buildings (GEB). Under this new paradigm, first, EV and HVAC aggregator models are developed in this paper to represent the fleet of GEBs, in which the aggregated parameters are obtained based on a new approach of data generation and least squares parameter estimation (DG-LSPE), which can deal with heterogeneous HVACs. Then, a tri-level bidding and dispatching framework is established based on competitive distribution operation with distribution locational marginal price (DLMP). Furthermore, the first two levels form a bilevel model to optimize the aggregators’ payment and to represent the interdependency between load aggregators and the distribution system operator (DSO) using DLMP, and the third level is to dispatch the optimal load aggregation to all residents by the proposed priority list-based demand dispatching algorithm. Finally, case studies on a modified IEEE 33-Bus system illustrate three main technical reasons of payment reduction due to demand flexibility: load shift, DLMP step changes, and power losses. They can be used as general guidelines for better decision-making for future planning and operation of demand response programs.
PAO is a Python-based package for Adversarial Optimization. The goal of this package is to provide a general modeling and analysis capability for bilevel, trilevel and other multilevel optimization forms that express adversarial dynamics. PAO integrates two different modeling abstractions: 1. Algebraic models extend the modeling concepts in the Pyomo algebraic modeling language to express problems with an intuitive algebraic syntax. Thus, we expect that this modeling abstraction will commonly be used by PAO end-users. 2. Compact models express objective and constraints in a manner that is typically used to express the mathematical form of these problems (e.g. using vector and matrix data types). PAO denes custom Multilevel Problem Representations (MPRs) that simplify the implementation of solvers for bilevel, trilevel and other multilevel optimization problems.
With grid modernization efforts, future distribution networks, which consist of various distributed generators and flexible loads, will be more flexible and active. All new network components of distributed energy resources (DERs) drive and enable the transition towards a market-based distribution net-work that seeks the optimal allocation of all DERs. To address challenges associated with DERs, one promising solution is to utilize demand-side flexibility of building loads facilitated by demand response (DR) programs and provide ancillary grid services through distribution-level markets. Under this new paradigm, this paper proposes an efficient DR management strategy incorporating emerging price signals of distribution markets, i.e., distribution locational marginal price (DLMP), based on a hierarchical transactive control approach. The proposed approach establishes a two-layer decision-making framework; the upper layer formulates a bilevel model to obtain an optimal demand response (ODR) under DLMP, and the lower layer employs model-free control to dispatch the (aggregated) ODR to individual end users. Numerical case studies using a modified IEEE 33 test network are performed to verify the effectiveness of the proposed approach; load shifting and peak shaving for the distribution system operator and payments’ reduction for end users while maintaining their comfort.
Energy storage (ES) is a pivotal technology for dealing with the challenges caused by the integration of renewable energy sources. It is expected that a decrease in the capital cost of storage will eventually spur the deployment of large amounts of ES. These devices will provide transmission services, such as spatiotemporal energy arbitrage, i.e., storing surplus energy from intermittent renewable sources for later use by loads while reducing the congestion in the transmission network. This paper proposes a bilevel program that determines the optimal location and size of storage devices to perform this spatiotemporal energy arbitrage. This method aims to simultaneously reduce the system-wide operating cost and the cost of investments in ES while ensuring that merchant storage devices collect sufficient profits to fully recover their investment cost. Finally, the usefulness of the proposed method is illustrated using a representative case study of the ISO New England system with a prospective wind generation portfolio.
Network segmentation of a power grid's communication system can make the grid more resilient to cyberattacks. Here we develop a novel trilevel programming model to optimally segment a grid communication system, taking into account the actions of an information technology (IT) administrator, attacker, and grid operator. The IT administrator is allowed to segment existing networks, and the attacker is given a budget to inflict damage on the grid by attacking the segmented communication system. Finally, the grid operator can redispatch the grid after the attack to minimize damage. The resulting problem is a trilevel interdiction problem that we solve using a branch and bound algorithm for bilevel problems. We demonstrate the benefits of optimal network segmentation through case studies on the 9-bus Western System Coordinating Council (WSCC) system and the 30-bus IEEE system. These examples illustrate that network segmentation can significantly reduce the threat posed by a cyberattacker.
Abstract Passive wave transformation via nonlinearity is ubiquitous in settings from acoustics to optics and electromagnetics. It is well known that different nonlinearities yield different effects on propagating signals, which raises the question of “what precise nonlinearity is the best for a given wave tailoring application?” In this work, considering a one-dimensional spring-mass chain connected by polynomial springs (a variant of the Fermi-Pasta-Ulam-Tsingou system), we introduce a bilevel inverse design method which couples the shape optimization of structures for tailored constitutive responses with reduced-order nonlinear dynamical inverse design. We apply it to two qualitatively distinct problems—minimization of peak transmitted kinetic energy from impact, and pulse shape transformation—demonstrating our method’s breadth of applicability. For the impact problem, we obtain two fundamental insights. First, small differences in nonlinearity can drastically change the dynamic response of the system, from severely under- to outperforming a comparative linear system. Second, the oft-used strategy of impact mitigation via “energy locking” bistability can be significantly outperformed by our optimal nonlinearity. We validate this case with impact experiments and find excellent agreement. This study establishes a framework for broader passive nonlinear mechanical wave tailoring material design, with applications to computing, signal processing, shock mitigation, and autonomous materials.
This paper proposes a new optimization model and algorithm for long-term capacity expansion planning of reliable power generation systems. The model optimizes both investment decisions (e.g., size, location, and time to install, retire and decommission facilities) and operation decisions (e.g., on/off status, operating capacity, and expected power output). It is also able to optimize reserve systems (or backup systems), as well as the main systems, to improve power systems reliability. An impact of operational strategies of generators (i.e., participating in electricity production vs. remaining as idle units during operation) on power systems reliability is considered. Probability of equipment failures and capacity failure states are used to rigorously estimate the power systems reliability depending on design and operation strategies. The optimization model is formulated with Generalized Disjunctive Programming (GDP), which is reformulated as a mixed-integer linear programming (MILP) model using the Hull relaxation. Two reliability-related penalties, such as downtime penalty and unmet demand penalty, are included in the objective function to maximize reliability while minimizing the total net present cost. Furthermore, a bilevel decomposition with tailored cuts is developed to reduce computational times of the multi-scale optimization model. The effectiveness of the proposed model is shown by comparing the results with the results obtained from the expansion planning models that do not explicitly consider reliability. In conclusion, we also show that the proposed bilevel decomposition is computationally efficient for solving large scale problems through 5-years and 10-years planning case studies.
PAO supports the formulation and analysis of mathematical models for complex optimization applications. This capability is commonly associated with algebraic modeling languages (AMLs), which support the description and analysis of mathematical models with a high-level language. PAO is derived from the Pyomo subpackage pyomo.bilevel, which has been deprecated. PAO supports the formulation and solution of optimization models that explicitly represent adversarial behavior. This includes variances of bilevel programming, including methods that represent challenging problems with discrete decisions and uncertain model parameters.
This study investigates the technical and economic feasibility of using high levels of solar energy penetration up to 400 MW into a smart grid system of 60,000 smart houses. A novel non-cooperative Stackelberg game is introduced that incorporates the profitability of the supply-side and helps in solving problems related to overgeneration and photovoltaic curtailment. The non-cooperative game is intended to find the optimal dynamic prices that would leverage distributed storage through the demand-side to stabilize the power grid operation. Ten cases are studied with five photovoltaic plant sizes and two battery designs. Here, a novel quantitative analysis of high levels of solar penetration as a percentage of the total electricity demand is introduced to evaluate the technical feasibility of the studied cases. To evaluate the economic viability of the proposed smart grid system, four metrics were used: the levelized cost of energy, the levelized cost of storage, the payback period, and the net present value. Two out of ten studied cases were concluded to be the most promising cases, one with a solar photovoltaic plant size of 200 MW and the other with 300 MW. The case with 300 MW solar plant is preferred as it paves the way for more solar energy deployment with a solar penetration percentage up to 67.78%. This case had a payback period of 10.72 years and a net present value of $\$51.44$ M for the solar plant and a payback period of 12.06 years and a net present value of $\$40.75$ M for the demand-side.
Market power exercise in the electricity markets distorts market prices and diminishes social welfare. Many markets have implemented market power mitigation processes to eliminate the impact of such behavior. The design of mitigation mechanisms has a direct influence on investors' profitability and thus mid-/long-term resource adequacy. In order to evaluate the effectiveness of the existing market power mitigation mechanisms, this paper proposes a mitigation-aware strategic bidding model and studies the bidding strategies of the market participants under current practice. The proposed bidding model has a bilevel structure with strategic participant's profit maximization problem in the upper level and the dispatch problem for market operators in the lower level. In particular, the consideration of potential offer mitigation is incorporated as upper-level constraints based on the conduct and impact tests. This bilevel problem is reduced to a single-level mixed-integer linear program using the KKT optimality conditions, duality theory, and linearization. Numerical results illustrate how a strategic player can exercise market power to achieve a higher profit even under the current market power mitigation process and we analyze the social impact that the market power exercise results.
With the intermittency that comes with electricity generation from renewables, utilizing dynamic pricing will encourage the demand-side to respond in a smart way that would minimize the electricity costs and flatten the net electricity demand curve. Determining the optimal dynamic pricing profile that would leverage distributed storage to flatten the curve is a novel idea that needs to be studied. Moreover, the economic feasibility of utilizing distributed electrical energy storage is still not given in the literature. Therefore, in this paper, a novel way of solving a citywide dynamic model using a bilevel programming algorithm is introduced. The problem is developed as a novel non-cooperative Stackelberg game that utilizes air-conditioning systems and electrical storage through the end-users to determine the optimal dynamic pricing profile. The results show that the combined effect of utilizing demand-side air-conditioning systems and distributed storage together can flatten the curve while employing the optimal dynamic pricing profile. An economic study is performed to determine the economic feasibility of 20 different cases with different battery designs and the level of solar penetration. Three metrics were used to evaluate the economic performance of each case: the levelized cost of storage, the levelized cost of energy, and the simple payback period. Most cases had levelized cost of storage values lower than 0.457 $/kWh, which is the lower bound available in the literature. Seven out of 16 cases have a simple payback period shorter than the lifetime of the system (25 years). The case with a 100 MW PV power plant and a battery storage of size 597 MWh, was found to be the most promising case with a simple payback period of 12.71 years for the photovoltaic plant and 19.86 years for the demand-side investments.
Abstract This paper considers an extension of the shortest path network interdiction problem that incorporates robustness to account for parameter uncertainty. The shortest path interdiction problem is a game of two players with conflicting agendas and capabilities: an evader, who traverses the arcs of a network from a source node to a sink node using a path of shortest length, and an interdictor, who maximizes the length of the evader's shortest path by interdicting arcs on the network. It is usually assumed that the parameters defining the network are known exactly by both players. We consider the situation where the evader assumes the nominal parameter values while the interdictor uses robust optimization techniques to account for parameter uncertainty or sensor degradation. We formulate this problem as a nonlinear mixed‐integer semi‐infinite bilevel program and show that it can be converted into a mixed‐integer linear program with a second order cone constraint. We use random geometric networks and transportation networks to perform computational studies and demonstrate the unique decision strategies that our variant produces. Solving the shortest path interdiction problem with asymmetric uncertainty protects the interdictor from investing in a strategy that hinges on key interdictions performing as promised. It also provides an alternate strategy that mitigates the risk of these worst‐case possibilities.
Optimizing a system’s resilience can be challenging, especially when it involves considering both the inherent resilience of a robust design and the active resilience of a health management system to a set of computationally-expensive hazard simulations. While prior work has developed specialized architectures to effectively and efficiently solve combined design and resilience optimization problems, the comparison of these architectures has been limited to a single case study. To further study resilience optimization formulations, this work develops a problem repository which includes previously-developed resilience optimization problems and additional problems presented in this work: a notional system resilience model, a pandemic response model, and a cooling tank hazard prevention model. This work then uses models in the repository at large to understand the characteristics of resilience optimization problems and study the applicability of optimization architectures and decomposition strategies. Based on the comparisons in the repository, applying an optimization architecture effectively requires understanding the alignment and coupling relationships between the design and resilience models, as well as the efficiency characteristics of the algorithms. While alignment determines the necessity of a surrogate of resilience cost in the upper-level design problem, coupling determines the overall applicability of a sequential, alternating, or bilevel structure. Additionally, the application of decomposition strategies is dependent on there being limited interactions between variable sets, which often does not hold when a resilience policy is parameterized in terms of actions to take in hazardous model states rather than specific given scenarios.
In this paper, we study the profit maximization problem of a virtual power plant trading in the continuous intraday electricity market. Our virtual power plant model is compatible with renewable, and thermal assets, covering a range of virtual power plants currently participating in energy markets. We model the trading problem as a bilevel multistage stochastic program. The upper level of the problem accounts for the profit maximization of the virtual power plant with explicit modeling of the technical constraints of the operational status of the thermal power plant including minimum start-up and shut-down times, ramp-up and ramp-down rates, and minimum generation level. The upper level also decides which continuous and indivisible (fill-or-kill) orders are submitted to the market. The lower-level problem accounts for the clearing of the continuous intraday market, i.e., matching of buy and sell orders. Because of the presence of fill-or-kill orders, the lower-level problem is mixed-integer, which prevents its direct conversion to a single-level problem using duality. In order to solve this challenging problem, we develop a convex-hull extended formulation for the lower-level problem, apply duality theory to obtain a single-level stochastic equivalent formulation, and employ McCormick envelopes to turn the problem into a multistage stochastic mixed-integer linear problem, which we solve using the stochastic dual dynamic integer programming algorithm. We conduct numerical experiments and analyze the optimal trading behavior of a virtual power plant trading in an ideal continuous market without arbitrage.
Time series forecasting is an extensively studied subject in statistics, economics, and computer science. Exploration of the correlation and causation among the variables in a multivariate time series shows promise in enhancing the performance of a time series model. When using deep neural networks as forecasting models, we hypothesize that exploiting the pairwise information among multiple (multivariate) time series also improves their forecast. If an explicit graph structure is known, graph neural networks (GNNs) have been demonstrated as powerful tools to exploit the structure. In this work, we propose learning the structure simultaneously with the GNN if the graph is unknown. We cast the problem as learning a probabilistic graph model through optimizing the mean performance over the graph distribution. The distribution is parameterized by a neural network so that discrete graphs can be sampled differentiably through reparameterization. Empirical evaluations show that our method is simpler, more efficient, and better performing than a recently proposed bilevel learning approach for graph structure learning, as well as a broad array of forecasting models, either deep or non-deep learning based, and graph or non-graph based.
In this paper, the principal-agent bilevel programming problem with integral operator is considered, in which the upper-level object is the agent that maximizes its expected utility with respect to an agreed compensation contract. The constraints are the principal’s participation and the agent’s incentive compatibility. The latter is a lower-level optimization problem with respect to its private action. To solve an equivalent single-level nonconvex programming problem with integral operator, a modified homotopy method for solving the Karush–Kuhn–Tucker system is proposed. This method requires only an interior point and, not necessarily, a feasible initial approximation for the constraint shifting set. Global convergence is proven under some mild conditions. Numerical experiments were performed by our homotopy method as well as by fmincon in Matlab, LOQO and MINOS. The experiments showed that: designing a piecewise linear contract is much better than designing a piecewise constant contract and only needs to solve a much lower-dimensional optimization problem and hence needs much less computation time; the optimal value of the principal-agent model with designing piecewise linear contract tends to a limitation, while the discrete segments gradually increase; and finally, the proposed modified homotopy method is feasible and effective.
Blending biomass materials of different physical or chemical properties provides an opportunity to adjust the quality of the feedstock to meet the specifications of the conversion platform. We propose a model which identifies the right mix of biomass to optimize the performance of the thermochemical conversion process at the mini-mum cost. This is a chance-constraint programming (CCP) model which takes into account the stochastic nature of biomass quality. The proposed CCP model ensures that process requirements, which are impacted by physical and chemical properties of biomass, are met most of the time. We consider two problem settings, a centralized and a decentralized supply chain. We propose a mixed-integer linear program to model the blending problem in the centralized setting and a bilevel program to model the blending problem in the decentralized setting. We use the sample average approximation method to approximate the chance constraints, and propose solution algorithms to solve this approximation. We develop a case study for South Carolina using data provided by the Billion Ton Study. Based on our results, the blends identified consist mainly of pine and softwood residues. The blends identified and the suppliers selected by both models are different. The cost of the centralized supply chain is 2%–6% lower. The implications of these results are twofold. First, these results could lead to improved collaborations in the supply chain. Second, these results provide an estimate of the approximation error from assuming centralized decision making in the supply chain.