Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Program Optimization”

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 1,549 records · Page 86
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Usability and Optimization Improvements in MOOSE

The Multiphysics Object-Oriented Simulation Environment (MOOSE) framework is a foundational capability used by the Nuclear Energy Advanced Modeling and Simulation (NEAMS) program to create over 15 different simulation tools for advanced nuclear reactors. Due to MOOSE’s broad use, improvements to the framework in support of modeling and simulation goals are critical to the program. Such improvements can take many forms, including optimization, improved user experience, streamlined application programming interfaces (APIs), parallelism, and new capabilities. The work described in this report was conducted in direct support of the simulation tools and has already been deployed. The capabilities were implemented in the same order as they are covered in this report: multiple nonlinear systems in the same input file, implementation of generic field transfers and other transfer system enhancements, support for stateful material property redistribution for adaptivity and distributed meshes, and dynamic linking and loading of individually compiled applications. These four additions are fundamental capabilities that will be leveraged by many NEAMS applications.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1993

Simplified Computation Of Blade-Surface Coordinates

Coordinates of points on complicated three-dimensional surface of turbo-machine blade computed by method partly simplifying three-dimensional problem to two-dimensional problem. Method implemented in computer program enabling rapid hydrodynamical evaluation and optimization of blade surface prior to definition of final design of, and analysis of stresses in blade. By incorporating program into procedure for designing turbomachine, one reduces time spent on design iterations.

Chen, Wei-Chung↗
NASA NTRS1997

Development of a Low-Reynolds Number, Nonlinear kappa-epsilon Model for the Reduced Navier-Stokes Equations

Previous work at NASA LeRC has shown that flow distortions in aircraft engine inlet ducts can be significantly reduced by mounting vortex generators, or small wing sections, on the inside surface of the engine inlet. The placement of the vortex generators is an important factor in obtaining the optimal effect over a wide operating envelope. In this regard, the only alternative to a long and expensive test program which would search out this optimal configuration is a good prediction procedure which could narrow the field of search. Such a procedure has been developed in collaboration with NASA LeRC, and results obtained by NASA personnel indicate that it shows considerable promise for predicting the viscous turbulent flow in engine inlet ducts in the presence of vortex generators. The prediction tool is a computer code which numerically solves the reduced Navier-Stokes equations and so is commonly referred to as RNS3D. Obvious deficiencies in RNS3D have been addressed in previous work. Primarily, it is known that the predictions of the mean velocity field of a turbulent boundary layer flow approaching separation are not in good agreement with data. It was suggested that the use of an algebraic mixing-length turbulence model in RNS3D is at least partly to blame for this. Additionally, the current turbulence model includes an assumption of isotropy which will ultimately fail to capture turbulence-driven secondary flow known to exist in noncircular ducts.

Boger, David A.↗
NASA NTRS2013

SynGenics Optimization System (SynOptSys)

The SynGenics Optimization System (SynOptSys) software application optimizes a product with respect to multiple, competing criteria using statistical Design of Experiments, Response-Surface Methodology, and the Desirability Optimization Methodology. The user is not required to be skilled in the underlying math; thus, SynOptSys can help designers and product developers overcome the barriers that prevent them from using powerful techniques to develop better pro ducts in a less costly manner. SynOpt-Sys is applicable to the design of any product or process with multiple criteria to meet, and at least two factors that influence achievement of those criteria. The user begins with a selected solution principle or system concept and a set of criteria that needs to be satisfied. The criteria may be expressed in terms of documented desirements or defined responses that the future system needs to achieve. Documented desirements can be imported into SynOptSys or created and documented directly within SynOptSys. Subsequent steps include identifying factors, specifying model order for each response, designing the experiment, running the experiment and gathering the data, analyzing the results, and determining the specifications for the optimized system. The user may also enter textual information as the project progresses. Data is easily edited within SynOptSys, and the software design enables full traceability within any step in the process, and facilitates reporting as needed. SynOptSys is unique in the way responses are defined and the nuances of the goodness associated with changes in response values for each of the responses of interest. The Desirability Optimization Methodology provides the basis of this novel feature. Moreover, this is a complete, guided design and optimization process tool with embedded math that can remain invisible to the user. It is not a standalone statistical program; it is a design and optimization system.

Ventresca, Carol↗
DOE OSTI2024

Control and Optimization of Energy Storage System in Power Distribution System

The widespread adoption of electric vehicles (EVs) and transportation electrification is encumbered by two chief barriers: i) the limited driving range of EVs in the market today and ii) inadequate fast-charging infrastructure for long-distance trips. Extreme fast charging (XFC) technology can recharge EVs in less than 10 minutes for 200 miles range. Firstly, a novel robust optimization-based mixed integer linear programming model is proposed to size a battery energy storage system (BESS) and PV system in an XFCS. In this part, it is assumed that the sizing and location of the XFCS are known. Secondly, the aforesaid assumption is relaxed, and a strategic multi-period coordinated planning model is proposed to optimally site and size BESS-assisted charging stations in a highway transportation network and PV systems in a power distribution network by considering the coupling between both networks. Optimal operation and control of BESS-assisted EV charging stations are vital to alleviate the adverse impact of extreme fast charging of EVs on the host power network. A joint solution is proposed to mitigate the steady state and transient impact of extremefast charging of EVs and ensure grid-friendly integration of XFCSs with the host grid. Lastly, to make the operation of the XFCS cost-effective, a multi-layered energy management framework is proposed for the XFCS by considering forecast uncertainties, monthly demand charges reduction, and BESS degradation.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Program Generators for Exascale and Beyond (Final Technical Report)

The major goals of this project were to devise programming models and supporting tools that simplify the construction of specialized high‐performance generators, leading to improvements over the state of the art along the various dimensions of portability, performance, and productivity. In particular, the project achieved these goals by focusing on domain‐specific languages (DSLs) as intermediate layers in a translation and optimization framework, on composability of program generators, on re‐targeting legacy code, and on fundamental methodologies such as stage polymorphism or "generic programming in time".

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Optimization of groundwater artificial recharge systems using a genetic algorithm: a case study in Beijing, China

An optimization approach is used for the operation of groundwater artificial recharge systems in an alluvial fan in Beijing, China. The optimization model incorporates a transient groundwater flow model, which allows for simulation of the groundwater response to artificial recharge. The facilities’ operation with regard to recharge rates is formulated as a nonlinear programming problem to maximize the volume of surface water recharged into the aquifers under specific constraints. This optimization problem is solved by the parallel genetic algorithm (PGA) based on OpenMP, which could substantially reduce the computation time. To solve the PGA with constraints, the multiplicative penalty method is applied. In addition, the facilities’ locations are implicitly determined on the basis of the results of the recharge-rate optimizations. Two scenarios are optimized and the optimal results indicate that the amount of water recharged into the aquifers will increase without exceeding the upper limits of the groundwater levels. Optimal operation of this artificial recharge system can also contribute to the more effective recovery of the groundwater storage capacity.

58 GEOSCIENCES↗
NASA NTRS1984

Optimal maintenance center inventories for fault-tolerant repairable systems

A probabilistic approach is taken to determine the optimal repairable parts inventory for a maintenance center, servicing machines which contain several m-out-of-n systems of different parts, with a constraint on the total inventory investment. A model, based on the discrete Markov process, accounts for a typical ultrareliable avionics system, such as one presently being developed by NASA. The dynamic programming algorithm for minimizing the stockout and holding costs is applied to an exemplary maintenance center, and solutions for single-item and multi-item cases are given. The computational burden is noted to be reasonable and a computer program is used to generate optimal solutions.

Lawrence, S. H.↗
DOE OSTI2015

A two-phase investment model for optimal allocation of phasor measurement units considering transmission switching

Ensuring the reliability of an electrical power system requires a wide-area monitoring and full observability of the state variables. Phasor measurement units (PMUs) collect in real time synchronized phasors of voltages and currents which are used for the observability of the power grid. Due to the considerable cost of installing PMUs, it is not possible to equip all buses with PMUs. In this paper, we propose an integer linear programming model to determine the optimal PMU placement plan in two investment phases. In the first phase, PMUs are installed to achieve full observability of the power grid whereas additional PMUs are installed in the second phase to guarantee the N - 1 observability of the power grid. The proposed model also accounts for transmission switching and single contingencies such as failure of a PMU or a transmission line. Results are provided on several IEEE test systems which show that our proposed approach is a promising enhancement to the methods available for the optimal placement of PMUs.

Phasor measurement unit↗
DOE OSTI2015

Problem of two-level hierarchical minimax program control the final state of regional social and economic system in the presence of risks

This article discusses a discrete-time dynamical system consisting of a set a controllable objects (region and forming it municipalities). The dynamics each of these is described by the corresponding vector nonlinear discrete-time recurrent vector equations and its control system consist from two levels: basic (control level I) that is dominating and subordinate level (control level II). Both levels have different criterions of functioning and united a priori by determined informational and control connections defined in advance. In this paper we study the problem of optimization of guaranteed result for program control by the final state of regional social and economic system in the presence of risks. For this problem we proposed in this work an economical and mathematical model of two-level hierarchical minimax program control the final state of regional social and economic system in the presence of risks and the general scheme for its solving.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS2008

Life Support Systems for Lunar Landers

Engineers designing life support systems for NASA s next Lunar Landers face unique challenges. As with any vehicle that enables human spaceflight, the needs of the crew drive most of the lander requirements. The lander is also a key element of the architecture NASA will implement in the Constellation program. Many requirements, constraints, or optimization goals will be driven by interfaces with other projects, like the Crew Exploration Vehicle, the Lunar Surface Systems, and the Extravehicular Activity project. Other challenges in the life support system will be driven by the unique location of the vehicle in the environments encountered throughout the mission. This paper examines several topics that may be major design drivers for the lunar lander life support system. There are several functional requirements for the lander that may be different from previous vehicles or programs and recent experience. Some of the requirements or design drivers will change depending on the overall Lander configuration. While the configuration for a lander design is not fixed, designers can examine how these issues would impact their design and be prepared for the quick design iterations required to optimize a spacecraft.

Anderson, Molly↗
NASA NTRS1989

Structural damage assessment as an identification problem

Damage assessment of structural assemblies is treated as an identification problem. A brief review of identification methods is first presented with particular focus on the output error approach. The use of numerical optimization methods in identifying the location and extent of damage in structures is studied. The influence of damage on eigenmode shapes and static displacements is explored as a means of formulating a measure of damage in the structure. Preliminary results obtained in this study are presented and special attention is directed at the shortcomings associated with the nonlinear programming approach to solving the optimization problem.

Hajela, Prabhat↗
DOE OSTI2023

A Surrogate-Based Asynchronous Decomposition Technique for Realistic Security-Constrained Optimal Power Flow Problems

Here we present a decomposition approach for obtaining good feasible solutions for the security-constrained, alternating-current, optimal power flow (SC-AC-OPF) problem at an industrial scale and under real-world time and computational limits. The approach was designed while preparing and participating in ARPA-E’s Grid Optimization Competition (GOC) Challenge 1. The challenge focused on a near-real-time version of the SC-AC-OPF problem, where a base operating point is optimized, taking into account possible single-element contingencies, after which the system adapts its operating point following the response of automatic frequency droop controllers and voltage regulators. Our solution approach for this problem relies on state-of-the-art nonlinear programming algorithms, and it employs nonconvex relaxations for complementarity constraints, a specialized two-stage decomposition technique with sparse approximations of recourse terms and contingency ranking and prescreening. The paper describes and justifies our approach and outlines the features of its implementation, including functions and derivatives evaluation, warm-starting strategies, and asynchronous parallelism. We discuss the results of the independent benchmark of our approach by ARPA-E’s GOC team in Challenge 1, where it was found to consistently produce high-quality solutions across a wide range of network sizes and difficulty, and conclude by outlining future extensions of the approach.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

ASC Trilab L2 Codesign Milestone 2015

For the FY15 ASC L2 Trilab Codesign milestone Sandia National Laboratories performed two main studies. The first study investigated three topics (performance, cross-platform portability and programmer productivity) when using OpenMP directives and the RAJA and Kokkos programming models available from LLNL and SNL respectively. The focus of this first study was the LULESH mini-application developed and maintained by LLNL. In the coming sections of the report the reader will find performance comparisons (and a demonstration of portability) for a variety of mini-application implementations produced during this study with varying levels of optimization. Of note is that the implementations utilized including optimizations across a number of programming models to help ensure claims that Kokkos can provide native-class application performance are valid. The second study performed during FY15 is a performance assessment of the MiniAero mini-application developed by Sandia. This mini-application was developed by the SIERRA Thermal-Fluid team at Sandia for the purposes of learning the Kokkos programming model and so is available in only a single implementation. For this report we studied its performance and scaling on a number of machines with the intent of providing insight into potential performance issues that may be experienced when similar algorithms are deployed on the forthcoming Trinity ASC ATS platform.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Economic dispatch for electricity merchant with energy storage and wind plant: State of charge based decision making considering market impact and uncertainties

Here this paper investigates how the market impact of electricity merchants and uncertainty of wind generation affect their co-optimized scheduling policy, specifically for merchants who have both energy storage and wind plants. In the existing literature, merchants' trading actions are usually assumed not to affect market prices; however, a large-scale energy storage merchant's actions can affect market prices. To this end, we approximate the electricity price by a linear function of the quantity of power traded by the merchant in the reward function to achieve decision-making incorporating the market impact. This paper utilizes the dynamic programming approach to analyze merchants' optimal multi-period decision-making incorporating market impact, uncertain wind generation, and energy storage constraints. First, our results demonstrate that for a merchant with co-located energy storage facilities and wind power plants, the energy storage's feasible state of charge (SOC) range can be segmented into four possible sub-ranges by three analytically developed SOC reference points. The unique optimal trading decision can be achieved by comparing the current energy inventory and the SOC references of the next period. Second, our results show that market impact and uncertainties substantially change the optimal storage scheduling policy by impacting the values of the reference points. To mitigate the negative effect of the merchant's market impact on buying and selling actions, the merchant may reduce the amount of generating or pumping electricity each period to maximize profit. Moreover, we identify and investigate the trade-off between market price and transaction quantity. Our findings provide co-optimized scheduling guidance for electricity merchants with co-located energy storage and renewable power plants systems.

17 WIND ENERGY↗
DOE OSTI2023

Holistic fleet optimization incorporating system design considerations

The methodology described in this article enables a type of holistic fleet optimization that simultaneously considers the composition and activity of a fleet through time as well as the design of individual systems within the fleet. Often, real-world system design optimization and fleet-level acquisition optimization are treated separately due to the prohibitive scale and complexity of each problem. Importantly, this means that fleet-level schedules are typically limited to the inclusion of predefined system configurations and are blind to a rich spectrum of system design alternatives. Similarly, system design optimization often considers a system in isolation from the fleet and is blind to numerous, complex portfolio-level considerations. In reality, these two problems are highly interconnected. To properly address this system-fleet design interdependence, we present a general method for efficiently incorporating multi-objective system design trade-off information into a mixed-integer linear programming (MILP) fleet-level optimization. This work is motivated by the authors' experience with large-scale DOD acquisition portfolios. However, the methodology is general to any application where the fleet-level problem is a MILP and there exists at least one system having a design trade space in which two or more design objectives are parameters in the fleet-level MILP.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

All-Digital Plug and Play Passive RFID Sensors for Energy Efficient Building Control

This is the final report for the project “All-Digital Plug and Play Passive RFID Sensors for Energy Efficient Building Control”, funded by DOE, and performed by Clemson University, Phase IV Engineering and Harvard University from October 1, 2016 to December 31, 2020. The main objective of this project is to develop, demonstrate and pre-commercialize a novel, plug & play, battery-free, wireless sensor technology to enable low-cost (<$10 per node) indoor and outdoor temperature and humidity measurement for energy efficient building controls and operations. The proposed technology is based on the novel concept of all-digital sensing and its seamless integration with the passive RFID technology. This project focuses on the design, fabrication, material optimization, interrogation electronics, validation, and demonstration of the novel sensor nodes for building applications. The specific objectives of this research program include: (1) Design, fabricate and optimize a compact, robust, and high-resolution digitizer, which could convert rotation angle into digital numbers. (2) Develop the multi-physics-based modeling and simulation of the temperature/humidity transducer to derive a rational design of the architecture, dimension, structure, materials (i.e., mechanical, electrical, thermal and hygroscopic) properties and functions of the sensor node. (3) Design, fabricate and optimize the bi-material based humidity sensitive coil which could linearly transduce the environmental relative humidity variations to rotation angles. (4) Design, fabricate and optimize an UHF RFID platform which could support long-range passive wireless communications of 8-bit digital numbers. (5) Design, fabricate and optimize the miniaturized all-digital sensor using MEMS technology. (6) Validate the integrated all-digital sensing system in a real building environment to test the system’s performance.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2020

Optimization-Driven Scenario Grouping

Scenario decomposition algorithms for stochastic programs compute bounds by dualizing all nonanticipativity constraints and solving individual scenario problems independently. Here, we develop an approach that improves on these bounds by reinforcing a carefully chosen subset of nonanticipativity constraints, effectively placing scenarios into groups. Specifically, we formulate an optimization problem for grouping scenarios that aims to improve the bound by optimizing a proxy metric based on information obtained from evaluating a subset of candidate feasible solutions. We show that the proposed grouping problem is NP-hard in general, identify a polynomially solvable case, and present two formulations for solving the problem: a matching formulation for a special case and a mixed-integer programming formulation for the general case. We use the proposed grouping scheme as a preprocessing step for a particular scenario decomposition algorithm and demonstrate its effectiveness in solving standard test instances of two-stage 0–1 stochastic programs. Using this approach, we are able to prove optimality for all previously unsolved instances of a standard test set. Additionally, we implement this scheme as a preprocessing step for PySP, a publicly available and widely used implementation of progressive hedging, and compare this grouping approach with standard grouping approaches on large-scale stochastic unit commitment instances. Finally, the idea is extended to propose a finitely convergent algorithm for two-stage stochastic programs with a finite feasible region.

97 MATHEMATICS AND COMPUTING↗