Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimization algorithm”

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 703 records · Page 39

Testing of Strategies for the Acceleration of the Cost Optimization

The general problem addressed in the Nuclear-Renewable Hybrid Energy System (N-R HES) project is finding the optimum economical dispatch (ED) and capacity planning solutions for the hybrid energy systems. In the present test-problem configuration, the N-R HES unit is composed of three electrical power-generating components, i.e. the Balance of Plant (BOP), the Secondary Energy Source (SES), and the Energy Storage (ES). In addition, there is an Industrial Process (IP), which is devoted to hydrogen generation. At this preliminary stage, the goal is to find the power outputs of each one of the N-R HES unit components (BOP, SES, ES) and the IP hydrogen production level that maximizes the unit profit by simultaneously satisfying individual component operational constraints. The optimization problem is meant to be solved in the Risk Analysis Virtual Environment (RAVEN) framework. The dynamic response of the N-R HES unit components is simulated by using dedicated object-oriented models written in the Modelica modeling language. Though this code coupling provides for very accurate predictions, the ensuing optimization problem is characterized by a very large number of solution variables. To ease the computational burden and to improve the path to a converged solution, a method to better estimate the initial guess for the optimization problem solution was developed. The proposed approach led to the definition of a suitable Monte Carlo-based optimization algorithm (called the preconditioner), which provides an initial guess for the optimal N-R HES power dispatch and the optimal installed capacity for each one of the unit components. The preconditioner samples a set of stochastic power scenarios for each one of the N-R HES unit components, and then for each of them the corresponding value of a suitably defined cost function is evaluated. After having simulated a sufficient number of power histories, the configuration which ensures the highest profit is selected as the optimal one. The component physical dynamics are represented through suitable ramp constraints, which considerably simplify the numerical solving. In order to test the capabilities of the proposed approach, in the present report, the dispatch problem only is tackled, i.e. a reference unit configuration is assumed, and each one of the N-R HES unit components is assumed to have a fixed installed capacity. As for the next steps, the main improvement will concern the operation strategy of the ES facility. In particular, in order to describe a more realistic battery commitment strategy, the ES operation will be regulated according to the electricity price forecasts.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Mass Optimization of Power System for Space Applications

A Brayton cycle coupled to a direct cooled nuclear reactor is being designed and optimized for a space surface power application. Robust models for the various Brayton cycle components were developed and integrated. Separately, a nuclear reactor model which provides an optimized reactor mass for given flow conditions was developed. Then mass correlations for the size of the recuperative heat exchanger and radiator panel, along with the reactor mass model, were integrated with the cycle model, and an optimization algorithm was developed to find the least massive power system. The optimization routine is being used to explore the effects of turbine inlet temperature, cycle pressures, and other various cycle parameters on the full system mass.

Sondelski, Becky↗

Microwave Cavity Simulation Using Ansys HFSS

The design of microwave cavity detectors for axion dark matter research is often accomplished using advanced full-wave electromagnetic simulation software tools. These tools provide a cost-effective approach to evaluate a wide variety of cavity configurations, frequency tuning mechanisms, and conductive or dielectric materials and coatings. One simulation software package used for this application is Ansys High Frequency Structure Simulator (HFSS), which is based upon the well-established finite element method. HFSS includes numerous features useful for microwave cavity design such as parametric geometry modeling, adaptive meshing algorithm, curvilinear mesh elements, driven modal and eigenmode matrix solvers, and optimization algorithms. This paper describes the use of the HFSS software to simulate microwave cavities for axion haloscope detectors, with an example tutorial for a cylindrical cavity. Excellent agreement between the simulated and analytical results is shown for the resonant frequency, quality factor, and form factor.

Ansys HFSS, Cavity simulation, finite element mode↗

Distributionally Robust Variational Quantum Algorithms With Shifted Noise

Given their potential to demonstrate near-term quantum advantage, variational quantum algorithms (VQAs) have been extensively studied. Although numerous techniques have been developed for VQA parameter optimization, it remains a significant challenge. A practical issue is the high sensitivity of quantum noise to environmental changes, and its propensity to shift in real time. This presents a critical problem as an optimized VQA ansatz may not perform effectively under a different noise environment. For the first time, we explore how to optimize VQA parameters to be robust against unknown shifted noise. We model the noise level as a random variable with an unknown probability density function (PDF), and we assume that the PDF may shift within an uncertainty set. This assumption guides us to formulate a distributionally robust optimization problem, with the goal of finding parameters that maintain effectiveness under shifted noise. We utilize a distributionally robust Bayesian optimization solver for our proposed formulation. This provides numerical evidence in both the Quantum Approximate Optimization Algorithm (QAOA) and the Variational Quantum Eigensolver (VQE) with hardware-efficient ansatz, indicating that we can identify parameters that perform more robustly under shifted noise. We regard this work as the first step towards improving the reliability of VQAs influenced by real-time noise.

97 MATHEMATICS AND COMPUTING↗

Direct handling of equality constraints in multilevel optimization

In recent years there have been several hierarchic multilevel optimization algorithms proposed and implemented in design studies. Equality constraints are often imposed between levels in these multilevel optimizations to maintain system and subsystem variable continuity. Equality constraints of this nature will be referred to as coupling equality constraints. In many implementation studies these coupling equality constraints have been handled indirectly. This indirect handling has been accomplished using the coupling equality constraints' explicit functional relations to eliminate design variables (generally at the subsystem level), with the resulting optimization taking place in a reduced design space. In one multilevel optimization study where the coupling equality constraints were handled directly, the researchers encountered numerical difficulties which prevented their multilevel optimization from reaching the same minimum found in conventional single level solutions. The researchers did not explain the exact nature of the numerical difficulties other than to associate them with the direct handling of the coupling equality constraints. The coupling equality constraints are handled directly, by employing the Generalized Reduced Gradient (GRG) method as the optimizer within a multilevel linear decomposition scheme based on the Sobieski hierarchic algorithm. Two engineering design examples are solved using this approach. The results show that the direct handling of coupling equality constraints in a multilevel optimization does not introduce any problems when the GRG method is employed as the internal optimizer. The optimums achieved are comparable to those achieved in single level solutions and in multilevel studies where the equality constraints have been handled indirectly.

Renaud, John E.↗

Bootstrap performance profiles in stochastic algorithms assessment

Optimization with stochastic algorithms has become a relevant research field. Due to its stochastic nature, its assessment is not straightforward and involves integrating accuracy and precision. Performance profiles for the mean do not show the trade-off between accuracy and precision, and parametric stochastic profiles require strong distributional assumptions and are limited to the mean performance for a large number of runs. In this work, bootstrap performance profiles are used to compare stochastic algorithms for different statistics. This technique allows the estimation of the sampling distribution of almost any statistic even with small samples. Multiple comparison profiles are presented for more than two algorithms. The advantages and drawbacks of each assessment methodology are discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Flight assessment of the onboard propulsion system model for the Performance Seeking Control algorithm on an F-15 aircraft

Performance Seeking Control (PSC), an onboard, adaptive, real-time optimization algorithm, relies upon an onboard propulsion system model. Flight results illustrated propulsion system performance improvements as calculated by the model. These improvements were subject to uncertainty arising from modeling error. Thus to quantify uncertainty in the PSC performance improvements, modeling accuracy must be assessed. A flight test approach to verify PSC-predicted increases in thrust (FNP) and absolute levels of fan stall margin is developed and applied to flight test data. Application of the excess thrust technique shows that increases of FNP agree to within 3 percent of full-scale measurements for most conditions. Accuracy to these levels is significant because uncertainty bands may now be applied to the performance improvements provided by PSC. Assessment of PSC fan stall margin modeling accuracy was completed with analysis of in-flight stall tests. Results indicate that the model overestimates the stall margin by between 5 to 10 percent. Because PSC achieves performance gains by using available stall margin, this overestimation may represent performance improvements to be recovered with increased modeling accuracy. Assessment of thrust and stall margin modeling accuracy provides a critical piece for a comprehensive understanding of PSC's capabilities and limitations.

Orme, John S.↗

A homotopy algorithm for digital optimal projection control GASD-HADOC

The linear-quadratic-gaussian (LQG) compensator was developed to facilitate the design of control laws for multi-input, multi-output (MIMO) systems. The compensator is computed by solving two algebraic equations for which standard closed-loop solutions exist. Unfortunately, the minimal dimension of an LQG compensator is almost always equal to the dimension of the plant and can thus often violate practical implementation constraints on controller order. This deficiency is especially highlighted when considering control-design for high-order systems such as flexible space structures. This deficiency motivated the development of techniques that enable the design of optimal controllers whose dimension is less than that of the design plant. A homotopy approach based on the optimal projection equations that characterize the necessary conditions for optimal reduced-order control. Homotopy algorithms have global convergence properties and hence do not require that the initializing reduced-order controller be close to the optimal reduced-order controller to guarantee convergence. However, the homotopy algorithm previously developed for solving the optimal projection equations has sublinear convergence properties and the convergence slows at higher authority levels and may fail. A new homotopy algorithm for synthesizing optimal reduced-order controllers for discrete-time systems is described. Unlike the previous homotopy approach, the new algorithm is a gradient-based, parameter optimization formulation and was implemented in MATLAB. The results reported may offer the foundation for a reliable approach to optimal, reduced-order controller design.

Collins, Emmanuel G., Jr.↗

Integration of ab-initio nuclear calculation with derivative free optimization technique

Optimization techniques are finding their inroads into the field of nuclear physics calculations where the objective functions are very complex and computationally intensive. A vast space of parameters needs searching to obtain a good match between theoretical (computed) and experimental observables, such as energy levels and spectra. Manual calculation defies the scope of such complex calculation and are prone to error at the same time. This body of work attempts to formulate a design and implement it which would integrate the ab initio nuclear physics code MFDn and the VTDIRECT95 code. VTDIRECT95 is a Fortran95 suite of parallel code implementing the derivative-free optimization algorithm DIRECT. Proposed design is implemented for a serial and parallel version of the optimization technique. Experiment with the initial implementation of the design showing good matches for several single-nucleus cases are conducted. Determination and assignment of appropriate number of processors for parallel integration code is implemented to increase the efficiency and resource utilization in the case of multiple nuclei parameter search.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

THE APPLICATION OF AN EVOLUTIONARY ALGORITHM TO THE OPTIMIZATION OF A MESOSCALE METEOROLOGICAL MODEL

We show that a simple evolutionary algorithm can optimize a set of mesoscale atmospheric model parameters with respect to agreement between the mesoscale simulation and a limited set of synthetic observations. This is illustrated using the Regional Atmospheric Modeling System (RAMS). A set of 23 RAMS parameters is optimized by minimizing a cost function based on the root mean square (rms) error between the RAMS simulation and synthetic data (observations derived from a separate RAMS simulation). We find that the optimization can be efficient with relatively modest computer resources, thus operational implementation is possible. The optimization efficiency, however, is found to depend strongly on the procedure used to perturb the 'child' parameters relative to their 'parents' within the evolutionary algorithm. In addition, the meteorological variables included in the rms error and their weighting are found to be an important factor with respect to finding the global optimum.

54 ENVIRONMENTAL SCIENCES↗

Application of the Differential Evolution Method to Solving Inverse Transport Problems

The differential evolution method, a powerful stochastic optimization algorithm that mimics the process of evolution in nature, is applied to inverse transport problems with several unknown parameters of mixed types, including interface location identification, source composition identification, and material mass density identification, in spherical and cylindrical radioactive source/shield systems. In spherical systems, measurements of leakages of discrete gamma-ray lines are assumed, while in cylindrical systems, measurements of scalar fluxes of discrete lines at points outside the system are assumed. The performance of the differential evolution algorithm is compared to the Levenberg-Marquardt method, a standard gradient-based technique, and the covariance matrix adaptation evolution strategy, another stochastic technique, on a variety of numerical test problems with several (i.e., three or more) unknown parameters. Numerical results indicate that differential evolution is the most adept method for finding the global optimum for these problems. In spherical geometry, differential evolution implemented serially is run-time competitive with gradient-based methods, while a parallel version of differential evolution would be run-time competitive with gradient-based techniques in cylindrical geometry. A hybrid differential evolution/Levenberg-Marquardt method is also introduced, and numerical results indicate that it can be a fast and robust optimizer for inverse transport problems.

99 GENERAL AND MISCELLANEOUS↗

Comparison of polynomial approximations and artificial neural nets for response surfaces in engineering optimization

Engineering optimization problems involve minimizing some function subject to constraints. In areas such as aircraft optimization, the constraint equations may be from numerous disciplines such as transfer of information between these disciplines and the optimization algorithm. They are also suited to problems which may require numerous re-optimizations such as in multi-objective function optimization or to problems where the design space contains numerous local minima, thus requiring repeated optimizations from different initial designs. Their use has been limited, however, by the fact that development of response surfaces randomly selected or preselected points in the design space. Thus, they have been thought to be inefficient compared to algorithms to the optimum solution. A development has taken place in the last several years which may effect the desirability of using response surfaces. It may be possible that artificial neural nets are more efficient in developing response surfaces than polynomial approximations which have been used in the past. This development is the concern of the work.

Carpenter, William C.↗

Solving a system of linear equations: From centralized to distributed methods

For a wide range of control engineering applications, the problem of solving a system of linear equations is often encountered and has been well studied. Traditionally, this problem has been mainly solved in a centralized manner. However, for applications related to large-scale complex networked systems, centralized algorithms are often subjected to some practical issues due to limited computational power and communication bandwidth. As a promising and viable alternative, distributed algorithms can effectively address the issues associated with centralized algorithms by solving the problem efficiently in a multi-agent setting that accords with the distributed nature of networked systems. Distributed algorithms decompose the entire problem into many sub-problems that are solved by individual agents in a cooperative manner. In this survey paper, we provide a detailed overview of the state of the art relevant to distributed algorithms for solving a system of linear equations. We will first review basic distributed algorithms including both discrete-time and continuous-time algorithms. Then we will discuss the extended algorithms to achieve communication efficiency. Furthermore, we will also introduce distributed algorithms to obtain the minimum-norm solution for a system of linear equations with multiple solutions, as well as the least-squares solutions when there is no solution. Finally, the relationship of distributed algorithms for solving a system of linear equations to the existing distributed optimization algorithms is discussed.

Wang, Peng↗

Optimal environmental and economic performance trade-offs for fifth generation district heating and cooling network topologies with waste heat recovery

Network topology greatly influences both the economic and environmental performance of fifth generation district heating and cooling (5GDHC) systems. In this study the optimal trade-offs between the environmental and economic performance of 5GDHC network topologies for a five-building district with waste heat recovery were explored. A life cycle assessment method was used to calculate the total life cycle CO 2 emissions (LCCO2) associated with the installation and operation of various network topologies. Twelve months of empirical data from a data center cooling system were analyzed to assess its suitability for integration into a 5GDHC system. The most suitable method for utilizing this waste heat was selected based on the ambient loop warm pipe setpoint, waste heat temperature, and district energy system configuration. A multi-objective optimization algorithm was used to select the 5GDHC network topology that provided the optimal trade-off between LCCO2 and life cycle cost (LCC). A trade-off parameter was employed to weigh the importance of each objective in the selection process. The results showed waste heat from the data center was suitable for integration into the 5GDHC system due to its availability and consistent temperature profile. When return temperatures of 25 °C or higher were available from the liquid-cooled system, direct pre-heating of the ambient loop warm pipe was found to be the most effective waste heat integration method. The selection of the network topology that provided the optimal trade-off between LCCO2 and LCC (optimal trade-off topology) was highly dependent on factors such as fuel prices, CO 2 prices, electricity CO 2 emissions factors, availability of waste heat, embodied CO 2 emissions associated with network installation and network infrastructure costs. Optimal trade-off topologies produced substantial LCCO2 reductions relative to corresponding LCC increases. LCCO2 reduction to LCC increase ratios from 5.78 to 117.79 were identified with CO 2 offset costs ranging from 4.77 to 60.08 ($/tCO 2 e).

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Identifying Optimal Measurement Subspace for the Ensemble Kalman Filter

To reduce the computational load of the ensemble Kalman filter while maintaining its efficacy, an optimization algorithm based on the generalized eigenvalue decomposition method is proposed for identifying the most informative measurement subspace. When the number of measurements is large, the proposed algorithm can be used to make an effective tradeoff between computational complexity and estimation accuracy. This algorithm also can be extended to other Kalman filters for measurement subspace selection.

99 GENERAL AND MISCELLANEOUS↗

Computing single step operators of logic programming in radial basis function neural networks

Logic programming is the process that leads from an original formulation of a computing problem to executable programs. A normal logic program consists of a finite set of clauses. A valuation I of logic programming is a mapping from ground atoms to false or true. The single step operator of any logic programming is defined as a function (T{sub p}:I→I). Logic programming is well-suited to building the artificial intelligence systems. In this study, we established a new technique to compute the single step operators of logic programming in the radial basis function neural networks. To do that, we proposed a new technique to generate the training data sets of single step operators. The training data sets are used to build the neural networks. We used the recurrent radial basis function neural networks to get to the steady state (the fixed point of the operators). To improve the performance of the neural networks, we used the particle swarm optimization algorithm to train the networks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SU-F-E-09: Respiratory Signal Prediction Based On Multi-Layer Perceptron Neural Network Using Adjustable Training Samples

Purpose: Dynamic tracking of moving organs, such as lung and liver tumors, under radiation therapy requires prediction of organ motions prior to delivery. The shift of moving organ may change a lot due to huge transform of respiration at different periods. This study aims to reduce the influence of that changes using adjustable training signals and multi-layer perceptron neural network (ASMLP). Methods: Respiratory signals obtained using a Real-time Position Management(RPM) device were used for this study. The ASMLP uses two multi-layer perceptron neural networks(MLPs) to infer respiration position alternately and the training sample will be updated with time. Firstly, a Savitzky-Golay finite impulse response smoothing filter was established to smooth the respiratory signal. Secondly, two same MLPs were developed to estimate respiratory position from its previous positions separately. Weights and thresholds were updated to minimize network errors according to Leverberg-Marquart optimization algorithm through backward propagation method. Finally, MLP 1 was used to predict 120∼150s respiration position using 0∼120s training signals. At the same time, MLP 2 was trained using 30∼150s training signals. Then MLP is used to predict 150∼180s training signals according to 30∼150s training signals. The respiration position is predicted as this way until it was finished. Results: In this experiment, the two methods were used to predict 2.5 minute respiratory signals. For predicting 1s ahead of response time, correlation coefficient was improved from 0.8250(MLP method) to 0.8856(ASMLP method). Besides, a 30% improvement of mean absolute error between MLP(0.1798 on average) and ASMLP(0.1267 on average) was achieved. For predicting 2s ahead of response time, correlation coefficient was improved from 0.61415 to 0.7098.Mean absolute error of MLP method(0.3111 on average) was reduced by 35% using ASMLP method(0.2020 on average). Conclusion: The preliminary results demonstrate that the ASMLP respiratory prediction method is more accurate than MLP method and can improve the respiration forecast accuracy.

60 APPLIED LIFE SCIENCES↗