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 271 records · Page 15

The design of asymmetric 4 pi shields for space reactors

A one dimensional shield optimization program based on the method of discrete ordinates has been developed and is used to determine material thicknesses used in asymmetric 4 pion shields for space power reactors. The two dimensional discrete ordinates program DOT is used to check the design, and the information generated in the DOT calculation is used as a guide in shaping the shield which may be considered a first step in two dimensional shield optimization.

Engle, W. W., Jr.↗

POSTOP: Postbuckled open-stiffener optimum panels-theory and capability

The computer program POSTOP was developed to serve as an aid in the analysis and sizing of stiffened composite panels that are loaded in the postbuckling regime. A comprehensive set of analysis routines was coupled to a widely used optimization program to produce this sizing code. POSTOP is intended for the preliminary design of metal or composite panels with open-section stiffeners, subjected to multiple combined biaxial compression (or tension), shear and normal pressure load cases. Longitudinal compression, however, is assumed to be the dominant loading. Temperature, initial bow eccentricity and load eccentricity effects are included. The panel geometry is assumed to be repetitive over several bays in the longitudinal (stiffener) direction as well as in the transverse direction. Analytical routines are included to compute panel stiffnesses, strains, local and panel buckling loads, and skin/stiffener interface stresses. The resulting program is applicable to stiffened panels as commonly used in fuselage, wing, or empennage structures. The analysis procedures and rationale for the assumptions used therein are described in detail.

Dickson, J. N.↗

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↗

CORSSTOL: Cylinder Optimization of Rings, Skin, and Stringers with Tolerance sensitivity

Cylinder Optimization of Rings, Skin, and Stringers with Tolerance (CORSSTOL) sensitivity is a design optimization program incorporating a method to examine the effects of user-provided manufacturing tolerances on weight and failure. CORSSTOL gives designers a tool to determine tolerances based on need. This is a decisive way to choose the best design among several manufacturing methods with differing capabilities and costs. CORSSTOL initially optimizes a stringer-stiffened cylinder for weight without tolerances. The skin and stringer geometry are varied, subject to stress and buckling constraints. Then the same analysis and optimization routines are used to minimize the maximum material condition weight subject to the least favorable combination of tolerances. The adjusted optimum dimensions are provided with the weight and constraint sensitivities of each design variable. The designer can immediately identify critical tolerances. The safety of parts made out of tolerance can also be determined. During design and development of weight-critical systems, design/analysis tools that provide product-oriented results are of vital significance. The development of this program and methodology provides designers with an effective cost- and weight-saving design tool. The tolerance sensitivity method can be applied to any system defined by a set of deterministic equations.

Finckenor, J.↗

General purpose optimization software for engineering design

The author has developed several general purpose optimization programs over the past twenty years. The earlier programs were developed as research codes and served that purpose reasonably well. However, in taking the formal step from research to industrial application programs, several important lessons have been learned. Among these are the importance of clear documentation, immediate user support, and consistent maintenance. Most important has been the issue of providing software that gives a good, or at least acceptable, design at minimum computational cost. Here, the basic issues developing optimization software for industrial applications are outlined and issues of convergence rate, reliability, and relative minima are discussed. Considerable feedback has been received from users, and new software is being developed to respond to identified needs. The basic capabilities of this software are outlined. A major motivation for the development of commercial grade software is ease of use and flexibility, and these issues are discussed with reference to general multidisciplinary applications. It is concluded that design productivity can be significantly enhanced by the more widespread use of optimization as an everyday design tool.

Vanderplaats, G. N.↗

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, ↗

Trajectory optimization software for planetary mission design

The development history and characteristics of the interactive trajectory-optimization programs MOSES (D'Amario et al., 1981) and PLATO (D'Amario et al., 1982) are briefly reviewed, with an emphasis on their application to the Galileo mission. The requirements imposed by a mission involving flybys of several planetary satellites or planets are discussed; the formulation of the parameter-optimization problem is outlined; and particular attention is given to the use of multiconic methods to model the gravitational attraction of Jupiter in MOSES. Diagrams and tables of numerical data are included.

D'Amario, Louis A.↗

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↗

New approaches for efficient solution of hitting set problem

A new method for solving the hitting set problem is proposed. This method is based on the mapping of the problem onto an integer programming optimization problem. this new approach provides an algorithm with much better performance compare to the algorithms for the hitting set problem that currently are used for solving the diagnosis problem.

integer programming↗

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↗

A Novel Multi-Spacecraft Interplanetary Global Trajectory Optimization Transcription

As the frontier of space exploration continues to advance, so does the design complexity of future interplanetary missions. One avenue of this increasing complexity includes a class of designs known as "Distributed Spacecraft Missions"; missions where multiple spacecraft coordinate to perform shared objectives. Current approaches for the global trajectory optimization of these Multi-Vehicle Missions (MVMs) are prone to shortcomings including laborious iterative design, considerable human-in-the-loop effort, treatment of the multi-vehicle problem as multiple separate trajectory optimization subproblems (resulting in suboptimal solutions where the whole is less than the sum of its parts), and poor handling of coordination objectives and constraints. There are only a handful of software platforms in existence capable of fully-automated, rapid, interplanetary mission and systems global optimization including the Parallel Global Multiobjective Optimizer (PaGMO), the Gravity Assisted Low-thrust Local Optimization Program (GALLOP), and the Evolutionary Mission Trajectory Generator (EMTG). However, none of these tools is capable of performing such tasks for MVM designs. The work outlined in this paper lays the groundwork for a technique to begin addressing these shortcomings. We present a fully-automated technique which frames interplanetary MVMs as Multi-Objective, Multi-Agent Hybrid Optimal Control Problems (MOMA HOCP). First, the basic functionality of this technique is validated on the single-vehicle problem of reproducing the Cassini interplanetary cruise.

Interplanetary↗

A Novel Multi-Spacecraft Interplanetary Global Trajectory Optimization Transcription

As the frontier of space exploration continues to advance, so does the design complexity of future interplanetary missions. One avenue of this increasing complexity includes a class of designs known as ``Distributed Spacecraft Missions"; missions where multiple spacecraft coordinate to perform shared objectives. Current approaches for the global trajectory optimization of these Multi-Vehicle Missions (MVMs) are prone to shortcomings including laborious iterative design, considerable human-in-the-loop effort, treatment of the multi-vehicle problem as multiple separate trajectory optimization subproblems (resulting in suboptimal solutions where the whole is less than the sum of its parts), and poor handling of coordination objectives and constraints. There are only a handful of software platforms in existence capable of fully-automated, rapid, interplanetary mission and systems global optimization including the Parallel Global Multiobjective Optimizer (PaGMO), the Gravity Assisted Low-thrust Local Optimization Program (GALLOP), and the Evolutionary Mission Trajectory Generator (EMTG). However, none of these tools is capable of performing such tasks for MVM designs. The work outlined in this paper lays the groundwork for a technique to begin addressing these shortcomings. We present a fully-automated technique which frames interplanetary MVMs as Multi-Objective, Multi-Agent Hybrid Optimal Control Problems (MOMA HOCP). First, the basic functionality of this technique is validated on the single-vehicle problem of reproducing the Cassini interplanetary cruise.

Napier, Sean W.↗

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↗

Spur-gear optimization using SPUROPT computer program

A computer program developed for optimizing spur gear designs, SPUROPT, was updated by installing a new subroutine that uses AGMA 908-B89 standards to calculate the J-factor for determining tooth-bending stress. The updated SPUROPT program was then used to optimize a spur gear set for maximum fatigue life, minimum dynamic load, or minimum weight. All calculations were made with constraints on as many as 13 parameters by using three design variables: the number of teeth, diametral pitch, and tooth-face width. Results depended largely on constraints values. When the limiting bending stress was set at a high value, the optimal solution was the highest allowable number of teeth. When the allowable bending stress was lowered, the optimal solution moved toward the fewest number of teeth permitted. Final results were also affected by the amount of transmission error. A lower error permitted a higher number of teeth.

Coe, Harold H.↗

Optimal design of geodesically stiffened composite cylindrical shells

An optimization system based on general-purpose finite element code CSM Testbed and optimization program ADS is described. The system can be used to obtain minimum-mass designs of composite shell structures with complex stiffening arrangements. Ply thicknesses, ply orientations, and stiffener heights can be used as design variables. Buckling, displacement, and material failure constraints can be imposed on the design. The system is used to conduct a preliminary design study of geodesically stiffened shells. For comparison purposes, optimal designs of unstiffened shells, and ring and longitudinal stringer stiffened shells are also studied. Trends in the design of geodesically stiffened shells are identified. Features that enhance the capabilities and efficiency of the design system are described.

Gendron, G.↗

Optimum design of a composite structure with ply-interleaving constraints

The application of composite materials to aircraft construction has provided the designer with increased flexibility. The orientation of plies can be tailored to provide additional aeroelastic performance unobtainable with an isotropic material. A tailored laminate is made up of plies of several orientations, usually 0 deg, 45 deg, -45 deg, and 90 deg. The direction of the 0 deg plies, does not need to be oriented with the leading edge, but can be varied to obtain a wide variety of structural properties. Also, the number of plies of each orientation varies from one zone to another on the planform. Thus, a thick laminate with mainly 0 deg plies may form the root zone, and a thinner laminate with mainly +45 deg plies may form the leading edge zone. Tailored laminates were designed using complicated optimization programs. Unfortunately, many tailored designs must be modified before they are manufactured. The modification adds weight and decreases performance. One type of modification is ply interleaving, an overlap of plies between zones on the laminate. These interleaves are added to ensure that zones with varying ply percentages can be connected without loss of strength. In this paper, the constraints needed to eliminate interleaves in the laminate optimization process will be described and implemented in a structural optimization problem. The method used has the potential to prevent changes to composite laminates late in the design cycle.

Wang, Bo Ping↗

Scenario Complexity for Unmanned Aircraft System Traffic

This work introduces an approach to estimate the complexity of a low-altitude air traffic scenario involving multiple UASs using mathematical programming. Given a set of multi-point UAS flight trajectories, vehicle dynamics, and a conflict resolution algorithm, an abstract model is developed such that it can be solved quickly using a mathematical programming optimization software without running high-fidelity simulations that can be computationally expensive and may not suit real-time applications. In the abstract model, each vehicle is represented by a time-varied vector associated with position, speed, and heading information. The total extra distance that aircraft need to divert from their original routes to avoid collisions is computed and used to setup a quadratic programming formula. The metrics including the number of conflicts and extra distances travelled by all vehicles are then utilized to estimate the complexity of a given UAS flight scenario. Results and verification against high-fidelity simulations will be provided in the final draft.

UTM↗