Search NASA⌕ Search

SEARCH · Search NASA

Results for “linear programming problem”

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.

At least 37 records · Page 2

LEISURE: Load-Balanced Network-Wide Traffic Measurement and Monitor Placement

We report that network-wide traffic measurement is of interest to network operators to uncover global network behavior for the management tasks of traffic accounting, debugging or troubleshooting, security, and traffic engineering. Increasingly, sophisticated network measurement tasks such as anomaly detection and security forensic analysis are requiring in-depth fine-grained flow-level measurements. However, performing in-depth per-flow measurements (e.g., detailed payload analysis) is often an expensive process. Given the fast-changing Internet traffic landscape and large traffic volume, a single monitor is not capable of accomplishing the measurement tasks for all applications of interest due to its resource constraint. Moreover, uncovering global network behavior requires network-wide traffic measurements at multiple monitors across the network since traffic measured at any single monitor only provides a partial view and may not be sufficient or accurate. These factors call for coordinated measurements among multiple distributed monitors. In this paper, we present a centralized optimization framework, LEISURE (Load- EqualIzed meaSUREment), for load-balancing network measurement workloads across distributed monitors. Specifically, we consider various load-balancing problems under different objectives and study their extensions to support both fixed and flexible monitor deployment scenarios. We formulate the latter flexible monitor deployment case as an MILP (Mixed Integer Linear Programming) problem and propose several heuristic algorithms to approximate the optimal solution and reduce the computation complexity. We evaluate LEISURE via detailed simulations on Abilene and GEANT network traces to show that LEISURE can achieve much better load-balanced performance (e.g., 4.75 × smaller peak workload and 70 × smaller variance in workloads) across all coordinated monitors in comparison to a naive solution (uniform assignment) to accomplish network-wide traffic measurement tasks under the fixed monitor deployment scenario. Lastly, we also show that under the flexible monitor deployment setting, our heuristic solutions can achieve almost the same load-balancing performance as the optimal solution while reducing the computation times by a factor up to 22.5 × in Abilene and 800 × in GEANT.

42 ENGINEERING↗

Complete Assembly of Circular and Chloroplast Genomes Based on Global Optimization

This paper focuses on the last two stages of genome assembly, namely scaffolding and gap-filling, and shows that they can be solved as part of a single optimization problem. Our approach is based on modeling genome assembly as a problem of finding a simple path in a specific graph that satisfies as many as possible of the distance constraints encoding the insert-size information. We formulate it as a mixed-integer linear programming problem and apply an optimization solver to find the exact solutions on a benchmark of chloroplasts. We show that the presence of repetitions in the set of unitigs is the main reason for the existence of multiple equivalent solutions that are associated to alternative subpaths. We also describe two sufficient conditions and we design efficient algorithms for identifying these subpaths. Comparisons of the results achieved by our tool with the ones obtained with recent assemblers are presented.

59 BASIC BIOLOGICAL SCIENCES↗

Hydropower flexibility valuation tool for flow requirement evaluation

Timing of generation is becoming more and more valuable. This creates greater potential tension between environmental and power system objectives since both systems require their own flow patterns. Identifying win–win outcomes in this context requires being able to discuss the value of flexibility across stakeholder groups. This research proposes a two-stage optimization method to understand hydropower flexibility to meet both environmental and power system requirements. The tool simulates the two-settlement market process in the U.S. by maximizing revenues from both the day-ahead and real-time markets, subject to plant operational limits, regulatory flow and ramping requirements, and uncertainties associated with water availability and market prices. The model is formulated as linear programming problems and solved using IBM ILOG CPLEX optimizer. By examining a range of flow requirements, ramping constraints, and storage capacities, the proposed tool shows how to make more informed decisions to weigh the cost of specific flow requirements in the context of the overall license requirements. Results from the case study show that revenue is more sensitive to the ramping constraints than the minimum flow constraints. We also demonstrate that removing flow constraints in a dry month increases monthly revenue by up to 118%, as opposed to only 1% in a wet month. In addition, our results suggest that using a learning-based water flow forecast results in an increase of monthly revenue up to 6.4% compared with persistence forecast.

13 HYDRO ENERGY↗

Design and analysis of optimal pre-cooling in residential buildings

Existing pre-cooling strategies provide a means of shifting or reducing the peak demand and/or energy cost in residential buildings. However, majority of them are rule-based and therefore may not be optimal in terms of cost saving, leaving room for improvement. In this paper, an integer linear programming problem that accounts for the thermal properties of a specific home, HVAC system capacity, utility rate structure, and weather conditions and makes use of a home thermal model is formulated. This problem determines the HVAC on/off control signal that minimizes the 24-h energy cost while maintaining thermal comfort and calculates the corresponding optimal indoor air temperature. The model is constructed using home thermal properties identified via data training in real-time. Through simulation, the energy performance of the proposed optimal pre-cooling strategy is investigated and compared with three rule-based operation strategies from the literature. It is found that the optimal strategy requires the least energy consumption without sacrificing thermal comfort. The superb energy performance of the optimal strategy is attributed to a longer runtime of the HVAC system in cool outdoor air conditions and to the elimination of deadband in HVAC operation, which is required by the rule-based strategies, to allow the indoor air temperature to stay near the thermal comfort upper bound as much as possible. In terms of energy cost, the rule-based operation strategies require 3.52, 1.90, and 2.79, respectively, while the optimal strategy only requires 1.52. These figures represent a saving of 56.82%, 20.00%, and 45.52%, respectively. The results suggest that the optimal strategy is indeed significantly more effective than the existing rule-based operation strategies.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Impact of heating and cooling loads on battery energy storage system sizing in extreme cold climates

Efficient operation of battery energy storage systems requires that battery temperature remains within a specific range. Current techno-economic models neglect the parasitic loads heating and cooling operations have on these devices, assuming they operate at constant temperature. In this work, these effects are investigated considering the optimal sizing of battery energy storage systems when deployed in cold environments. Here, a peak shaving application is presented as a linear programming problem which is then formulated in the PYOMO optimization programming language. The building energy simulation software EnergyPlus is used to model the heating, ventilation, and air conditioning load of the battery energy storage system enclosure. Case studies are conducted for eight locations in the United States considering a nickel manganese cobalt oxide lithium ion battery type and whether the power conversion system is inside or outside the enclosure. The results show an increase of 42% to 300% in energy capacity size, 43% to 217% in power rating, and 43% to 296% increase in capital cost dependent on location. This analysis shows that the heating, ventilation, and air conditioning load can have a large impact on the optimal sizes and cost of a battery energy storage system and merit consideration in techno-economic studies.

25 ENERGY STORAGE↗

Rolling Optimization of Transmission Network Recovery and Load Restoration Considering Hybrid Wind-Storage System and Cold Load Pickup

A common solution to deal with the stochasticity introduced by fast-ramping wind power integration is to equip wind farms (WFs) with energy storage systems (ESSs) to formulate hybrid WF-ESSs. In addition to leveling off wind power fluctuations during normal operations, a hybrid WF-ESS can be a flexible power source to accumulate the power system restoration. In this paper, we propose a rolling optimization model for transmission network recovery and load restoration considering the contributions of WF-ESSs. The proposed model is formulated as a mixed integer linear programming problem that simultaneously optimizes the amount and location of restorable load blocks as well as the restoration lines. The cold load pickup features of interrupted loads considering the outage duration are modeled in detail. A chance-constrained method is employed to deal with the uncertainty of wind power, and a rolling horizon-based framework is adopted to reduce the influence of forecast error. Case studies are conducted on both New England 39-bus system and part of a provincial power system in China. The results show that the load restoration process can be significantly accelerated by employing the proposed method and contributions of hybrid WF-ESSs to power system restoration are validated.

chance-constrained optimization↗

A scalable planning framework of energy storage systems under frequency dynamics constraints

As the penetration of renewables increases in power systems, the declining system inertia can cause frequency stability issues. Battery energy storage systems (BESSs) respond fast and therefore can relieve the low inertia difficulty but need to be appropriately sized considering the associated cost. This paper presents a novel stochastic optimization model for economically planning BESS capacity while considering the spatial–temporal correlation of wind generation and generator outages under frequency stability constraints, which include the rate-of-change of frequency (RoCoF), frequency nadir (FN), and quasi-steady-state (QSS) frequency. A set of new FN constraints that can be easily linearized is developed. To account for renewable uncertainties, a realistic uncertainty modeling approach, Random Field, is adopted to generate wind generation scenarios by considering both spatial and temporal evolutions of wind speed profiles. The ESS sizing is formulated as a mixed-integer linear programming problem and solved by using a scalable decomposition-and-coordination approach, Surrogate Absolute Value Lagrangian Relaxation (SAVLR). To further improve the scalability and reduce computational burdens, a rolling-horizon-based update is developed and incorporated into SAVLR for providing a practical solution to the long-term planning of very large-scale power systems. Finally, a modified IEEE 118-bus system and the Polish system are used to validate the effectiveness and scalability of the model and solution methodology.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Accelerating flux balance calculations in genome-scale metabolic models by localizing the application of loopless constraints

Abstract Background Genome-scale metabolic network models and constraint-based modeling techniques have become important tools for analyzing cellular metabolism. Thermodynamically infeasible cycles (TICs) causing unbounded metabolic flux ranges are often encountered. TICs satisfy the mass balance and directionality constraints but violate the second law of thermodynamics. Current practices involve implementing additional constraints to ensure not only optimal but also loopless flux distributions. However, the mixed integer linear programming problems required to solve become computationally intractable for genome-scale metabolic models. Results We aimed to identify the fewest needed constraints sufficient for optimality under the loopless requirement. We found that loopless constraints are required only for the reactions that share elementary flux modes representing TICs with reactions that are part of the objective function. We put forth the concept of localized loopless constraints (LLCs) to enforce this minimal required set of loopless constraints. By combining with a novel procedure for minimal null-space calculation, the computational time for loopless flux variability analysis (ll-FVA) is reduced by a factor of 10–150 compared to the original loopless constraints and by 4–20 times compared to the current fastest method Fast-SNP with the percent improvement increasing with model size. Importantly, LLCs offer a scalable strategy for loopless flux calculations for multi-compartment/multi-organism models of large sizes, for example, shortening the CPU time for ll-FVA from 35 h to less than 2 h for a model with more than104 reactions. Availability and implementation Matlab functions are available in the Supplementary Material or at https://github.com/maranasgroup/lll-FVA Supplementary information Supplementary data are available at Bioinformatics online.

Chan, Siu H. J. (ORCID:000000027707656X)↗

Architectures and Control of Submodule Integrated DC-DC Converters for Photovoltaic Applications

This paper describes photovoltaic (PV) module architectures with parallel-connected submodule-integrated dc-dc converters (subMICs) that improve efficiency of energy capture in the presence of partial shading or other mismatch conditions. The subMICs are bidirectional isolated dc-dc converters capable of injecting or subtracting currents to balance the module substring voltages. When no mismatches are present, the subMICs are simply shut down, resulting in zero insertion losses. It is shown that the objective of minimum subMIC power processing can be solved as a linear programming problem. A simple close-to-optimal distributed control approach is presented that allows autonomous subMIC control without the need for a central controller or any communication among the subMICs. Furthermore, the proposed control approach is well suited for an isolated-port architecture, which yields additional practical advantages including reduced subMIC power and voltage ratings. The architectures and the control approach are validated by simulations and experimental results using three bidirectional flyback subMICs attached to a standard 180-W, 72-cell PV module, yielding greater than 98% module-level power processing efficiency for a mismatch less than 25%.

Olalla, C↗

Fuzzy Energy and Reserve Co-optimization With High Penetration of Renewable Energy

In this study, we propose a fuzzy-based energy and reserve co-optimization model with consideration of high penetration of renewable energy. Under the assumption of a fixed uncertainty set of renewables, a two-stage robust model is proposed for clearing energy and reserves in the first stage and checking the feasibility and robustness of re-dispatches in the second stage. Fuzzy sets and their membership functions are introduced into the optimization model to represent the satisfaction degree of the variable uncertainty sets. The lower bound of the uncertainty set is expressed as fuzzy membership functions. The solutions are obtained by transforming the fuzzy mathematical programming formulation into traditional mixed integer linear programming problems.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

TU-EF-204-09: A Preliminary Method of Risk-Informed Optimization of Tube Current Modulation for Dose Reduction in CT

Purpose: X-rays from CT scans can increase cancer risk to patients. Lifetime Attributable Risk of Cancer Incidence for adult patients has been investigated and shown to decrease as patient age. However, a new risk model shows an increasing risk trend for several radiosensitive organs for middle age patients. This study investigates the feasibility of a general method for optimizing tube current modulation (TCM) functions to minimize risk by reducing radiation dose to radiosensitive organs of patients. Methods: Organ-based TCM has been investigated in literature for eye lens dose and breast dose. Adopting the concept in organ-based TCM, this study seeks to find an optimized tube current for minimal total risk to breasts and lungs by reducing dose to these organs. The contributions of each CT view to organ dose are determined through simulations of CT scan view-by-view using a GPU-based fast Monte Carlo code, ARCHER. A Linear Programming problem is established for tube current optimization, with Monte Carlo results as weighting factors at each view. A pre-determined dose is used as upper dose boundary, and tube current of each view is optimized to minimize the total risk. Results: An optimized tube current is found to minimize the total risk of lungs and breasts: compared to fixed current, the risk is reduced by 13%, with breast dose reduced by 38% and lung dose reduced by 7%. The average tube current is maintained during optimization to maintain image quality. In addition, dose to other organs in chest region is slightly affected, with relative change in dose smaller than 10%. Conclusion: Optimized tube current plans can be generated to minimize cancer risk to lungs and breasts while maintaining image quality. In the future, various risk models and greater number of projections per rotation will be simulated on phantoms of different gender and age. National Institutes of Health R01EB015478.

60 APPLIED LIFE SCIENCES↗

MOFA Software for the COBRA Toolbox

MOFA-COBRA is a software code for Matlab that performs Multi-Objective Flux Analysis (MOFA), a solving of linear programming problems. The leading software package for conducting different types of analyses using constrain-based models is the COBRA Toolbox for Matlab. MOFA-COBRA is an added tool for COBRA that solves multi-objective problems using a novel algorithm.

Griesemer, Marc↗

Tuning successive linear programming to solve AC optimal power flow problem for large networks

Successive linear programming (SLP) is a practical approach for solving large-scale nonlinear optimization problems. Alternating current optimal power flow (ACOPF) is no exception, particularly the large size of real-world networks. However, in order to achieve tractability, it is essential to tune the SLP algorithm presented in the literature. This paper presents a modified SLP algorithm to solve the ACOPF problem, specified by the U.S. Department of Energy’s (DOE) Grid Optimization (GO) Competition Challenge 1, within strict time limits. The algorithm first finds a near-optimal solution for the relaxed problem (i.e., Stage 1). Then, it finds a feasible solution in the proximity of the near-optimal solution (i.e., Stage 2 and Stage 3). The numerical experiments on test cases ranging from 500-bus to 30,000-bus systems show that the algorithm is tractable. Here the results show that our proposed algorithm is tractable and can solve more than 80% of test cases faster than the well-known Interior Point Method while significantly reduce the number of iterations required to solve ACOPF. The number of iterations is considered an important factor in the examination of tractability which can drastically reduce the computational time required within each iteration.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Averaging and Linear Programming in Some Singularly Perturbed Problems of Optimal Control

The paper aims at the development of an apparatus for analysis and construction of near optimal solutions of singularly perturbed (SP) optimal controls problems (that is, problems of optimal control of SP systems) considered on the infinite time horizon. We mostly focus on problems with time discounting criteria but a possibility of the extension of results to periodic optimization problems is discussed as well. Our consideration is based on earlier results on averaging of SP control systems and on linear programming formulations of optimal control problems. The idea that we exploit is to first asymptotically approximate a given problem of optimal control of the SP system by a certain averaged optimal control problem, then reformulate this averaged problem as an infinite-dimensional linear programming (LP) problem, and then approximate the latter by semi-infinite LP problems. We show that the optimal solution of these semi-infinite LP problems and their duals (that can be found with the help of a modification of an available LP software) allow one to construct near optimal controls of the SP system. We demonstrate the construction with two numerical examples.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Network-Level Optimization for Unbalanced Power Distribution System: Approximation and Relaxation

The nonlinear programming (NLP) problem to solve distribution-level optimal power flow (D-OPF) poses convergence issues and does not scale well for unbalanced distribution systems. The existing scalable D-OPF algorithms either use approximations that are not valid for an unbalanced power distribution system, or apply relaxation techniques to the nonlinear power flow equations that do not guarantee a feasible power flow solution. In this paper, we propose scalable D-OPF algorithms that simultaneously achieve optimal and feasible solutions by solving multiple iterations of approximate, or relaxed, D-OPF subproblems of low complexity. The first algorithm is based on a successive linear approximation of the nonlinear power flow equations around the current operating point, where the D-OPF solution is obtained by solving multiple iterations of a linear programming (LP) problem. The second algorithm is based on the relaxation of the nonlinear power flow equations as conic constraints together with directional constraints, which achieves optimal and feasible solutions over multiple iterations of a second-order cone programming (SOCP) problem. Finally, it is demonstrated that the proposed algorithms are able to reach an optimal and feasible solution while significantly reducing the computation time as compared to an equivalent NLPD-OPF model for the same distribution system.

24 POWER TRANSMISSION AND DISTRIBUTION↗

OPERATIONAL TOPOLOGY ESTIMATION OF THREE PHASE UNBALANCED POWER DISTRIBUTION SYSTEMS WITH OUTAGES

Distribution grid, in general, is constructionally loopy but a radially operated network. Opening and closing of suitable tie-switches allows transition from one radial topology to another. Tie-switches ensure reliability and provide restoration paths when faults (outages) occur. The estimation of the system's current operational topology is a precursor to implementing any optimal control actions (during normal operation) or restorative actions (during outage condition). The existing literature in topology detection suffers with several limitations including: (1) computationally intensive nonlinear formulations that are not scalable for large distribution systems, (2) methods requiring exhaustive search for the correct topology by enumerating the complete topological search space, and (3) approaches requiring large volumes of time-series measurements and are not applicable for estimating continuously changing operational topology. Furthermore, the existing literature on distribution grid topology estimation cannot be extended to estimate the operational topology during outage conditions. For operational topology estimation during outages, our objective is to estimate both energized radial feeder and the outaged sections. Starting with a radial topology, these methods identify outaged feeder sections and hence, are inapplicable when the current radial operational topology is not known. In this work, we present a mathematical programming approach to estimate the operational topology of a three-phase unbalanced power distribution system under both outage and normal operating conditions. The aforementioned limitations of existing literature were countered by modeling the problem as a mixed-integer linear programming (MILP) problem which minimizes the errors in available measurements while satisfying the power flow and structural constraints of the system. Specically, a minimum weighted least absolute value estimator is proposed that uses the instantaneous line flow measurements, historical/ forecasted load data, and ping measurements from a limited set of smart meters and solves an MILP to identify the operational topology based on a linearized three-phase unbalanced power flow model. The proposed approach is tested on IEEE 123-bus feeder and 1069 bus multi-feeder test system and the numerical results prove the applicability of the proposed method to large three phase unbalanced grids with high errors in measurements. It is observed that the approach performs well even at high percentages of measurement errors.

GANDLURU NAGA, ANANDINI↗

Spatial-Temporal PV Hosting Capacity Estimation and Evaluation

Evaluating Photovoltaic Hosting Capacity (PVHC) is an essential step in the process of integrating solar energy into power grids, particularly when focusing on the distribution network (DN) as the primary integration target. PVHC needs to be investigated, especially in cases where the grids are unbalanced, and their operational conditions vary spatially and temporally. This motivation prompted us to propose a scalable model tailored to this application. In this paper, we applied linearization to the alternating current optimal power flow (AC-OPF) and solar inverters, transforming the original problem into a mixed-integer linear programming (MILP) problem. Additionally, we accounted for the battery energy storage system (BESS) as a time-coupling factor for calculating PVHC. We then compared the PVHC results between the IEEE-13 bus and SMART-DS San Francisco (SFO) cases and discussed the extent to which BESS can enhance the PVHC of a DN. Furthermore, we designed a web-based graphical visualization for the SFO case, enabling user interaction with raw data and simulation results on a map through a graphical user interface (GUI). In summary, our results and findings provide valuable insights for future three-phase unbalanced AC-OPF PVHC practices and their visualization.

AC-optimal power flow↗

Notes from the Unit Commitment Linear Programming Project

The Unit Commitment Problem (UCP) is a computational bottleneck in electrical grid optimization. The problem bears a close resemblance to a similar problem in High Performance Computing: the Dynamic Volt age/Frequency Scheduling (DVFS) problem. In my earlier work I successfully tranformed the DVFS into a closely related problem amenable to a linear programming solution and was thus able to schedule problem instances several orders of magnitude larger than any that had been at tempted before. This technical report details my unsuccessful efforts to derive a similar transformation for the UCP. The problem proved impossible not because generators were either on or off, but because the state of an earlier timeslice constrains the states of latter timeslices in ways that cannot be sufficiently well approximated for useful solutions.

97 MATHEMATICS AND COMPUTING↗