Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimization problems”

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,243 records · Page 69

Investigation on the use of optimization techniques for helicopter airframe vibrations design studies

Results of the investigation of formal nonlinear programming-based numerical optimization techniques of helicopter airframe vibration reduction are summarized. The objective and constraint function and the sensitivity expressions used in the formulation of airframe vibration optimization problems are presented and discussed. Implementation of a new computational procedure based on MSC/NASTRAN and CONMIN in a computer program system called DYNOPT for optimizing airframes subject to strength, frequency, dynamic response, and dynamic stress constraints is described. An optimization methodology is proposed which is thought to provide a new way of applying formal optimization techniques during the various phases of the airframe design process. Numerical results obtained from the application of the DYNOPT optimization code to a helicopter airframe are discussed.

Sreekanta Murthy, T.↗

Mathematical Model of a Regenerative Fuel Cell for System Optimization

This thesis developed a system-level optimization model of a regenerative fuel cell (RFC) system for long-duration, off-world energy storage applications. Prior RFC design studies have typically been limited to reduced parameter sets and simplified constraints due to computational limitations relative to the number of relevant degrees of freedom. As a result, important nonlinear interactions between subsystems have not been fully captured. This work began to address that gap by developing a higher-fidelity, nonlinear optimization framework that incorporates a broader set of design variables and coupled constraints, enabling a multidimensional model that captures the coupled behavior of RFC subsystems and demonstrates the feasibility of applying optimization to such systems. An expanded system-level optimization approach was established that captures interactions between electrochemical performance, structural requirements, and storage design. This enabled a more comprehensive evaluation of trade-offs than conventional formulations. The model integrates four coupled subsystems: a fuel cell, an electrolyzer, reactant gas, and high-pressure storage tanks, and was formulated to accommodate a wide range of mission parameters, including operational time and required output power. It incorporates constraints on available solar array power, reactant mass balance between production and consumption, and pressure-dependent storage requirements. To enable reliable convergence, the optimization problem was reformulated to reduce dimensionality and improve numerical stability, with subsystem models organized for efficient evaluation. Problem dimensionality was reduced by consolidating lower-level design variables into higher-level representative quantities, and subsystem behavior was evaluated within the optimization loop. A multi-start initialization strategy was employed to mitigate sensitivity to local minima and improve solution quality, while nonlinear relationships were solved using robust numerical methods. The results showed that convergence was achieved across a range of required output power values. Specific energy reached a maximum at a critical mission power level, where the electrolyzer power matched the available solar input and operated near its voltage and current density limits. Beyond this point, further increases in required power resulted in less mass-efficient operation, increasing total system mass and reducing overall performance. The developed model represents an advancement in RFC system-level optimization by enabling analysis of a broader and more tightly coupled design space than previous considerations. While convergence behavior and computational cost remain challenges, the methods introduced improve solvability and allow inclusion of additional design variables with minimal loss of physical fidelity. However, the numerical results should not be interpreted as definitive design recommendations, as the model includes simplifying assumptions and omits several higher-order effects. Future work should extend this framework by incorporating additional subsystems and loss mechanisms, such as thermal management, parasitic power consumption, and reactant losses, to improve fidelity and ensure more representative design conclusions.

Electrochemistry↗

On the use of genetic algorithm to optimize industrial assets lifecycle management under safety and budget constraints

The purpose of this paper is to describe the method and tool dedicated to optimize investments planning for industrial assets. These investments may either be preventive maintenance tasks, asset enhancements or logistic investments such as spare parts purchases. The two methodological points to investigate in such an issue are: 1. The measure of the profitability of a portfolio of investments 2. The selection and planning of an optimal set of investments 3. The measure of the risk of a portfolio of investments The measure of the profitability of a set of investments in the IPOP tool is synthesised in the Net Present Value indicator. The NPV is the sum of the differences of discounted cash flows (direct costs, forced outages...) between the situations with and without a given investment. These cash flows are calculated through a pseudo-Markov reliability model representing independently the components of the industrial asset and the spare parts inventories. The component model has been widely discussed over the years but the spare part model is a new one based on some approximations that will be discussed. This model, referred as the NPV function, takes for input an investments portfolio and gives its NPV. The second issue is to optimize the NPV. If all investments were independent, this optimization would be an easy calculation, unfortunately there are two sources of dependency. The first one is introduced by the spare part model, as if components are indeed independent in their reliability model, the fact that several components use the same inventory induces a dependency. The second dependency comes from economic, technical or logistic constraints, such as a global maintenance budget limit or a safety requirement limiting the residual risk of failure of a component or group of component, making the aggregation of individual optimum not necessary feasible. The algorithm used to solve such a difficult optimization problem is a genetic algorithm. After a description of the features of the software a test case is presented showing the influence of the optimization algorithm parameters on its efficiency to find an optimal investments planning. (authors)

97 MATHEMATICS AND COMPUTING↗

Genetic Evolution of Shape-Altering Programs for Supersonic Aerodynamics

Two constrained shape optimization problems relevant to aerodynamics are solved by genetic programming, in which a population of computer programs evolves automatically under pressure of fitness-driven reproduction and genetic crossover. Known optimal solutions are recovered using a small, naive set of elementary operations. Effectiveness is improved through use of automatically defined functions, especially when one of them is capable of a variable number of iterations, even though the test problems lack obvious exploitable regularities. An attempt at evolving new elementary operations was only partially successful.

Kennelly, Robert A., Jr.↗

Computationally Efficient Motion Planning Algorithms for Agile Autonomous Vehicles in Cluttered Environments

Fast, real-time motion planning of an agile, autonomous vehicle in a cluttered environment, with many geometrically-fixed obstacles, is a very complex problem, especially because of the vehicle dynamics constraints and resource constrained computational capabilities onboard the vehicle. In this paper, we present computationally-efficient versions of our novel motion planning algorithm called the Spherical Expansion and Sequential Convex Programming (SE–SCP) algorithm. The SE–SCP algorithm first uses a spherical-expansion-based randomized sampling algorithm to explore the workspace. Oncea path is found from the start position to the goal position, the algorithm computes a locally optimal trajectory, within its homotopy class for a desired cost function, by solving a sequence of convex optimization problems. Thus, the SE–SCP algorithm is anytime locally optimal and the trajectory is globally optimal if the number of samples tends to infinity. In this paper, we further enhance the computational efficiency of the SE–SCP algorithm using uni-directional and bi-directional rewiring techniques. We also present a detailed proof of the local optimality characteristics of the new SE–SCP algorithms for aspecial case of vehicle dynamics. Simulation examples involving quadrotor and spacecraft help demonstrate the effectiveness of our new algorithms.

Bandyopadhyay, Saptarshi↗

Optimal Control of the Obstacle Problem in a Perforated Domain

We study the problem of optimally controlling the solution of the obstacle problem in a domain perforated by small periodically distributed holes. The solution is controlled by the choice of a perforated obstacle which is to be chosen in such a fashion that the solution is close to a given profile and the obstacle is not too irregular. We prove existence, uniqueness and stability of an optimal obstacle and derive necessary and sufficient conditions for optimality. When the number of holes increase indefinitely we determine the limit of the sequence of optimal obstacles and solutions. This limit depends strongly on the rate at which the size of the holes shrink.

97 MATHEMATICS AND COMPUTING↗

The computation of optimal control programmes using a modified successive sweep method.

A second-order method for numerically solving control optimization problems has been developed. The method, referred to as the modified sweep method (MSM), differs from the successive sweep method (SSM) proposed by McReynolds and Bryson (1965) in that the conditions for local control optimality are used to determine the control as an explicit function of the state variables and time. The control is eliminated from the problem and the solution to the resulting two-point boundary value problem can be obtained by linear perturbation methods. The modified sweep method proposed here uncouples the perturbation equations for the state variables and the Lagrange multipliers by using a generalized matrix-Riccati transformation of variables. The resulting algorithm for the numerical iteration process is concerned with determining the initial values of a set of Lagrange multipliers rather than correcting a numerical control programme over the entire time interval of interest.

Colunga, D.↗

Shape and Topology Optimization in Stokes Flow with a Phase Field Approach

In this paper we introduce a new formulation for shape optimization problems in fluids in a diffuse interface setting that can in particular handle topological changes. By adding the Ginzburg–Landau energy as a regularization to the objective functional and relaxing the non-permeability outside the fluid region by introducing a porous medium approach we hence obtain a phase field problem where the existence of a minimizer can be guaranteed. This problem is additionally related to a sharp interface problem, where the permeability of the non-fluid region is zero. In both the sharp and the diffuse interface setting we can derive necessary optimality conditions using only the natural regularity of the minimizers. We also pass to the limit in the first order conditions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

pnnl/Pathway_Controlled_Optimization

A method for prediction of cell regulation to maximize cell growth rate while maintaining the solvent capacity of the cell. Prediction is formulated as an optimization problem using a thermodynamic framework that can leverage experimental data. We develop a formulation and variable initialization procedure that allows for computing solutions of the optimization with an interior point method

Central, PNNL Developer↗

Q-OPT:Quantum Optimization Toolkit

SF-2025-003 Quantum computing has the potential to solve classical optimization problems. To bring these algorithms into practical use, a comprehensive, high-performance and user-friendly toolkit is essential. The Q-OPT: Quantum Optimization Toolkit is a collection of software tools designed to support complete end-to-end framework for quantum optimization.

Hovland, Paul [Argonne National Laboratory (ANL), ↗

Miniaturized Air-to-Refrigerant Heat Exchangers

Air-to-refrigerant Heat eXchangers (HX) are an essential component of Heating, Ventilation, Air-Conditioning, and Refrigeration (HVAC&R) systems, serving as the main heat transfer component. The major limiting factor to HX performance is the large airside thermal resistance. Recent literature aims at improving heat transfer performance by utilizing enhancement methods such as fins and small tube diameters; this has lead to almost exhaustive research on the microchannel HX (MCHX). The objective of this project is to develop a miniaturized air-to-refrigerant HX with at least 20% reduction in volume, material volume, and approach temperature compared to current state-of-the-art multiport flat tube designs and also be capable of production within five years. Moreover, the proposed HX’s are expected to have good water drainage and should succeed in both evaporator and condenser applications. The project leveraged Parallel-Parametrized Computational Fluid Dynamics (PPCFD) and Approximation-Assisted Optimization (AAO) techniques to perform multi-scale analysis and shape optimization with the intent of developing novel HX designs whose thermal-hydraulic performance exceeds that of state-of-the-art MCHX. Nine heat exchanger geometries were initially chosen for detailed analysis, selected from 35+ geometries which were identified in previous work at the University of Maryland, College Park. The newly developed optimization framework was exercised for three design optimization problems: (DP I) 1.0kW radiator, (DP II) 10kW radiator and (DP III) 10kW two-phase HX. DP I consisted of the design and optimization of 1.0kW air-to-water HX’s which exceeded the project requirements of 20% volume/material reduction and 20% better performance. Two prototypes for the 1.0kW HX were prototyped, tested and validated using newly-designed airside and refrigerant side test facilities. DP II, a scaled version DP I for 10kW air-to-water HX applications, also yielded optimized HX designs which met project requirements. Attempts to prototype a 10kW have presented unique manufacturing challenges, especially regarding tube blockages and structural stability. DP III comprised optimizing two-phase HX’s for a 3.0Ton capacity in a heat pump / air-conditioning unit for cooling mode application using R410A as the working fluid. The HX’s theoretically address the project requirements. System-level analysis showed the HX’s achieved up to 15% improvement in COP while also reducing overall unit charge by 30-40%. The project methodology was capable of developing HX’s which can outperform current state-of-the-art MCHX by at least 20% reduction in volume, material volume, and approach temperature. Additionally, the capability for optimization using refrigerant charge as an objective function was developed. The five-year manufacturing feasibility of the proposed HX’s was shown to have a good outlook. Successful prototyping through both conventional manufacturing methods and next generation methods such as additive manufacturing was achieved.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Best Practices for Wake Model and Optimization Algorithm Selection in Wind Farm Layout Optimization

This paper presents the results of two case studies regarding the wind farm layout optimization problem. We asked a general audience to take part in the studies that we designed, and nine individuals participated. Case study 1 considered variations in optimization strategies for a given simple Gaussian wake model. Participants were provided with a wake model that outputs annual energy production (AEP) for an input set of wind turbine locations. Participants used an optimization method of their choosing to find an optimal wind farm layout. Case study 2 looked at trade-offs in performance resulting from variation in both physics model and optimization strategy. For case study 2, participants calculated AEP using a wake model of their choice while also implementing their chosen optimization method. Participants then used their wake model to calculate the AEP all other participant submitted turbine configurations produce for cross-comparison results. for optimized turbine locations were then cross-compared by recalculating the AEP using every other participant's wake model. Results for case study 1 show that the best optimal wind farm layouts in this study were achieved by participants who used gradient-based optimization methods. A front-runner emerged with the Sparse Nonlinear OPTimizer plus Wake Expansion Continuation (SNOPTplusWEC) optimization method, which consistently discovered a higher AEP for each scenario. Results for case study 2 show that for small wind farms with few turbines, turbine placement on the wind farm boundary is superior. Conclusions for case study 2 were drawn from participant cross-comparison of results.

17 WIND ENERGY↗

Best Practices for Wake Model and Optimization Algorithm Selection in Wind Farm Layout Optimization: Preprint

This paper presents the results of two case studies regarding the wind farm layout optimization problem. We asked a general audience to take part in the studies that we designed, and nine individuals participated. Case study 1 considered variations in optimization strategies for a given simple Gaussian wake model. Participants were provided with a wake model that outputs annual energy production (AEP) for an input set of wind turbine locations. Participants used an optimization method of their choosing to find an optimal wind farm layout. Case study 2 looked at trade-offs in performance resulting from variation in both physics model and optimization strategy. For case study 2, participants calculated AEP using a wake model of their choice while also implementing their chosen optimization method. Participants then used their wake model to calculate the AEP all other participant submitted turbine configurations produce for cross-comparison results. for optimized turbine locations were then cross-compared by recalculating the AEP using every other participant's wake model. Results for case study 1 show that the best optimal wind farm layouts in this study were achieved by participants who used gradient-based optimization methods. A front-runner emerged with the Sparse Nonlinear OPTimizer plus Wake Expansion Continuation (SNOPTplusWEC) optimization method, which consistently discovered a higher AEP for each scenario. Results for case study 2 show that for small wind farms with few turbines, turbine placement on the wind farm boundary is superior. Conclusions for case study 2 were drawn from participant cross-comparison of results.

17 WIND ENERGY↗

An approach to learn regulation to maximize growth and entropy production rates in metabolism

Elucidating cell regulation remains a challenging task due to the complexity of metabolism and the difficulty of experimental measurements. Here we present a method for prediction of cell regulation to maximize cell growth rate while maintaining the solvent capacity of the cell. Prediction is formulated as an optimization problem using a thermodynamic framework that can leverage experimental data. We develop a formulation and variable initialization procedure that allows for computing solutions of the optimization with an interior point method. The approach is applied to photoheterotrophic growth of Rhodospirilium rubrum using ethanol as a carbon source, which has applications to biosynthesis of ethylene production. Growth is captured as the rate of synthesis of amino acids into proteins, and synthesis of nucleotide triphoshaptes into RNA and DNA. The method predicts regulation that produces a high rate of protein and RNA synthesis while DNA synthesis is reduced close to zero in agreement with production of DNA being turned off for much of the cell cycle.

59 BASIC BIOLOGICAL SCIENCES↗

Real time trajectory optimization for hybrid energy management utilizing connected information technologies

The disclosure is directed to solving a full trajectory optimization problem in real-time for a hybrid electric vehicle (HEV) such that future driving conditions and energy usage may be fully considered in determining optimal engine energy usage and battery energy usage in real-time during a trip. An electronic control unit of the HEV may be configured to: receive route information for a route to be driven by the HEV; and after receiving the route information, iterating the operations of: measuring a current state of charge (SOC) of the battery; using at least the measured SOC and an initial co-state value stored in a memory, performing a process to iteratively update the co-state value to obtain an updated co-state value; using at least the updated co-state value, computing an updated control value; and applying the updated control value to control a usage of the battery and the internal combustion engine.

Huang, Mike X.↗

Two-Stage Reinforcement Learning Policy Search for Grid-Interactive Building Control

This paper develops an intelligent grid-interactive building controller, which optimizes building operation during both normal hours and demand response (DR) events. To avoid costly on-demand computation and to adapt to non-linear building models, the controller utilizes reinforcement learning (RL) and makes real-time decisions based on a near-optimal control policy. Learning such a policy typically amounts to solving a hard non-convex optimization problem. We propose to address this problem with a novel global-local policy search method. In the first stage, an RL algorithm based on zero-order gradient estimation is leveraged to search for the optimal policy globally, due to its scalability and the potential to escape some poor performing local optima. The obtained policy is then fine-tuned locally to bring the first-stage solution closer to that of the original unsmoothed problem. Experiments on a simulated five-zone commercial building demonstrate the advantages of the proposed method over existing learning approaches. They also show that the learned control policy outperforms a pragmatic linear model predictive controller (MPC) and approaches the performance of an oracle MPC in testing scenarios. Using a state-of-the-art advanced computing system, we demonstrate that the controller can be learned and deployed within hours of training.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

A new mathematical approach to finding global solutions of the magnetic structure determination problem

Abstract Determination of magnetic structure is an important analytical procedure utilized in various fields ranging from fundamental condensed-matter physics and chemistry to advanced manufacturing. It is typically performed using a neutron diffraction technique; however, finding global solutions of the magnetic structure optimization problem represents a significant challenge. Generally, it is not possible to mathematically prove that the obtained magnetic structure is a truly global solution and that no solution exists when no acceptable structure is found. In this study, the global optimization technique called semidefinite relaxation of quadratic optimization, which has attracted much interest in the field of applied mathematics, is proposed to use as a new analytical method for the determination of magnetic structure, followed by the application of polarized neutron diffraction data. This mathematical approach allows avoiding spurious local solutions, decreasing the amount of time required to find a tentative solution and finding multiple solutions when they exist.

97 MATHEMATICS AND COMPUTING↗