Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “program optimizations”

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 73 records · Page 4

Optimizing design and dispatch of a renewable energy system

Renewable energy technologies are becoming increasingly important due to their cost-competitiveness, and because of enhanced climate concerns. We demonstrate the capabilities of an integer-programming optimization model that minimizes capital (investment) and operational costs, and utility charges, while adhering to system sizing constraints, demand requirements, and interoperability characteristics of the systems chosen. Furthermore, the model recommends an optimally sized mix of renewable energy, conventional generation, and energy storage technologies, while simultaneously optimizing the corresponding dispatch strategy. Our case studies explore several venues, i.e., a small campus and a local hospital, with complex utility rate tariffs, multi-technology integration opportunities, and incentives for renewable power production. Using an optimization model, versus applying rules of thumb, can produce millions of dollars in savings over a 25-year time horizon and result in thousands of kilowatts of installed renewable energy.

25 ENERGY STORAGE↗

Start-up Optimization Considering Integrated Power Electronic Systems

The startup of systems composed of power electronic systems is becoming more complex. As the systems grow, standard pre-configuration sequencing methods will struggle. This work proposes a linear programming optimization method to couple power electronic systems in a series of startup commands. This formulation is demonstrated in a real-time implementation on hardware.

Starke, Michael↗

A Multi-Parametric optimization approach for bilevel mixed-integer linear and quadratic programming problems

Optimization problems involving two decision makers at two different decision levels are referred to as bi-level programming problems. Herein, we present novel algorithms for the exact and global solution of two classes of bi-level programming problems, namely (i) bi-level mixed-integer linear programming problems (B-MILP) and (ii) bi-level mixed-integer convex quadratic programming problems (B-MIQP) containing both integer and bounded continuous variables at both optimization levels. Based on multi-parametric programming theory, the main idea is to recast the lower level problem as a multi-parametric programming problem, in which the optimization variables of the upper level problem are considered as bounded parameters for the lower level. The resulting exact multi-parametric mixed-integer linear or quadratic solutions are then substituted into the upper level problem, which can be solved as a set of single-level, independent, deterministic mixed-integer optimization problems. Extensions to problems including right-hand-side uncertainty on both lower and upper levels are also discussed. Finally, computational implementation and studies are presented through test problems.

42 ENGINEERING↗

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↗

DistOPF: Advanced Solutions for Distribution Optimal Power Flow Analysis - DistOPF v0.2 Documentation

To achieve an affordable and reliable energy system, research on power distribution system is often focused on integration of distributed generators, energy storage solution, EV charging, smart meters, and other advanced assets that may benefit from or require more advanced control and optimization techniques. Despite this focus on advanced distribution system topics, early researchers and grid scientists often start from scratch when developing optimization programs for power distribution systems. This report introduces DistOPF, a Python package that consolidates years of research into a versatile and modular tool. DistOPF provides researchers with essential capabilities to solve distribution system Optimal Power Flow (OPF) problems using standard network models. Additionally, it offers a platform to benchmark both new and existing algorithms against established test systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs

We develop an adaptive, multivariate partitioning algorithm for solving nonconvex, Mixed-Integer Nonlinear Programs (MINLPs) with polynomial functions to global optimality. In particular, we present an iterative algorithm that exploits piecewise, convex relaxation approaches via disjunctive formulations to solve MINLPs that is different than conventional spatial branch-and-bound approaches. The algorithm partitions the domains of variables in an adaptive and non-uniform manner at every iteration to focus on productive areas of the search space. Furthermore, domain reduction techniques based on sequential, optimization-based bound-tightening and piecewise relaxation techniques, as a part of a presolve step, are integrated into the main algorithm. Finally, we demonstrate the effectiveness of the algorithm on well-known benchmark problems (including Pooling and Blending instances) from MINLPLib and compare our algorithm with state-of-the-art global optimization solvers. With our novel approach, we solve several large-scale instances, some of which are not solvable by state-of-the-art solvers. We also succeed in reducing the best known optimality gap for a hard, generalized pooling problem instance.

97 MATHEMATICS AND COMPUTING↗

Dynamic Optimal Dispatch of Energy Systems with Intermittent Renewables and Damage Model

With the increasing penetration of intermittent renewable energy sources into the grid, there is a growing need for process systems-based strategies that integrate dispatchable and variable energy systems for supplying the demand while maintaining grid reliability. The proposed framework corresponds to a dynamic mixed-integer linear programming optimization approach that integrates coal-fired and natural gas-fired power plants, NaS batteries for energy storage, and solar/wind energy to supply the demand. This optimization approach considers an economic goal and constraints to provide power balance while maintaining the overall damage of the natural gas combined cycle (NGCC) power plant drum under a maximum stress as well as avoiding the overheating of the NGCC superheater and reheater. Renewable curtailment levels are also retained at minimum levels. Case studies are analyzed considering different loads and renewable penetration levels. The results show that the demand was met for all cases. Grid flexibility was mostly provided by the NGCC, while the batteries were used sparingly. In addition, considering a CO 2 equivalent analysis, the environmental performance was intrinsically connected to grid flexibility and the level of renewable penetration. Stress analysis results reinforced the necessity for an equipment health-related constraint.

97 MATHEMATICS AND COMPUTING↗

Glass Design Using Machine Learning Property Models with Prediction Uncertainties: Nuclear Waste Glass Formulation

The United States Department of Energy is responsible for managing the legacy nuclear waste stored in underground tanks at the Hanford Site. The waste will be separately vitrified as low-activity waste and high-level waste fractions. Waste glass formulation algorithms have been traditionally developed using partial quadratic mixture property-composition models. Recently, machine learning (ML) techniques have been used to predict glass properties and discover new glass materials for nuclear waste vitrification, and these advancements can be utilized to improve waste glass composition design. In this proof-of-principle study, ML algorithms such as Gaussian process regression (GPR) were used to interpolate glass properties (e.g., viscosity, electrical conductivity, chemical durability). After selecting appropriate sets of GPR hyper-parameters for each property, an optimization program was developed to formulate glass compositions to maximize waste loading while simultaneously satisfying property within constraints. The results of the ML-based waste loadings and glass compositions were compared to those obtained using the traditional methods. Comparing to the previous glass design framework, the ML-based optimization methods offer improved glass designs and a streamlined approach to generation of optimally designed data and near real-time updates.

glass formulation, machine learning, constraints, ↗

Analytical Model-Based Design Optimization of a Transverse Flux Machine

This paper proposes an analytical machine design tool using magnetic equivalent circuit (MEC)-based particle swarm optimization (PSO) for a double-sided, flux-concentrating transverse flux machine (TFM). The magnetic equivalent circuit method is applied to analytically establish the relationship between the design objective and the input variables of prospective TFM designs. This is computationally less intensive and more time efficient than finite element solvers. A PSO algorithm is then used to design a machine with the highest torque density within the specified power range along with some geometric design constraints. The stator pole length, magnet length, and rotor thickness are the variables that define the optimization search space. Finite element analysis (FEA) was carried out to verify the performance of the MEC-PSO optimized machine. The proposed analytical design tool helps save computation time by at least 50% when compared to commercial FEA-based optimization programs, with results found to be in agreement with less than 5% error.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Value of Probabilistic Weather Forecasts: Assessment by Real-Time Optimization of Irrigation Scheduling

This paper presents a modeling framework for real-time decision support for irrigation scheduling using the National Oceanic and Atmospheric Administration's (NOAA's) probabilistic rainfall forecasts. The forecasts and their probability distributions are incorporated into a simulation-optimization modeling framework. In this study, modeling irrigation is determined by a stochastic optimization program based on the simulated soil moisture and crop water-stress status and the forecasted rainfall for the next 1-7 days. The modeling framework is applied to irrigated corn in Mason County, Illinois. It is found that there is ample potential to improve current farmers practices by simply using the proposed simulation-optimization framework, which uses the present soil moisture and crop evapotranspiration information even without any forecasts. It is found that the values of the forecasts vary across dry, normal, and wet years. More significant economic gains are found in normal and wet years than in dry years under the various forecast horizons. To mitigate drought effect on crop yield through irrigation, medium- or long-term climate predictions likely play a more important role than short-term forecasts. NOAA's imperfect 1-week forecast is still valuable in terms of both profit gain and water saving. Compared with the no-rain forecast case, the short-term imperfect forecasts could lead to additional 2.4-8.5% gain in profit and 11.0-26.9% water saving. However, the performance of the imperfect forecast is only slightly better than the ensemble weather forecast based on historical data and slightly inferior to the perfect forecast. It seems that the 1-week forecast horizon is too limited to evaluate the role of the various forecast scenarios for irrigation scheduling, which is actually a seasonal decision issue. For irrigation scheduling, both the forecast quality and the length of forecast time horizon matter. Thus, longer forecasts might be necessary to evaluate the role of forecasts for irrigation scheduling in a more effective way.

54 ENVIRONMENTAL SCIENCES↗

Helium: lifting high-performance stencil kernels from stripped x86 binaries to halide DSL code

Highly optimized programs are prone to bit rot, where performance quickly becomes suboptimal in the face of new hardware and compiler techniques. In this paper we show how to automatically lift performance-critical stencil kernels from a stripped x86 binary and generate the corresponding code in the high-level domain-specific language Halide. Using Halide's state-of-the-art optimizations targeting current hardware, we show that new optimized versions of these kernels can replace the originals to rejuvenate the application for newer hardware. The original optimized code for kernels in stripped binaries is nearly impossible to analyze statically. Instead, we rely on dynamic traces to regenerate the kernels. We perform buffer structure reconstruction to identify input, intermediate and output buffer shapes. Here, we abstract from a forest of concrete dependency trees which contain absolute memory addresses to symbolic trees suitable for high-level code generation. This is done by canonicalizing trees, clustering them based on structure, inferring higher-dimensional buffer accesses and finally by solving a set of linear equations based on buffer accesses to lift them up to simple, high-level expressions. Helium can handle highly optimized, complex stencil kernels with input-dependent conditionals. We lift seven kernels from Adobe Photoshop giving a 75 % performance improvement, four kernels from Irfan View, leading to 4.97 x performance, and one stencil from the mini GMG multigrid benchmark netting a 4.25 x improvement in performance. We manually rejuvenated Photoshop by replacing eleven of Photoshop's filters with our lifted implementations, giving 1.12 x speedup without affecting the user experience.

97 MATHEMATICS AND COMPUTING↗

Two-dimensional inverse planning and delivery with a preclinical image guided microirradiator

Purpose: Recent advances in preclinical radiotherapy systems have provided the foundation for scaling many of the elements of clinical radiation therapy practice to the dimensions and energy demanded in small animal studies. Such systems support the technical capabilities to accurately deliver highly complex dose distributions, but methods to optimize and deliver such distributions remain in their infancy. This study developed an optimization method based on empirically measured two-dimensional dose kernel measurements to deliver arbitrary planar dose distributions on a recently developed small animal radiotherapy platform.Methods: A two-dimensional dose kernel was measured with repeated radiochromic film measurements for the circular 1 mm diameter fixed collimator of the small animal radiotherapy system at 1 cm depth in a solid water phantom. This kernel was utilized in a sequential quadratic programming optimization framework to determine optimal beam positions and weights to deliver an arbitrary desired dose distribution. The positions and weights were then translated to a set of stage motions to automatically deliver the optimized dose distribution. End-to-end efficacy of the framework was quantified through five repeated deliveries of two dosimetric challenges: (1) a 5 mm radius bullseye distribution, and (2) a “sock” distribution contained within a 9 × 13 mm bounding box incorporating rectangular, semicircular, and exponentially decaying geometric constructs and a rectangular linear dose gradient region. These two challenges were designed to gauge targeting, geometric, and dosimetric fidelity.Results: Optimization of the bullseye and sock distributions required 2.1 and 5.9 min and utilized 50 and 77 individual beams for delivery, respectively. Automated delivery of the resulting optimized distributions, validated using radiochromic film measurements, revealed an average targeting accuracy of 0.32 mm, and a dosimetric delivery error along four line profiles taken through the sock distribution of 3.9%. Mean absolute delivery error across the 0–1 Gy linear dose gradient over 7.5 mm was 0.01 Gy.Conclusions: The work presented here demonstrates the potential for complex dose distributions to be planned and automatically delivered with millimeter scale heterogeneity at submillimeter accuracy. This capability establishes the technical foundation for preclinical validation of biologically guided radiotherapy investigations and development of unique radiobiological experiments.

61 RADIATION PROTECTION AND DOSIMETRY↗

Feasibility Study for Electrical Discharge Machining of Large DU-Mo Castings

U-10 wt. % Mo (U-10Mo) alloys are being developed as low enrichment monolithic fuel for the CONVERT program. Optimization of processing for the monolithic fuel is being pursued with the use of electrical discharge machining (EDM) under CONVERT HPRR WBS 1.2.4.5 Optimization of Coupon Preparation. The process is applicable to manufacturing experimental fuel plate specimens for the Mini-Plate-1 (MP-1) irradiation campaign. The benefits of EDM are reduced machining costs, ability to achieve higher tolerances, stress-free, burr-free surfaces eliminating the need for milling, and the ability to machine complex shapes. Kerf losses are much smaller with EDM (tenths of mm) compared to conventional machining (mm). Reliable repeatability is achievable with EDM due to its computer-generated machining programs.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

INDDGO: Integrated Network Decomposition & Dynamic programming for Graph Optimization

It is well-known that dynamic programming algorithms can utilize tree decompositions to provide a way to solve some NP -hard problems on graphs where the complexity is polynomial in the number of nodes and edges in the graph, but exponential in the width of the underlying tree decomposition. However, there has been relatively little computational work done to determine the practical utility of such dynamic programming algorithms. We have developed software to construct tree decompositions using various heuristics and have created a fast, memory-efficient dynamic programming implementation for solving maximum weighted independent set. We describe our software and the algorithms we have implemented, focusing on memory saving techniques for the dynamic programming. We compare the running time and memory usage of our implementation with other techniques for solving maximum weighted independent set, including a commercial integer programming solver and a semi-definite programming solver. Our results indicate that it is possible to solve some instances where the underlying decomposition has width much larger than suggested by the literature. For certain types of problems, our dynamic programming code runs several times faster than these other methods.

Groër, Christopher S.↗

FINAL SCIENTIFIC/TECHNICAL REPORT: Dry Solids Pump - Coal Feed Technologies

Gas Technology Institute (GTI) has concluded the Dry Solids Pump Coal - Feed Technologies (DSP-CFT) program that was initiated on October 1, 2013. The project’s primary objectives have been to gather data to increase the fidelity of the economic benefits of the Dry Solids Pump (DSP) technology for Integrated Gasification Combined Cycle (IGCC) plants, mature the technology to a Technology Readiness Level (TRL) of TRL 6 by continued testing and upgrades to the existing DSP, advance pump configuration knowledge to the point that a commercial pump can be confidently designed for low rank coal feed stocks and develop the next generation design configuration of a 1000 ton per day (tpd) DSP. After initial efforts with the existing DSP, a subscale pump was built to reduce the cost and time required to develop upgrades. The subscale development program evaluated three exit configurations and a host of geometric variations in each configuration concluding a side exit upward discharge configuration offered the greatest improvements. Both configuration and operation focused improvements were implemented on the full scale existing DSP and demonstrated 500 psi operation. An initial Techno-economic Analysis (TEA) and later update that was undertaken by Mr. Chris Higman and associates. The TEA quantifies the dramatic savings in capital and operational expenses achieved by reducing plant height and nitrogen consumption/compression, respectively in a commercial gasifier application. Drawings of the suggested design configuration for a commercial DSP feeder reflect the side exit design and incorporate lighter weight and lower cost fabrication methods. Features used for development testing are removed. A follow-on optimization program to allow the DSP technology to achieve TRL 7 is outlined.

01 COAL, LIGNITE, AND PEAT↗

Future Synchrotron Light Sources Based on Ultimate Storage Rings

The main purpose of this talk is to describe how far one might push the state of the art in storage ring design. The talk will start with an overview of the latest developments and advances in the design of synchrotron light sources based on the concept of an 'ultimate' storage ring. The review will establish how bright a ring based light source might be, where the frontier of technological challenges are, and what the limits of accelerator physics are. Emphasis will be given to possible improvements in accelerator design and developments in technology toward the goal of achieving an ultimate storage ring. An ultimate storage ring (USR), defined as an electron ring-based light source having an emittance in both transverse planes at the diffraction limit for the range of X-ray wavelengths of interest for a scientific community, would provide very high brightness photons having high transverse coherence that would extend the capabilities of X-ray imaging and probe techniques beyond today's performance. It would be a cost-effective, high-coherence 4th generation light source, competitive with one based on energy recovery linac (ERL) technology, serving a large number of users studying material, chemical, and biological sciences. Furthermore, because of the experience accumulated over many decades of ring operation, it would have the great advantage of stability and reliability. In this paper we consider the design of an USR having 10-pm-rad emittance. It is a tremendous challenge to design a storage ring having such an extremely low emittance, a factor of 100 smaller than those in existing light sources, especially such that it has adequate dynamic aperture and beam lifetime. In many ultra-low emittance designs, the injection acceptances are not large enough for accumulation of the electron beam, necessitating on-axis injection where stored electron bunches are completely replaced with newly injected ones. Recently, starting with the MAX-IV 7-bend achromatic cell, we have made significant progress with the design of PEP-X, a USR that would inhabit the decommissioned PEP-II tunnel at SLAC. The enlargement of the dynamic aperture is largely a result of the cancellations of the 4th-order resonances in the 3rd-order achromats and the effective use of lattice optimization programs. In this paper, we will show those cancellations of the 4th-order resonances using an analytical approach based on the exponential Lie operators and the Poisson brackets. Wherever possible, our analytical results will be compared with their numerical counterparts. Using the derived formulae, we will construct 4th-order geometric achromats and use them as modules for the lattice of the PEP-X USR, noting that only geometric terms are canceled to the 4th order.

43 PARTICLE ACCELERATORS↗

Are coupled renewable-battery power plants more valuable than independently sited installations?

Coupled renewable-battery powerplants differ from the traditional concept of independent siting of electricity resources within transmission networks. Prior research on the value proposition and cost savings from coupling did not consider the geographic constraint of co-location. This paper fills the gap by assessing how pricing volatility differences between nodes within electricity markets impact the system value of coupled renewable-battery projects as compared to independent VRE and battery installations. We use wholesale power market prices from 2012–2019 across the seven main U.S. independent system operators (ISOs) with a linear optimization program to compare the electricity market value of coupled projects to the value of the same underlying sub-components, deployed separately. We find that additional value from adding a 4-hour battery sized to 50% of renewable-plant nameplate capacity is $\$$10/MWh across ISOs on average. The highest boost occurs in California ($\$$15/MWh), where the value of adding storage to solar rises over time in tandem with increased solar penetration in the region. If renewables and batteries are deployed independently, we estimate that $\$$12.5/MWh of additional value could be achieved because of more flexibility on battery siting and operation. The $\$$12.5/MWh coupling penalty is reduced to $\$$1.6/MWh when considering alternative approaches to integrating battery storage. This result implies that renewable-battery power plants will play an increasing role in electricity systems if they can be built for $\$$2–$\$$13/MWh less than independent projects of comparable size. However, the wide regional variation in coupling penalties, along with the importance of conditions captured in our sensitivity cases, suggests the tradeoff between coupling penalties and savings will vary by situation. Therefore, roles exist for independent and coupled projects from a system optimization perspective.

14 SOLAR ENERGY↗

Keep it short: Exploring the impacts of configuration choices on the recent economics of solar-plus-battery and wind-plus-battery hybrid energy plants

Coupled renewable-battery powerplants differ from the traditional concept of independent siting of electricity resources within transmission networks. Prior research on the value proposition and cost savings from coupling did not consider the geographic constraint of co-location. This paper fills the gap by assessing how pricing volatility differences between nodes within electricity markets impact the system value of coupled renewable-battery projects as compared to independent VRE and battery installations. We use wholesale power market prices from 2012–2019 across the seven main U.S. independent system operators (ISOs) with a linear optimization program to compare the electricity market value of coupled projects to the value of the same underlying sub-components, deployed separately. We find that additional value from adding a 4-hour battery sized to 50% of renewable-plant nameplate capacity is $\$10$/MWh across ISOs on average. The highest boost occurs in California ($\$15$/MWh), where the value of adding storage to solar rises over time in tandem with increased solar penetration in the region. If renewables and batteries are deployed independently, we estimate that $\$12.5$/MWh of additional value could be achieved because of more flexibility on battery siting and operation. The $\$12.5$/MWh coupling penalty is reduced to $\$1.6$/MWh when considering alternative approaches to integrating battery storage. This result implies that renewable-battery power plants will play an increasing role in electricity systems if they can be built for $\$2$–$\$13$/MWh less than independent projects of comparable size. However, the wide regional variation in coupling penalties, along with the importance of conditions captured in our sensitivity cases, suggests the tradeoff between coupling penalties and savings will vary by situation. Therefore, roles exist for independent and coupled projects from a system optimization perspective.

14 SOLAR ENERGY↗