Search NASA⌕ Search

SEARCH · Search NASA

Results for “Integer programming”

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 217 records · Page 12

Strategic Placement and Sizing of Distributed Generation for Resilience Enhancement of Distribution Grids With Microgrid Formation

The rise in frequency and severity of extreme weather events highlights the need for resilient power distribution networks. Microgrids can help improve the resilience of distribution grids by providing continuous power supply using local distribution generation (DG) when the distribution grid fails. In this paper, we propose an approach for optimal placement and sizing of DG to form multiple microgrids throughout the distribution network by restoration actions such as switching operations in case of distribution grid outages caused by extreme weather events. Considering the randomness of damaged distribution lines, the DG placement and sizing problem is formulated as a two-stage stochastic mixed-integer program, with the first stage determining the placement and size of DG, and the second stage focusing on minimizing the amount of load shedding through network restoration and microgrid formations for each scenario. Due to the large number of scenarios, the sample average approximation (SAA) method is employed to solve the problem. The results of case studies on a modified IEEE 33 bus distribution grid demonstrate the effectiveness of the proposed DG placement and sizing strategy in improving the resilience of distribution grids by allowing the formation of multiple microgrids. In addition, the robustness and accuracy of the SAA method are validated through various case studies.

Distributed generation planning↗

A Privacy Preserving Model-Free Optimization and Control Framework for Demand Response from Residential Thermal Loads

We consider the problem of optimizing the cost of procuring electricity for a large collection of homes managed by a load serving entity, by pre-cooling or pre-heating the thermal inertial loads in the homes to avoid procuring power during periods of peak electricity pricing. We would like to accomplish this objective in a completely privacy-preserving and model-free manner, that is, without direct access to the state variables (temperatures or power consumption) or the dynamical models (thermal characteristics) of individual homes, while guaranteeing personal comfort constraints of the consumers. We propose a two-stage optimization and control framework to address this problem. In the first stage, we use a long short-term memory (LSTM) network to predict hourly electricity prices, based on historical pricing data and weather forecasts. Given the hourly price forecast and thermal models of the homes, the problem of designing an optimal power consumption trajectory that minimizes the total electricity procurement cost for the collection of thermal loads can be formulated as a large-scale integer program (with millions of variables) due to the on-off cyclical dynamics of such loads. We provide a simple heuristic relaxation to make this large-scale optimization problem model-free and computationally tractable. In the second stage, we translate the results of this optimization problem into distributed open-loop control laws that can be implemented at individual homes without measuring or estimating their state variables, while simultaneously ensuring consumer comfort constraints. We demonstrate the performance of this approach on a large-scale test case comprising of 500 homes in the Houston area and benchmark its performance against a direct model-based optimization and control solution.

Sivaranjani, S.↗

The Effects of a Dynamic Spectrum Access Overlay in LTE-Advanced Networks

As early as 2014, mobile network operators’ spectral capacity will be overwhelmed by the demand brought on by new devices and applications. To augment capacity and meet this demand, operators may choose to deploy a Dynamic Spectrum Access (DSA) overlay. The signaling and functionality required by such an overlay have not yet been fully considered in the architecture of the planned Long Term Evolution Advanced (LTE+) networks. This paper presents a Spectrum Accountability framework to be integrated into LTE+ architectures, defining specific element functionality, protocol interfaces, and signaling flow diagrams required to enforce the rights and responsibilities of primary and secondary users. We also quantify, through integer programs, the benefits of using DSA channels to augment capacity under a scenario in which LTE+ network can opportunistically use TV and GSM spectrum. The framework proposed here may serve as a guide in the development of future LTE+ network standards that account for DSA.

42 ENGINEERING↗

Solving Open MIP Instances with ParaSCIP on Supercomputers Using up to 80,000 Cores

This paper describes how we solved 12 previously unsolved mixed-integer programming (MIP) instances from the MIPLIB benchmark sets. To achieve these results we used an enhanced version of ParaSCIP, setting a new record for the largest scale MIP computation: up to 80,000 cores in parallel on the Titan supercomputer. In this paper we describe the basic parallelization mechanism of ParaSCIP, improvements of the dynamic load balancing and novel techniques to exploit the power of parallelization for MIP solving. We give a detailed overview of computing times and statistics for solving open MIPLIB instances.

97 MATHEMATICS AND COMPUTING↗

Model-Based Framework to Optimize Charger Station Deployment for Battery Electric Vehicles

The development of battery electric vehicles (BEVs) is accelerating due to their environmental advantages over gasoline and diesel-powered vehicles, including a decrease in air pollution and an increase in energy efficiency. The deployment of charging infrastructure will need to increase to keep pace with demand, especially for large commercial vehicles for which few public chargers currently exist. In this paper, a new flexible framework is proposed for optimizing the placement of charging stations for BEVs, within which different physical models and optimization techniques may be used. Furthermore, a set of metrics is suggested to help enforce complex constraints and facilitate direct comparison between different optimization techniques. Unlike many existing charger placement techniques, the proposed method directly considers the historical driving patterns on a vehicle-by-vehicle basis, using transparent models to assess impacts of candidate charger placements, thus improving the explainability of the results. In the developed framework, modeled BEVs are first generated along the road network to mimic historical traffic data and are simulated traveling along a given route according to a simplified vehicle model. During the simulation, the charger placement problem is initially relaxed to allow vehicles to charge at any node along the road network, and vehicle states are tracked to assess areas of high charging demand. Charging stations are then placed based on the results of the relaxed simulation, and suggested placements are evaluated via road network simulation with fixed charger locations. This proposed framework is applied to a sample problem of placing charging stations along five major highway corridors for Class 8 over-the-road electric trucks. A novel mixed integer programming (MIP) formulation is proposed to optimize charger placements based upon the expected charging demand. Constraints were imposed on the final placement results to limit expected wait times at each station and ensure a minimum threshold of trucking routes are viable for BEVs. The results demonstrate the flexibility and potential effectiveness of the developed model-based framework for scalable charger station deployment.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Data-Enabled Building Energy Savings (D-E BES)

Building sector energy consumption represents a significant fraction of the overall energy consumption in urban communities. While there has been increasing focus on the development of smart environments to support energy savings in urban commercial buildings, the development of smart environments for the residential sector has been less common. Instead, urban residential energy-saving efforts have focused on improving a building's physical infrastructure, introducing energy-saving appliances, and motivating residents to adopt energy conservation practices. Herein this paper illustrates that creating an affinity between a building resident's thermal preferences and a building apartment's unregulated thermal environment represents an alternative means of generating an energy-efficient environment for multi-family, residential buildings. Two years of 15-min interval summer data, obtained from smart cyber-physical systems installed in 310 apartments across two New York City buildings, is used to develop data-enabled (D-E) models of resident thermal preference and unregulated apartment temperatures. Both of these models use a linear mixed-effects approach. The alignment of optimal resident-apartment pairs is then formulated as an integer-programming problem to explore the building energy saving (BES) potential associated with minimizing the difference between unregulated apartment temperature and the residents' thermal preference based on summer cooling loads. The work shows that the energy saving potential vary with a building's physical characteristics as well as the variation in residents' thermal preferences. The work further demonstrates that both the unregulated temperature and the resident's preferred temperature in a given apartment are not only affected by outside temperature and external relative humidity, but also strongly affected by the apartment's geographic orientation. For the specific buildings considered, up to 28% cooling energy saving is possible with full alignment. The paper provides all building monitoring data as an open source data set.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Inverse Calculation of Burden Distribution Matrix Using B-spline Model Based PDF control in Blast Furnace Burden Charging Process

The inverse calculation of burden distribution matrix (BDM) is one of the most important challenges in the blast furnace operation in iron-making processes. In general, blast furnace consumes 65% of the total energy for the whole steel-making. Focusing on this practical challenge, this article proposes a new burden distribution spatial model in calculating burden charging process, and develops a B-spline approximation-based probability density function (PDF) control algorithm to assign the expected thickness distribution of burden layer and, thus, develops a new method for the required inverse calculation of BDM. First, a novel method for the thickness distribution of burden layer is given using B-spline model to produce an expected distribution shape subjected to a desired tracking within a specific spatial constraint. Then, according to the coexistence of continuous and bounded discrete variables in BDM, a novel hybrid optimization control method by combining integer programming and PDF tracking is further established for the effective inverse calculation of BDM. Finally, the proposed PDF-based iterative inverse calculation of BDM using B-spline models are tested using various data from industrial examples. Furthermore, the simulation results show that the proposed method is well suited to solve the BDM inverse calculation problem in practice.

42 ENGINEERING↗

A Decomposition Approach for Solving Seasonal Transmission Switching

Economic transmission switching has been proposed as a new control paradigm to improve the economics of electric power systems. In practice, the transmission switching operation itself is a disruptive action to the system. Frequently switching lines into or out of service can create undesirable effects on the security and reliability of power systems and may require new investments in the automation and control systems. In this paper, we formulate an economic seasonal transmission switching model where transmission switching occurs once at the beginning of a time period (season) and then the transmission topology remains unchanged during that period. The proposed seasonal transmission switching model is a large-scale mixed integer programming problem. The objective of the optimization model is to minimize the total energy generation cost over the season subject to loads and N-1 reliability requirements. We develop a novel decomposition method that decomposes the seasonal problem into one-hour problems which are then solved efficiently. We demonstrate our model and the decomposition approach on the 14-bus, 39-bus, and 118-bus power systems and show potential cost savings in each case.

Decomposition↗

Capacity Adequacy and Revenue Sufficiency in Electricity Markets With Wind Power

We present a computationally efficient mixed-integer program (MIP) that determines optimal generator expansion decisions, as well as periodic unit commitment and dispatch. The model is applied to analyze the impact of increasing wind power capacity on the optimal generation mix and the profitability of thermal generators. In a case study, we find that increasing wind penetration reduces energy prices while the prices for operating reserves increase. Moreover, scarcity pricing for operating reserves through reserve shortfall penalties significantly impacts the prices and profitability of thermal generators. Without scarcity pricing, no thermal units are profitable, however scarcity pricing can ensure profitability for peaking units at high wind penetration levels. Capacity payments can also ensure profitability, but the payments required for baseload units to break even increase with the amount of wind power. The results indicate that baseload units are most likely to experience revenue sufficiency problems when wind penetration increases and new baseload units are only developed when natural gas prices are high and wind penetration is low.

capacity adequacy↗

Resilience-Oriented DG Siting and Sizing Considering Stochastic Scenario Reduction

In this paper, a fuel-based distributed generator (DG) allocation strategy is proposed to enhance the distribution system resilience against extreme weather. The long-term planning problem is formulated as a two-stage stochastic mixed-integer programming (SMIP). The first stage is to make decisions of DG siting and sizing under the given budget constraint. In the second stage, a post-extreme-event-restoration (PEER) is employed to minimize the operating cost in an uncertain fault scenario. In particular, this study proposes a method to select the most representative scenarios for the SMIP. First, a Monte Carlo Simulation (MCS) is introduced to generate sufficient scenarios considering random fault locations and load profiles. Then, the number of scenarios is reduced by the K-means clustering algorithm. The advantage of scenario reduction is to make a trade-off between accuracy and computational efficiency. Finally, the SMIP is solved by the progressive hedging algorithm. Here, the case studies of the IEEE 33-bus and 123-bus test systems demonstrate the effectiveness of the proposed algorithm in reducing the expected energy not served (EENS), which is a critical criterion of resilience.

42 ENGINEERING↗

Microgrids for Service Restoration to Critical Load in a Resilient Distribution System

icrogrids can act as emergency sources to serve critical loads when utility power is unavailable. This paper proposes a resiliency-based methodology that uses microgrids to restore critical loads on distribution feeders after a major disaster. Due to limited capacity of distributed generators (DGs) within microgrids, dynamic performance of the DGs during the restoration process becomes essential. In this paper, the stability of microgrids, limits on frequency deviation, and limits on transient voltage and current of DGs are incorporated as constraints of the critical load restoration problem. The limits on the amount of generation resources within microgrids are also considered. By introducing the concepts of restoration tree and load group, restoration of critical loads is transformed into a maximum coverage problem, which is a linear integer program (LIP). The restoration paths and actions are determined for critical loads by solving the LIP. A 4-feeder, 1069-bus unbalanced test system with four microgrids is utilized to demonstrate the effectiveness of the proposed method. The method is applied to the distribution system in Pullman, WA, resulting in a strategy that uses generators on the Washington State University campus to restore service to the Hospital and City Hall in Pullman.

Xu, Yin (ORCID:0000000209459024)↗

Learning Distribution Grid Topologies: A Tutorial

Unveiling feeder topologies from data is of paramount importance to advance situational awareness and proper utilization of smart resources in power distribution grids. This tutorial summarizes, contrasts, and establishes useful links between recent works on topology identification and detection schemes that have been proposed for power distribution grids. The primary focus is to highlight methods that overcome the limited availability of measurement devices in distribution grids, while enhancing topology estimates using conservation laws of power-flow physics and structural properties of feeders. Grid data from phasor measurement units or smart meters can be collected either passively in the traditional way, or actively, upon actuating grid resources and measuring the feeder's voltage response. Analytical claims on feeder identifiability and detectability are reviewed under disparate meter placement scenarios. Such topology learning claims can be attained exactly or approximately so via algorithmic solutions with various levels of computational complexity, ranging from least-squares fits to convex optimization problems, and from polynomial-time searches over graphs to mixed-integer programs. Although the emphasis is on radial single-phase feeders, extensions to meshed and/or multiphase circuits are sometimes possible and discussed. Here this tutorial aspires to provide researchers and engineers with knowledge of the current state-of-the-art in tractable distribution grid learning and insights into future directions of work.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Impacts of Integrating Topology Reconfiguration and Vehicle-to-Grid Technologies on Distribution System Operation

Autonomous electric vehicles (AEVs) provide unique opportunities to cope with the uncertainties of distributed energy generation in distribution networks. But the effects are limited by both inherent radial topology and the behaviors of decentralized AEVs. As such, we investigate the potential benefits of dynamic distribution network reconfiguration (DDNR), taking into account AEVs' spatial-temporal availability and their charging demand. We propose a mixed integer programming model to optimally coordinate the charging/discharging of AEVs with DDNR, while satisfying AEVs' original travel plan. Numerical studies based on a test system overlaying the IEEE 33-node test feeder and Sioux Falls transportation network show that DDNR and AEV complement each other, which improves the operation of the distribution system. We also conduct sensitivity analyses on inputs including renewable fluctuation and AEVs penetration level.

33 ADVANCED PROPULSION SYSTEMS↗

IPIP: A new approach to inverse planning for HDR brachytherapy by directly optimizing dosimetric indices

Purpose: Many planning methods for high dose rate (HDR) brachytherapy require an iterative approach. A set of computational parameters are hypothesized that will give a dose plan that meets dosimetric criteria. A dose plan is computed using these parameters, and if any dosimetric criteria are not met, the process is iterated until a suitable dose plan is found. In this way, the dose distribution is controlled by abstract parameters. The purpose of this study is to develop a new approach for HDR brachytherapy by directly optimizing the dose distribution based on dosimetric criteria. Methods: The authors developed inverse planning by integer program (IPIP), an optimization model for computing HDR brachytherapy dose plans and a fast heuristic for it. They used their heuristic to compute dose plans for 20 anonymized prostate cancer image data sets from patients previously treated at their clinic database. Dosimetry was evaluated and compared to dosimetric criteria. Results: Dose plans computed from IPIP satisfied all given dosimetric criteria for the target and healthy tissue after a single iteration. The average target coverage was 95%. The average computation time for IPIP was 30.1 s on an Intel(R) Core{sup TM}2 Duo CPU 1.67 GHz processor with 3 Gib RAM. Conclusions: IPIP is an HDR brachytherapy planning system that directly incorporates dosimetric criteria. The authors have demonstrated that IPIP has clinically acceptable performance for the prostate cases and dosimetric criteria used in this study, in both dosimetry and runtime. Further study is required to determine if IPIP performs well for a more general group of patients and dosimetric criteria, including other cancer sites such as GYN.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

NPIP: A skew line needle configuration optimization system for HDR brachytherapy

Purpose: In this study, the authors introduce skew line needle configurations for high dose rate (HDR) brachytherapy and needle planning by integer program (NPIP), a computational method for generating these configurations. NPIP generates needle configurations that are specific to the anatomy of the patient, avoid critical structures near the penile bulb and other healthy structures, and avoid needle collisions inside the body. Methods: NPIP consisted of three major components: a method for generating a set of candidate needles, a needle selection component that chose a candidate needle subset to be inserted, and a dose planner for verifying that the final needle configuration could meet dose objectives. NPIP was used to compute needle configurations for prostate cancer data sets from patients previously treated at our clinic. NPIP took two user-parameters: a number of candidate needles, and needle coverage radius, {delta}. The candidate needle set consisted of 5000 needles, and a range of {delta} values was used to compute different needle configurations for each patient. Dose plans were computed for each needle configuration. The number of needles generated and dosimetry were analyzed and compared to the physician implant. Results: NPIP computed at least one needle configuration for every patient that met dose objectives, avoided healthy structures and needle collisions, and used as many or fewer needles than standard practice. These needle configurations corresponded to a narrow range of {delta} values, which could be used as default values if this system is used in practice. The average end-to-end runtime for this implementation of NPIP was 286 s, but there was a wide variation from case to case. Conclusions: The authors have shown that NPIP can automatically generate skew line needle configurations with the aforementioned properties, and that given the correct input parameters, NPIP can generate needle configurations which meet dose objectives and use as many or fewer needles than the current HDR brachytherapy workflow. Combined with robot assisted brachytherapy, this system has the potential to reduce side effects associated with treatment. A physical trial should be done to test the implant feasibility of NPIP needle configurations.

60 APPLIED LIFE SCIENCES↗

Poster — Thur Eve — 69: Computational Study of DVH-guided Cancer Treatment Planning Optimization Methods

Purpose: To compare methods to incorporate the Dose Volume Histogram (DVH) curves into the treatment planning optimization. Method: The performance of three methods, namely, the conventional Mixed Integer Programming (MIP) model, a convex moment-based constrained optimization approach, and an unconstrained convex moment-based penalty approach, is compared using anonymized data of a prostate cancer patient. Three plans we generated using the corresponding optimization models. Four Organs at Risk (OARs) and one Tumor were involved in the treatment planning. The OARs and Tumor were discretized into total of 50,221 voxels. The number of beamlets was 943. We used commercially available optimization software Gurobi and Matlab to solve the models. Plan comparison was done by recording the model runtime followed by visual inspection of the resulting dose volume histograms. Conclusion: We demonstrate the effectiveness of the moment-based approaches to replicate the set of prescribed DVH curves. The unconstrained convex moment-based penalty approach is concluded to have the greatest potential to reduce the computational effort and holds a promise of substantial computational speed up.

60 APPLIED LIFE SCIENCES↗

WE-AB-207B-11: Optimizing Tumor Control Probability in Radiation Therapy Treatment - Application to HDR Cervical Cancer

Purpose: The ultimate goal of radiotherapy treatment planning is to find a treatment that will yield a high tumor-control-probability(TCP) with an acceptable normal-tissue-complication probability(NTCP). Yet most treatment planning today is not based upon optimization of TCPs and NTCPs, but rather upon meeting physical dose and volume constraints defined by the planner. We design treatment plans that optimize TCP directly and contrast them with the clinical dose-based plans. PET image is incorporated to evaluate gain in TCP for dose escalation. Methods: We build a nonlinear mixed integer programming optimization model that maximizes TCP directly while satisfying the dose requirements on the targeted organ and healthy tissues. The solution strategy first fits the TCP function with a piecewise-linear approximation, then solves the problem that maximizes the piecewise linear approximation of TCP, and finally performs a local neighborhood search to improve the TCP value. To gauge the feasibility, characteristics, and potential benefit of PET-image guided dose escalation, initial validation consists of fifteen cervical cancer HDR patient cases. These patients have all received prior 45Gy of external radiation dose. For both escalated strategies, we consider 35Gy PTV-dose, and two variations (37Gy-boost to BTV vs 40Gy-boost) to PET-image-pockets. Results: TCP for standard clinical plans range from 59.4% - 63.6%. TCP for dose-based PET-guided escalated-dose-plan ranges from 63.8%–98.6% for all patients; whereas TCP-optimized plans achieves over 91% for all patients. There is marginal difference in TCP among those with 37Gy-boosted vs 40Gy-boosted. There is no increase in rectum and bladder dose among all plans. Conclusion: Optimizing TCP directly results in highly conformed treatment plans. The TCP-optimized plan is individualized based on the biological PET-image of the patients. The TCP-optimization framework is generalizable and has been applied successfully to other external-beam delivery modalities. A clinical trial is on-going to gauge the clinical significance. Partially supported by the National Science Foundation.

60 APPLIED LIFE SCIENCES↗

Approximate Scheduling of DERs with Discrete Complex Injections

Rapid penetration of renewable energy based Distributed Energy Resources (DER) has the potential to exacerbate the challenges inherent in grid frequency and voltage regulation. However, their real time controllability can be leveraged to not only mitigate such challenges, but improve the economics and quality of grid operations. A plethora of DER scheduling algorithms have been developed for fast and efficient scheduling of these resources. These algorithms schedule the complex - real and reactive power injected into (or drawn from) the grid by the DERs under various cost objective functions and grid constraints. However, a vast majority of such algorithms assume the feasible range of power injections to be continuous. In reality, the control options available for several DERs form a discrete space. This implies that the feasible range of power injections also forms a discrete space. This makes DER scheduling an NP-hard problem. Integer/Mixed Integer program based algorithms, which guarantee optimality in the objective value, have been developed. But these are prohibitively expensive in terms of computational time requirements. On the other hand, fast heuristic based solutions have also been developed. But as they do not provide any guarantee on the optimality of the objective, or on satisfying the constraints, they are unreliable for grid operations. Recent works have developed approximation algorithms which offer the best of both the approaches above: (near) optimality and low computational complexity, both of which are governed by a user defined accuracy parameter ϵ. In this work, we significantly improve upon such existing works by developing an approximation algorithm which schedules DERs with complex injections (as opposed to only real injection) and whose runtime is polynomial (as opposed to exponential) in 1/ϵ. We provide theoretical analysis and support them with experimental results to validate the guarantees provided by our approximation algorithm.

14 SOLAR ENERGY↗