Search NASA⌕ Search

Engineering topics

Ostrowski, Jim

Publications and source records attributed to Ostrowski, Jim.

Economic Risk-Informed Maintenance Planning and Asset Management (Final Report)

The proposed work will provide a holistic framework for cost-minimizing risk-informed maintenance planning, including inspection, in light water reactors (LWRs). Specifically, we develop a two-tier framework that (a) coarsely minimizes the total maintenance cost during the remaining normal operating cycle of the plant prior to the next scheduled outage (long-term), subject to safety requirements, and (b) uses the outputs of the first model to develop a secondary optimization model to finely schedule maintenance activities to maximize the financial impact of these activities in the next week (short-term).

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Empirical performance bounds for quantum approximate optimization

The quantum approximate optimization algorithm (QAOA) has been put forth as a method for near-term quantum computers to solve optimization problems. However, assessments of QAOA performance have mostly focused on small structured problem instances while performance on more general instances is less clear. Here, we numerically simulate QAOA pure state dynamics for every instance of MaxCut on non-isomorphic unweighted graphs with nine or fewer vertices with depth parameters p ≤ 3. We find the approximation ratios and optimized circuit parameters concentrate across graphs of a given size and empirically show increases in concentration as graph size increases. The parameter concentration leads to two median-angle heuristics that overcome difficulties in QAOA parameter optimization and obtain mean approximation ratios within 3% and 0.2% of the optimal. We also analyze the probability to measure an optimal solution and find increasing variations between graphs as depth increases, in stark contrast to the approximation ratios which concentrate as depth increases. Furthermore, the resulting benchmark data set gives empirical bounds for on-going experimental realizations and lays groundwork for theoretical extensions to greater problem sizes and depths where QAOA may prove important for practically relevant problems.

79 ASTRONOMY AND ASTROPHYSICS↗

Impact of graph structures for QAOA on MaxCut

The quantum approximate optimization algorithm (QAOA) is a promising method of solving combinatorial optimization problems using quantum computing. QAOA on the MaxCut problem has been studied extensively on graphs with specific structure; however, little is known about the general performance of the algorithm on arbitrary graphs. Here, we investigate how different graph characteristics correlate with QAOA performance at depths at most three on the MaxCut problem for all connected non-isomorphic graphs with at most eight vertices. Some good predictors of QAOA success relate to graph symmetries, odd cycles, and density. For example, on eight vertex graphs, the average probability for selecting an optimal solution for graphs that contain no odd cycles after three iterations of QAOA is 60.6% compared to 48.2% for those that do. The data generated from these studies are shared in a publicly accessible database to serve as a benchmark for QAOA calculations and experiments. Knowing the relationship between structure and performance can be used to identify classes of combinatorial problems that are likely to exhibit a quantum advantage.

97 MATHEMATICS AND COMPUTING↗

Practice Summary: Improved Reliability via Optimization in Residential Microgrids

Southern Company is an electric utility that is embracing residential microgrids as a platform for distributed energy. The first residential microgrid in the southeastern United States was constructed in Hoover, Alabama, as a testbed for development. To operate the microgrid, we developed an optimization model for unit commitment and economic dispatch. We report the optimization model was implemented in a microgrid central controller and tested under various operational scenarios. Challenges also include developing a pricing algorithm to deliver price forecasts to the residential homes in the microgrid and open-source software restrictions.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Reducing the computational burden of a microgrid energy management system

As renewable technology advances and decreases in cost, microgrids are becoming an appealing means of distributed generation both for isolated communities and integrated with existing electrical grid systems. Due to their small size, however, microgrids may have financial limitations which preclude them from using commercial software to optimize control of their assets. Open-source optimization solvers are a viable alternative, but increase computation time. This work expands on a rolling horizon optimization framework for economic dispatch within an existing residential microgrid located in Hoover, Alabama. The microgrid has an open-source solver requirement and a need for quick solution time on a rolling horizon as opposed to a day-ahead commitment. We present a method of reducing integer variables by relaxation which completes two goals: reduction in computation time for real-time operations, and reduction in daily operational cost for the microgrid. Seasonal data for load and photovoltaic (PV) power was also collected from the microgrid to facilitate simulation testing. Computation time was successfully reduced using multiple variations of the relaxation method, while obtaining solution quality with operational cost similar to or better than the original model.

24 POWER TRANSMISSION AND DISTRIBUTION↗

The Ramping Polytope and Cut Generation for the Unit Commitment Problem

We present a perfect formulation for a single generator in the unit commitment problem, inspired by the dynamic programming approach taken by Frangioni and Gentile. This generator can have characteristics such as ramp-up/ramp-down constraints, time-dependent start-up costs, and start-up/shut-down limits. To develop this perfect formulation, we extend the result of Balas on unions of polyhedra to present a framework allowing for flexible combinations of polyhedra using indicator variables. Here, we use this perfect formulation to create a cut-generating linear program, similar in spirit to lift-and-project cuts, and demonstrate computational efficacy of these cuts in a utility-scale unit commitment problem.

97 MATHEMATICS AND COMPUTING↗

Exploiting Identical Generators in Unit Commitment

Here, we present sufficient conditions under which thermal generators can be aggregated in mixed-integer linear programming (MILP) formulations of the unit commitment (UC) problem, while maintaining feasibility and optimality for the original disaggregated problem. Aggregating thermal generators with identical characteristics (e.g., minimum/maximum power output, minimum up/down-time, and cost curves) into a single unit reduces redundancy in the search space induced by both exact symmetry (permutations of generator schedules) and certain classes of mutually non-dominated solutions. We study the impact of aggregation on two large-scale UC instances, one from the academic literature and another based on real-world operator data. Our computational tests demonstrate that when present, identical generators can negatively affect the performance of modern MILP solvers on UC formulations. Further, we show that our reformation of the UC MILP through aggregation is an effective method for mitigating this source of computational difficulty.

97 MATHEMATICS AND COMPUTING↗

A modeling framework for optimal energy management of a residential building

Residential buildings are currently equipped with energy production facilities, e.g., solar rooftops and batteries, which in conjunction with smart meters, can function as smart energy hubs coordinating the loads and the resources in an optimal manner. This paper presents a mathematical model for the optimal energy management of a residential building and proposes a centralized energy management system (CEMS) framework for off-grid operation. The model of each component of the hub is integrated within the CEMS. The optimal decisions are determined in real-time by considering these models with realistic parameter settings and customer preferences. Model predictive control (MPC) is used to adapt the optimal decisions on a receding horizon to account for the deviations in the system inputs. Simulation results are presented to demonstrate the feasibility and effectiveness of the proposed CEMS framework. Results show that the proposed CEMS can reduce the energy cost and energy consumption of the customers by approximately 17% and 8%, respectively, over a day. In conclusion, using the proposed CEMS, the total charging cycles of the ESS were reduced by more than 50% in a day.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗