Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Optimization algorithms”

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

RLMolLM: Reinforcement Learning-Enhanced Language Model Framework for Inverse Molecular Design

Inverse molecular design faces significant challenges due to vast chemical space and complex property requirements. While language models show promise for molecular generation, they struggle with validity, multi-property optimization, and structural constraints. This work presents RLMolLM, a reinforcement learning framework combining Proximal Policy Optimization (PPO) with genetic algorithms to address these limitations. Our approach optimizes multiple user-specified properties including quantitative estimates of drug-likeness (QED), synthetic accessibility (SA), and ADMET (absorption, distribution, metabolism, excretion, and toxicity) endpoints without requiring complete model retraining, while maintaining capability for scaffold-constrained generation where specific substructures must be preserved. We outperform state-of-the-art methods for molecular optimization, achieving best QED scores across GDB13, Moses, and Zinc datasets with up to 31% improvement over previous methods while maintaining excellent validity, uniqueness, and novelty metrics. For simultaneous multi-property optimization, our framework achieves substantial improvements in ADMET properties including 4.5-fold reduction in hERG toxicity and enhanced Caco-2 permeability compared to Moses dataset. Under structural constraints, the framework significantly improves molecular validity while preserving scaffolds and effectively optimizing properties. In conclusion, this versatile solution advances pharmaceutical and materials molecular design through effective integration of reinforcement learning and genetic algorithms with multi-property optimization and scaffold preservation.

Genetic algorithms↗

CATS: The Hubble Constant from Standardized TRGB and Type Ia Supernova Measurements

The tip of the red giant branch (TRGB) provides a luminous standard candle for constructing distance ladders to measure the Hubble constant. In practice, its measurements via edge-detection response (EDR) are complicated by the apparent fuzziness of the tip and the multipeak landscape of the EDR. Previously, we optimized an unsupervised algorithm, Comparative Analysis of TRGBs, to minimize the variance among multiple halo fields per host without relying on individualized choices, achieving state-of-the-art ~<0.05 mag distance measures for optimal data. Here we apply this algorithm to an expanded sample of SN Ia hosts to standardize these to multiple fields in the geometric anchor, NGC 4258. In concert with the Pantheon+ SN Ia sample, this analysis produces a (baseline) result of H 0 = 73.22 ± 2.06 km s -1 Mpc -1 . The largest difference in H 0 between this and similar studies employing the TRGB derives from corrections for SN survey differences and local flows used in the most recent SN Ia compilations that were absent in earlier studies. The SN-related differences total ~2.0 km s -1 Mpc -1 . A smaller share, ~1.4 km s -1 Mpc -1 , results from the inhomogeneity of the TRGB calibration across the distance ladder. We employ a grid of 108 variants around the optimal TRGB algorithm and find that the median of the variants is 72.94 ± 1.98 km s -1 Mpc -1 with an additional uncertainty due to algorithm choices of 0.83 km s -1 Mpc -1 . None of these TRGB variants result in an H 0 of less than 71.6 km s -1 Mpc -1 .

79 ASTRONOMY AND ASTROPHYSICS↗

Developing a Drilling Optimization System for Improved Overall Rate of Penetration in Geothermal Wells

Geothermal energy is renewable, reliable and environmentally friendly source of energy. The major cost in the development of geothermal wells is the actual drilling of the wells. The main objective of this paper is to introduce a new real-time drilling optimization system designed for granite formation to reduce the overall drilling cost. In this study, a drilling optimization system is verified using drilling data from Utah-Forge well 58-32. The drilling optimization system used the Utah-Forge well 58-32 data to achieve real-time unconfined compressive strength (UCS). Based on the UCS value from the previous feet, the system simulates the ROP for the next drilling feet. The drilling optimization system utilizes the Differential Evolution Algorithm (DEA), which is a metaheuristic method to search the space of solution, to find the best operating parameters (i.e. WOB and RPM) for the next drilling foot. The optimization algorithm takes a maximum cutter temperature into account as a constraint and avoids the accelerated wear. The developed drilling optimization system improves ROP responses and reduces the drilling cost of geothermal wells. The simulated ROP results from the system show a good agreement with the ROP from Utah-Forge well 58-32 drilling data. The drilling time before and after optimization for both intervals were presented.

15 GEOTHERMAL ENERGY↗

Sequential Testing Algorithms for Multiple Fault Diagnosis

In this paper, we consider the problem of constructing optimal and near-optimal test sequencing algorithms for multiple fault diagnosis. The computational complexity of solving the optimal multiple-fault isolation problem is super-exponential, that is, it is much more difficult than the single-fault isolation problem, which, by itself, is NP-hard. By employing concepts from information theory and AND/OR graph search, we present several test sequencing algorithms for the multiple fault isolation problem. These algorithms provide a trade-off between the degree of suboptimality and computational complexity. Furthermore, we present novel diagnostic strategies that generate a diagnostic directed graph (digraph), instead of a diagnostic tree, for multiple fault diagnosis. Using this approach, the storage complexity of the overall diagnostic strategy reduces substantially. The algorithms developed herein have been successfully applied to several real-world systems. Computational results indicate that the size of a multiple fault strategy is strictly related to the structure of the system.

Shakeri, Mojdeh↗

Optimal Placement Of Multiple Antennas

Computer program based on pair of algorithms selects approximately optimal locations of antennas and approximately optimal number of elements in each antenna of multiple-antenna communication system. Obscuration in field of view at given antenna location taken into account in choice of number of antenna elements mounted there. Directional coverages of combinations of up to four antenna elements computed in search for combination to cover clear portion of field of view. Developed to aid design of antenna system of conceptual space station. Applied to system aboard ship or aircraft, on building in city, or in any location where transmission and reception blocked in some directions from each potential antenna-mounting point.

Shelton, Kyle W.↗

Performance tradeoffs in static and dynamic load balancing strategies

The problem of uniformly distributing the load of a parallel program over a multiprocessor system was considered. A program was analyzed whose structure permits the computation of the optimal static solution. Then four strategies for load balancing were described and their performance compared. The strategies are: (1) the optimal static assignment algorithm which is guaranteed to yield the best static solution, (2) the static binary dissection method which is very fast but sub-optimal, (3) the greedy algorithm, a static fully polynomial time approximation scheme, which estimates the optimal solution to arbitrary accuracy, and (4) the predictive dynamic load balancing heuristic which uses information on the precedence relationships within the program and outperforms any of the static methods. It is also shown that the overhead incurred by the dynamic heuristic is reduced considerably if it is started off with a static assignment provided by either of the other three strategies.

Iqbal, M. A.↗

Particle Swarm Optimization Toolbox

The Particle Swarm Optimization Toolbox is a library of evolutionary optimization tools developed in the MATLAB environment. The algorithms contained in the library include a genetic algorithm (GA), a single-objective particle swarm optimizer (SOPSO), and a multi-objective particle swarm optimizer (MOPSO). Development focused on both the SOPSO and MOPSO. A GA was included mainly for comparison purposes, and the particle swarm optimizers appeared to perform better for a wide variety of optimization problems. All algorithms are capable of performing unconstrained and constrained optimization. The particle swarm optimizers are capable of performing single and multi-objective optimization. The SOPSO and MOPSO algorithms are based on swarming theory and bird-flocking patterns to search the trade space for the optimal solution or optimal trade in competing objectives. The MOPSO generates Pareto fronts for objectives that are in competition. A GA, based on Darwin evolutionary theory, is also included in the library. The GA consists of individuals that form a population in the design space. The population mates to form offspring at new locations in the design space. These offspring contain traits from both of the parents. The algorithm is based on this combination of traits from parents to hopefully provide an improved solution than either of the original parents. As the algorithm progresses, individuals that hold these optimal traits will emerge as the optimal solutions. Due to the generic design of all optimization algorithms, each algorithm interfaces with a user-supplied objective function. This function serves as a "black-box" to the optimizers in which the only purpose of this function is to evaluate solutions provided by the optimizers. Hence, the user-supplied function can be numerical simulations, analytical functions, etc., since the specific detail of this function is of no concern to the optimizer. These algorithms were originally developed to support entry trajectory and guidance design for the Mars Science Laboratory mission but may be applied to any optimization problem.

Grant, Michael J.↗

Optimal Pitch Thrust-Vector Angle and Benefits for all Flight Regimes

The NASA Dryden Flight Research Center is exploring the optimum thrust-vector angle on aircraft. Simple aerodynamic performance models for various phases of aircraft flight are developed and optimization equations and algorithms are presented in this report. Results of optimal angles of thrust vectors and associated benefits for various flight regimes of aircraft (takeoff, climb, cruise, descent, final approach, and landing) are given. Results for a typical wide-body transport aircraft are also given. The benefits accruable for this class of aircraft are small, but the technique can be applied to other conventionally configured aircraft. The lower L/D aerodynamic characteristics of fighters generally would produce larger benefits than those produced for transport aircraft.

Gilyard, Glenn B.↗

ZEUS: An Efficient GPU Optimization Method Integrating PSO, BFGS, and Automatic Differentiation

We introduce a novel, efficient computational method, ZEUS, for numerical optimization, and provide an open-source implementation. It has four key ingredients: (1) particle swarm optimization (PSO), (2) the use of the Broyden-Fletcher-Goldfarb-Shanno (BFGS) method, (3) automatic differentiation (AD), and (4) GPUs. Our approach addresses the computational challenges inherent in high-dimensional, non-convex optimization problems. In the first phase of the algorithm, we get a potentially good set of starting points using PSO. Thereafter, we run BFGS independently in parallel from these starting points. BFGS is one of the best-performing algorithms for numerical optimization. However, it requires the gradient of the function being optimized. ZEUS integrates automatic differentiation into BFGS thus avoiding the need for the user to calculate derivatives explicitly. The use of GPUs allows ZEUS to speed up the calculations substantially. We carry out systematic studies to explore the trade-offs between the number of PSO iterations taken, starting points, and BFGS iteration depth. We show that a handful of iterations of PSO can improve global convergence when combined with BFGS. We also present performance studies using common test functions. The source code can be found at https://github.com/fnal-numerics/global-optimizer-gpu.

Soos, Dominik [Old Dominion U.]↗

Techniques for shuttle trajectory optimization

The application of recently developed function-space Davidon-type techniques to the shuttle ascent trajectory optimization problem is discussed along with an investigation of the recently developed PRAXIS algorithm for parameter optimization. At the outset of this analysis, the major deficiency of the function-space algorithms was their potential storage problems. Since most previous analyses of the methods were with relatively low-dimension problems, no storage problems were encountered. However, in shuttle trajectory optimization, storage is a problem, and this problem was handled efficiently. Topics discussed include: the shuttle ascent model and the development of the particular optimization equations; the function-space algorithms; the operation of the algorithm and typical simulations; variable final-time problem considerations; and a modification of Powell's algorithm.

Edge, E. R.↗

Optimization of a Lunar Pallet Lander Reinforcement Structure Using a Genetic Algorithm

This paper presents a design automation process using optimization via a genetic algorithm to design the conceptual structure of a Lunar Pallet Lander. The goal is to determine a design that will have the primary natural frequencies at or above a target value as well as minimize the total mass. Several iterations of the process are presented. First, a concept optimization is performed to determine what class of structure would produce suitable candidate designs. From this a stiffened sheet metal approach was selected leading to optimization of beam placement through generating a two-dimensional mesh and varying the physical location of reinforcing beams. Finally, the design space is reformulated as a binary problem using 1-dimensional beam elements to truncate the design space to allow faster convergence and additional mechanical failure criteria to be included in the optimization responses. Results are presented for each design space configuration. The final flight design was derived from these results.

Burt, Adam O.↗

A combined experimental and numerical approach that eliminates the non-uniqueness associated with the Johnson-Cook parameters obtained using inverse methods

Abstract Johnson-Cook constitutive model is a commonly used material model for machining simulations. The model includes five parameters that capture the initial yield stress, strain-hardening, strain-rate hardening, and thermal softening behavior of the material. These parameters are difficult to determine using experiments since the conditions observed during machining (such as high strain-rates of the order of $$10^5$$ 10 5 /sec - $$10^6$$ 10 6 /sec) are challenging to recreate in the laboratory. To address this problem, several researchers have recently proposed inverse approaches where a combination of experiments and analytical models are used to predict the Johnson-Cook parameters. The errors between the measured cutting forces, chip thicknesses and temperatures and those predicted by analytical models are minimized and the parameters are determined. In this work, it is shown that only two of the five Johnson-Cook parameters can be determined uniquely using inverse approaches. Two different algorithms, namely, Adaptive Memory Programming for Global Optimization (AMPGO) and Particle Swarm Optimization (PSO), are used for this purpose. The extended Oxley’s model is used as the analytical tool for optimization. For determining a parameter’s value, a large range for each parameter is provided as an input to the algorithms. The algorithms converge to several different sets of values for the five Johnson-Cook parameters when all the five parameters are considered as unknown in the optimization algorithm. All of these sets, however, yield the same chip shape and cutting forces in FEM simulations. Further analyses show that only the strain-rate and thermal softening parameters can be determined uniquely and the three parameters present in the strain-hardening term of the Johnson-Cook model cannot be determined uniquely using the inverse method. A combined experimental and numerical approach is proposed to eliminate this determine all parameters uniquely.

42 ENGINEERING↗

Model-Free Primal-Dual Methods for Network Optimization with Application to Real-Time Optimal Power Flow

This paper examines the problem of real-time optimization of networked systems and develops online algorithms that steer the system towards the optimal trajectory without explicit knowledge of the system model. The problem is modeled as a dynamic optimization problem with time-varying performance objectives and engineering constraints. The design of the algorithms leverages the online zero-order primal-dual projected-gradient method. In particular, the primal step that involves the gradient of the objective function (and hence requires a networked systems model) is replaced by its zero-order approximation with two function evaluations using a deterministic perturbation signal. The evaluations are performed using the measurements of the system output, hence giving rise to a feedback interconnection, with the optimization algorithm serving as a feedback controller. The paper provides some insights on the stability and tracking properties of this interconnection. Finally, the paper applies this methodology to a real-time optimal power flow problem in power systems, and shows its efficacy on the IEEE 37-node distribution test feeder for reference power tracking and voltage regulation.

61 RADIATION PROTECTION AND DOSIMETRY↗

Network-Control Algorithm

Algorithm developed for optimal routing of packets of data along links of multilink, multinode digital communication network. Algorithm iterative and converges to cost-optimal assignment independent of initial assignment. Each node connected to other nodes through links, each containing number of two-way channels. Algorithm assigns channels according to message traffic leaving and arriving at each node. Modified to take account of different priorities among packets belonging to different users by using different delay constraints or imposing additional penalties via cost function.

Chan, Hak-Wai↗

Computational Approaches to Simulation and Optimization of Global Aircraft Trajectories

This study examines three possible approaches to improving the speed in generating wind-optimal routes for air traffic at the national or global level. They are: (a) using the resources of a supercomputer, (b) running the computations on multiple commercially available computers and (c) implementing those same algorithms into NASAs Future ATM Concepts Evaluation Tool (FACET) and compares those to a standard implementation run on a single CPU. Wind-optimal aircraft trajectories are computed using global air traffic schedules. The run time and wait time on the supercomputer for trajectory optimization using various numbers of CPUs ranging from 80 to 10,240 units are compared with the total computational time for running the same computation on a single desktop computer and on multiple commercially available computers for potential computational enhancement through parallel processing on the computer clusters. This study also re-implements the trajectory optimization algorithm for further reduction of computational time through algorithm modifications and integrates that with FACET to facilitate the use of the new features which calculate time-optimal routes between worldwide airport pairs in a wind field for use with existing FACET applications. The implementations of trajectory optimization algorithms use MATLAB, Python, and Java programming languages. The performance evaluations are done by comparing their computational efficiencies and based on the potential application of optimized trajectories. The paper shows that in the absence of special privileges on a supercomputer, a cluster of commercially available computers provides a feasible approach for national and global air traffic system studies.

global air traffic optimization↗

Grid Sensitivity and Aerodynamic Optimization of Generic Airfoils

An algorithm is developed to obtain the grid sensitivity with respect to design parameters for aerodynamic optimization. The procedure is advocating a novel (geometrical) parameterization using spline functions such as NURBS (Non-Uniform Rational B- Splines) for defining the airfoil geometry. An interactive algebraic grid generation technique is employed to generate C-type grids around airfoils. The grid sensitivity of the domain with respect to geometric design parameters has been obtained by direct differentiation of the grid equations. A hybrid approach is proposed for more geometrically complex configurations such as a wing or fuselage. The aerodynamic sensitivity coefficients are obtained by direct differentiation of the compressible two-dimensional thin-layer Navier-Stokes equations. An optimization package has been introduced into the algorithm in order to optimize the airfoil surface. Results demonstrate a substantially improved design due to maximized lift/drag ratio of the airfoil.

Sadrehaghighi, Ideen↗