SEARCH · Search NASA

Results for “Heuristic 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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 235 records · Page 13

All sources NASA NTRS DOE OSTI

NASA NTRS1991

Formal and heuristic system decomposition methods in multidisciplinary synthesis

The multidisciplinary interactions which exist in large scale engineering design problems provide a unique set of difficulties. These difficulties are associated primarily with unwieldy numbers of design variables and constraints, and with the interdependencies of the discipline analysis modules. Such obstacles require design techniques which account for the inherent disciplinary couplings in the analyses and optimizations. The objective of this work was to develop an efficient holistic design synthesis methodology that takes advantage of the synergistic nature of integrated design. A general decomposition approach for optimization of large engineering systems is presented. The method is particularly applicable for multidisciplinary design problems which are characterized by closely coupled interactions among discipline analyses. The advantage of subsystem modularity allows for implementation of specialized methods for analysis and optimization, computational efficiency, and the ability to incorporate human intervention and decision making in the form of an expert systems capability. The resulting approach is not a method applicable to only a specific situation, but rather, a methodology which can be used for a large class of engineering design problems in which the system is non-hierarchic in nature.

Bloebaum, Christina L.↗

DOE OSTI2025

Microreactor-liquid metal battery system in energy markets: An evaluation of potential costs, technology, and policy impacts

Microreactors represent an emerging innovation in the nuclear industry; yet have been overshadowed by their high capital costs. With the Inflation Reduction Act of 2022 (IRA), new opportunities have emerged to improve the economics of microreactor systems. This work examines liquid metal batteries (LMB) as a value-adding technology as part of microreactor-LMB systems within three U.S. electricity markets: ERCOT, PJM, and MISO. Our investigation considers key uncertainties: the cost of microreactors, the performance of LMBs, and the eligible tax credit levels. To this end, we use a dispatch optimization to trace not only the changes in system economics but also to provide a granular picture of energy delivery within the systems. We find that even with favorable costs for microreactors, significant regional variations in the project sizing and returns exist across the markets. Our heuristic method identifies their non-electric application potentials beyond electricity and technical requirements to maximize returns. The results suggest that 12–39 % of reactor heat could be cost-effectively diverted to produce more valuable by-products in U.S. markets. Including the impacts of tax credits, we establish the outcomes of each provision with varying rates. Coupling an LMB to a microreactor consistently improves the net present value of a microreactor compared to its standalone operation. In conclusion, for reasonable assumed conditions, we quantify a heterogeneous impact of round-trip efficiency (RTE) and extended LMB service life across the three markets—a one-year extension in LMB service life is roughly equivalent to a 2.11 % improvement in RTE for ERCOT, 1.16 % for PJM, and 1.04 % for MISO.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2025

srlife : a software tool for estimating the life of high temperature concentrating solar receivers. Part I – metallic receivers

Here, this paper introduces srlife, a tool for estimating the structural service life of concentrating solar power (CSP) receivers operating at high temperatures. Supporting both metallic and ceramic receiver designs, srlife is available as open-source software at https://github.com/applied-material-modeling/srlife and can be installed via the PyPi package manager (https://pypi.org). Given basic receiver geometry and incident heat flux, the tool performs thermohydraulic and structural analysis and estimates the life of a receiver. Designed for easy integration into a software stack, including solar field and levelized cost analysis, the tool can be utilized for optimizing receiver designs to meet service life and economic targets. This paper is Part I in a two-part series. Part I discusses the analysis process used to estimate the life of metallic receivers, along with a description of the required input data. Additionally, several heuristics applied within srlife can reduce analysis time significantly while maintaining accurate life estimations for metallic receivers when compared to full analyses. Several examples demonstrating the utility of srlife in receiver design are also discussed. Part II focuses on the life estimation of ceramic receivers, using time-dependent reliability analysis and various ceramic failure models implemented in srlife.

Creep-fatigue analysis↗

NASA NTRS1990

Real-time adaptive aircraft scheduling

One of the most important functions of any air traffic management system is the assignment of ground-holding times to flights, i.e., the determination of whether and by how much the take-off of a particular aircraft headed for a congested part of the air traffic control (ATC) system should be postponed in order to reduce the likelihood and extent of airborne delays. An analysis is presented for the fundamental case in which flights from many destinations must be scheduled for arrival at a single congested airport; the formulation is also useful in scheduling the landing of airborne flights within the extended terminal area. A set of approaches is described for addressing a deterministic and a probabilistic version of this problem. For the deterministic case, where airport capacities are known and fixed, several models were developed with associated low-order polynomial-time algorithms. For general delay cost functions, these algorithms find an optimal solution. Under a particular natural assumption regarding the delay cost function, an extremely fast (O(n ln n)) algorithm was developed. For the probabilistic case, using an estimated probability distribution of airport capacities, a model was developed with an associated low-order polynomial-time heuristic algorithm with useful properties.

Kolitz, Stephan E.↗

NASA NTRS1990

An improved exploratory search technique for pure integer linear programming problems

The development is documented of a heuristic method for the solution of pure integer linear programming problems. The procedure draws its methodology from the ideas of Hooke and Jeeves type 1 and 2 exploratory searches, greedy procedures, and neighborhood searches. It uses an efficient rounding method to obtain its first feasible integer point from the optimal continuous solution obtained via the simplex method. Since this method is based entirely on simple addition or subtraction of one to each variable of a point in n-space and the subsequent comparison of candidate solutions to a given set of constraints, it facilitates significant complexity improvements over existing techniques. It also obtains the same optimal solution found by the branch-and-bound technique in 44 of 45 small to moderate size test problems. Two example problems are worked in detail to show the inner workings of the method. Furthermore, using an established weighted scheme for comparing computational effort involved in an algorithm, a comparison of this algorithm is made to the more established and rigorous branch-and-bound method. A computer implementation of the procedure, in PC compatible Pascal, is also presented and discussed.

Fogle, F. R.↗

NASA NTRS2007

Modeling and Optimization for Morphing Wing Concept Generation

This report consists of two major parts: 1) the approach to develop morphing wing weight equations, and 2) the approach to size morphing aircraft. Combined, these techniques allow the morphing aircraft to be sized with estimates of the morphing wing weight that are more credible than estimates currently available; aircraft sizing results prior to this study incorporated morphing wing weight estimates based on general heuristics for fixed-wing flaps (a comparable "morphing" component) but, in general, these results were unsubstantiated. This report will show that the method of morphing wing weight prediction does, in fact, drive the aircraft sizing code to different results and that accurate morphing wing weight estimates are essential to credible aircraft sizing results.

Skillen, Michael D.↗

NASA NTRS1990

Minimizing distortion and internal forces in truss structures by simulated annealing

Inaccuracies in the length of members and the diameters of joints of large space structures may produce unacceptable levels of surface distortion and internal forces. Here, two discrete optimization problems are formulated, one to minimize surface distortion (DSQRMS) and the other to minimize internal forces (FSQRMS). Both of these problems are based on the influence matrices generated by a small-deformation linear analysis. Good solutions are obtained for DSQRMS and FSQRMS through the use of a simulated annealing heuristic.

Kincaid, Rex K.↗

NASA NTRS1993

Investigation of the launch pad abort capabilities of the HL-20 lifting body

The capability of the HL-20 lifting body spacecraft to perform an abort maneuver from the launch pad to a horizontal landing was studied at NASA Langley Research Center. This study involved both piloted and batch simulation models of the vehicle. A point-mass model of the vehicle was used for trajectory optimization studies. The piloted simulation was performed in the Visual Motion Simulator in fixed-base mode. A candidate maneuver was developed and refined for the worst-case launch-pad-to-landing-site geometry using an iterative procedure of off-line maneuver analysis followed by piloted evaluations and heuristic improvements to the candidate maneuver. The resulting maneuver demonstrates the launch site abort capability of the HL-20 and dictates requirements for nominal abort motor performance. The sensitivity of the maneuver to variations in several design parameters was documented.

Jackson, E. B.↗

DOE OSTI2026

A variational framework for residual-based adaptivity in neural PDE solvers and operator learning

Residual-based adaptive strategies are widely used in scientific machine learning yet remain largely heuristic. We introduce a variational framework that formalizes these methods through convex transformations of the residual, where different transformations correspond to distinct objective functionals. For instance, exponential weights target uniform error minimization, while linear weights recover quadratic error minimization. This perspective reveals adaptive weighting as a means of selecting sampling distributions that optimize a primal objective, directly linking discretization choices to error metrics. This principled approach yields three key benefits: it enables systematic design of adaptive schemes, reduces discretization error by lowering estimator variance, and enhances learning dynamics by improving gradient signal-to-noise ratio. Extending the framework to operator learning, we demonstrate substantial performance gains across diverse optimizers and architectures. Our results provide a theoretical perspective for residual-based adaptivity and establish a foundation for principled discretization and training.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1987

Mathematical programming formulations for satellite synthesis

The problem of satellite synthesis can be described as optimally allotting locations and sometimes frequencies and polarizations, to communication satellites so that interference from unwanted satellite signals does not exceed a specified threshold. In this report, mathematical programming models and optimization methods are used to solve satellite synthesis problems. A nonlinear programming formulation which is solved using Zoutendijk's method and a gradient search method is described. Nine mixed integer programming models are considered. Results of computer runs with these nine models and five geographically compatible scenarios are presented and evaluated. A heuristic solution procedure is also used to solve two of the models studied. Heuristic solutions to three large synthesis problems are presented. The results of our analysis show that the heuristic performs very well, both in terms of solution quality and solution time, on the two models to which it was applied. It is concluded that the heuristic procedure is the best of the methods considered for solving satellite synthesis problems.

Bhasin, Puneet↗

NASA NTRS1994

Launch-pad abort capabilities of the HL-20 lifting body

The capability of the HL-20 lifting body to perform an abort maneuver from the launch pad to a horizontal landing was studied. The study involved both piloted and batch simulation models of the vehicle. A point-mass model of the vehicle was used for trajectory optimization studies. The piloted simulation was performed in the Langley Visual/Motion Simulator in the fixed-base mode. A candidate maneuver was developed and refined for the worst-case launch-pad-to-landing-site geometry with an iterative procedure of off-line maneuver analysis followed by piloted evaluations and heuristic improvements to the candidate maneuver. The resulting maneuver demonstrates the launch-site abort capability of the HL-20 and dictates requirements for nominal abort-motor performance. The sensitivity of the maneuver to variations in several design parameters was documented.

Jackson, E. Bruce↗

NASA NTRS1990

Space communications scheduler: A rule-based approach to adaptive deadline scheduling

Job scheduling is a deceptively complex subfield of computer science. The highly combinatorial nature of the problem, which is NP-complete in nearly all cases, requires a scheduling program to intelligently transverse an immense search tree to create the best possible schedule in a minimal amount of time. In addition, the program must continually make adjustments to the initial schedule when faced with last-minute user requests, cancellations, unexpected device failures, quests, cancellations, unexpected device failures, etc. A good scheduler must be quick, flexible, and efficient, even at the expense of generating slightly less-than-optimal schedules. The Space Communication Scheduler (SCS) is an intelligent rule-based scheduling system. SCS is an adaptive deadline scheduler which allocates modular communications resources to meet an ordered set of user-specified job requests on board the NASA Space Station. SCS uses pattern matching techniques to detect potential conflicts through algorithmic and heuristic means. As a result, the system generates and maintains high density schedules without relying heavily on backtracking or blind search techniques. SCS is suitable for many common real-world applications.

Straguzzi, Nicholas↗

NASA NTRS1988

Development and demonstration of an on-board mission planner for helicopters

Mission management tasks can be distributed within a planning hierarchy, where each level of the hierarchy addresses a scope of action, and associated time scale or planning horizon, and requirements for plan generation response time. The current work is focused on the far-field planning subproblem, with a scope and planning horizon encompassing the entire mission and with a response time required to be about two minutes. The far-feld planning problem is posed as a constrained optimization problem and algorithms and structural organizations are proposed for the solution. Algorithms are implemented in a developmental environment, and performance is assessed with respect to optimality and feasibility for the intended application and in comparison with alternative algorithms. This is done for the three major components of far-field planning: goal planning, waypoint path planning, and timeline management. It appears feasible to meet performance requirements on a 10 Mips flyable processor (dedicated to far-field planning) using a heuristically-guided simulated annealing technique for the goal planner, a modified A* search for the waypoint path planner, and a speed scheduling technique developed for this project.

Deutsch, Owen L.↗

NASA NTRS1995

A linguistic geometry for 3D strategic planning

This paper is a new step in the development and application of the Linguistic Geometry. This formal theory is intended to discover the inner properties of human expert heuristics, which have been successful in a certain class of complex control systems, and apply them to different systems. In this paper we investigate heuristics extracted in the form of hierarchical networks of planning paths of autonomous agents. Employing Linguistic Geometry tools the dynamic hierarchy of networks is represented as a hierarchy of formal attribute languages. The main ideas of this methodology are shown in this paper on the new pilot example of the solution of the extremely complex 3D optimization problem of strategic planning for the space combat of autonomous vehicles. This example demonstrates deep and highly selective search in comparison with conventional search algorithms.

Stilman, Boris↗

NASA NTRS1987

Engineering calculations for the Delta S method of solving the orbital allotment problem

The method of calculating single-entry separation requirements for pairs of satellites is extended to include the interference on the top link as well as on the down link. Several heuristic models for analyzing the effects of shaped-beam antenna designs on required satellite separations are introduced and demonstrated with gain contour plots. The calculation of aggregate interference is extended to include the effects of up-link interference. The relationship between the single-entry C/I requirements, used in determining satellite separation constraints for various optimization procedures, and the aggregate C/I values of the resulting solutions is discussed.

Kohnhorst, P. A.↗

NASA NTRS1994

A linguistic geometry for space applications

We develop a formal theory, the so-called Linguistic Geometry, in order to discover the inner properties of human expert heuristics, which were successful in a certain class of complex control systems, and apply them to different systems. This research relies on the formalization of search heuristics of high-skilled human experts which allow for the decomposition of complex system into the hierarchy of subsystems, and thus solve intractable problems reducing the search. The hierarchy of subsystems is represented as a hierarchy of formal attribute languages. This paper includes a formal survey of the Linguistic Geometry, and new example of a solution of optimization problem for the space robotic vehicles. This example includes actual generation of the hierarchy of languages, some details of trajectory generation and demonstrates the drastic reduction of search in comparison with conventional search algorithms.

Stilman, Boris↗

DOE OSTI2024

Optimizing Batch Crystallization with Model-based Design of Experiments

Adaptive and self-optimizing intelligent systems such as digital twins are increasingly important in science and engineering. Digital twins utilize mathematical models to provide added precision to decision-making. However, physics-informed models are challenging to build, calibrate, and validate with existing data science methods. Model-based design of experiments (MBDoE) is a popular framework for optimizing data collection to maximize parameter precision in mathematical models and digital twins. In this work, we apply MBDoE, facilitated by the open-source package Pyomo.DoE, to train and validate mathematical models for batch crystallization. We quantitatively examined the estimability of the model parameters for experiments with different cooling rates. This analysis provides a quantitative explanation for the heuristic of using multiple experiments at different cooling rates.

Lynch, Hailey↗

NASA NTRS2013

NASA Tech Briefs, May 2013

Topics include: Test Waveform Applications for JPL STRS Operating Environment; Pneumatic Proboscis Heat-Flow Probe; Method to Measure Total Noise Temperature of a Wireless Receiver During Operation; Cursor Control Device Test Battery; Functional Near-Infrared Spectroscopy Signals Measure Neuronal Activity in the Cortex; ESD Test Apparatus for Soldering Irons; FPGA-Based X-Ray Detection and Measurement for an X-Ray Polarimeter; Sequential Probability Ratio Test for Spacecraft Collision Avoidance Maneuver Decisions; Silicon/Carbon Nanotube Photocathode for Splitting Water; Advanced Materials and Fabrication Techniques for the Orion Attitude Control Motor; Flight Hardware Packaging Design for Stringent EMC Radiated Emission Requirements; RF Reference Switch for Spaceflight Radiometer Calibration; An Offload NIC for NASA, NLR, and Grid Computing; Multi-Scale CNT-Based Reinforcing Polymer Matrix Composites for Lightweight Structures; Ceramic Adhesive and Methods for On-Orbit Repair of Re-Entry Vehicles; Self-Healing Nanocomposites for Reusable Composite Cryotanks; Pt-Ni and Pt-Co Catalyst Synthesis Route for Fuel Cell Applications; Aerogel-Based Multilayer Insulation with Micrometeoroid Protection; Manufacturing of Nanocomposite Carbon Fibers and Composite Cylinders; Optimized Radiator Geometries for Hot Lunar Thermal Environments; A Mission Concept: Re-Entry Hopper-Aero-Space-Craft System on-Mars (REARM-Mars); New Class of Flow Batteries for Terrestrial and Aerospace Energy Storage Applications; Reliability of CCGA 1152 and CCGA 1272 Interconnect Packages for Extreme Thermal Environments; Using a Blender to Assess the Microbial Density of Encapsulated Organisms; Mixed Integer Programming and Heuristic Scheduling for Space Communication; Video Altimeter and Obstruction Detector for an Aircraft; Control Software for Piezo Stepping Actuators; Galactic Cosmic Ray Event-Based Risk Model (GERM) Code; Sasquatch Footprint Tool; and Multi-User Space Link Extension (SLE) System.

Source record↗