Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimality”

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 793 records · Page 44

Image Correlation Pattern Optimization for Micro-Scale In-Situ Strain Measurements

The accuracy and precision of digital image correlation (DIC) is a function of three primary ingredients: image acquisition, image analysis, and the subject of the image. Development of the first two (i.e. image acquisition techniques and image correlation algorithms) has led to widespread use of DIC; however, fewer developments have been focused on the third ingredient. Typically, subjects of DIC images are mechanical specimens with either a natural surface pattern or a pattern applied to the surface. Research in the area of DIC patterns has primarily been aimed at identifying which surface patterns are best suited for DIC, by comparing patterns to each other. Because the easiest and most widespread methods of applying patterns have a high degree of randomness associated with them (e.g., airbrush, spray paint, particle decoration, etc.), less effort has been spent on exact construction of ideal patterns. With the development of patterning techniques such as microstamping and lithography, patterns can be applied to a specimen pixel by pixel from a patterned image. In these cases, especially because the patterns are reused many times, an optimal pattern is sought such that error introduced into DIC from the pattern is minimized. DIC consists of tracking the motion of an array of nodes from a reference image to a deformed image. Every pixel in the images has an associated intensity (grayscale) value, with discretization depending on the bit depth of the image. Because individual pixel matching by intensity value yields a non-unique scale-dependent problem, subsets around each node are used for identification. A correlation criteria is used to find the best match of a particular subset of a reference image within a deformed image. The reader is referred to references for enumerations of typical correlation criteria. As illustrated by Schreier and Sutton and Lu and Cary systematic errors can be introduced by representing the underlying deformation with under-matched shape functions. An important implication, as discussed by Sutton et al., is that in the presence of highly localized deformations (e.g., crack fronts), error can be reduced by minimizing the subset size. In other words, smaller subsets allow the more accurate resolution of localized deformations. Contrarily, the choice of optimal subset size has been widely studied and a general consensus is that larger subsets with more information content are less prone to random error. Thus, an optimal subset size balances the systematic error from under matched deformations with random error from measurement noise. The alternative approach pursued in the current work is to choose a small subset size and optimize the information content within (i.e., optimizing an applied DIC pattern), rather than finding an optimal subset size. In the literature, many pattern quality metrics have been proposed, e.g., sum of square intensity gradient (SSSIG), mean subset fluctuation, gray level co-occurrence, autocorrelation-based metrics, and speckle-based metrics. The majority of these metrics were developed to quantify the quality of common pseudo-random patterns after they have been applied, and were not created with the intent of pattern generation. As such, it is found that none of the metrics examined in this study are fit to be the objective function of a pattern generation optimization. In some cases, such as with speckle-based metrics, application to pixel by pixel patterns is ill-conditioned and requires somewhat arbitrary extensions. In other cases, such as with the SSSIG, it is shown that trivial solutions exist for the optimum of the metric which are ill-suited for DIC (such as a checkerboard pattern). In the current work, a multi-metric optimization method is proposed whereby quality is viewed as a combination of individual quality metrics. Specifically, SSSIG and two auto-correlation metrics are used which have generally competitive objectives. Thus, each metric could be viewed as a constraint imposed upon the others, thereby precluding the achievement of their trivial solutions. In this way, optimization produces a pattern which balances the benefits of multiple quality metrics. The resulting pattern, along with randomly generated patterns, is subjected to numerical deformations and analyzed with DIC software. The optimal pattern is shown to outperform randomly generated patterns.

Bomarito, G. F.↗

Uncertainty Aware Structural Topology Optimization Via a Stochastic Reduced Order Model Approach

This work presents a stochastic reduced order modeling strategy for the quantification and propagation of uncertainties in topology optimization. Uncertainty aware optimization problems can be computationally complex due to the substantial number of model evaluations that are necessary to accurately quantify and propagate uncertainties. This computational complexity is greatly magnified if a high-fidelity, physics-based numerical model is used for the topology optimization calculations. Stochastic reduced order model (SROM) methods are applied here to effectively 1) alleviate the prohibitive computational cost associated with an uncertainty aware topology optimization problem; and 2) quantify and propagate the inherent uncertainties due to design imperfections. A generic SROM framework that transforms the uncertainty aware, stochastic topology optimization problem into a deterministic optimization problem that relies only on independent calls to a deterministic numerical model is presented. This approach facilitates the use of existing optimization and modeling tools to accurately solve the uncertainty aware topology optimization problems in a fraction of the computational demand required by Monte Carlo methods. Finally, an example in structural topology optimization is presented to demonstrate the effectiveness of the proposed uncertainty aware structural topology optimization approach.

Aguilo, Miguel A.↗

Generation-based Evolutionary Tool for the Optimization of Constellations (GenETOC)

With the rapid growth in the capabilities of smaller satellites, satellite architectures that replace a single, extremely capable spacecraft with multiple, cheaper ones are gaining in popularity. Unfortunately, the orbit design process for constellations can be significantly more involved, especiallywhen the relative placement of the individual spacecraft within the constellation is not constrained by mission and/or science objectives. Optimizing a satellite constellation in the presence of multiple, competing objectives is a highly complex problem to which many traditional mathematical optimization methods cannot be applied and few tools exist to help mission designers search for promising candidate mission designs. The Generation-based Evolutionary Tool for the Optimization of Constellations (GenETOC) has been created to search for near-optimal constellation design options. GenETOC combines a modified version of the Non-dominated Sorting Genetic Algorithm II (NSGA II) with STK Components libraries (a 3rdparty .NET package created by Analytical Graphics Inc.) to create a framework that enables a mission designer to generate a simulation that models the design problem and obtain a family of potential, near-optimal solutions that can be investigated more in detail. GenETOC was developed in C# using the .NET framework with Windows Presentation Foundation (WPF) serving as the framework from which to create the graphical user interface (GUI). GenETOC user inputs can be categorized into three major data components: definition of the problem (areas of interest, satellite decision parameters, and sensor configurations), definition of performance objectives, and specification of the genetic algorithm (GA) parameters. In the problem definition component, the user is prompted to define the areas of interest against which the performance metrics will be computed, define the sensor parameters and attach them to specific spacecraft, select which satellite orbital parameters will be added to the decision space of the GA, and specify the range of desired values for each optimization parameter. For performance objectives, the user is presented with a list of available coverage and revisit performance based calculation options from which two metrics are chosen to serve as the objective functions that the GA will use to evaluate solutions during the optimization process. Finally, the definition of the GA parameters provides user control over the number of generations (number of optimization iterations), the population size (number of candidate constellations created in each generation), and the adaptive mutation and crossover threshold values (control parameters for how frequently each process occurs during the optimization). GenETOC has been extensively tested to verify the individual components of the optimization process. The GA has been tested against a suite of GA test problems to confirm convergence to the known two and three-dimensional Pareto fronts. The coverage and revisit performance metrics obtained in GenETOC are compared with STK desktop scenarios, confirming the constellations are being appropriately modeled within GenETOC simulations. A walkthrough of a simple, example problem is provided to illustrate the workings of GenETOC and to demonstrate the output available to the mission designer.

mission design↗

Averaging and Linear Programming in Some Singularly Perturbed Problems of Optimal Control

The paper aims at the development of an apparatus for analysis and construction of near optimal solutions of singularly perturbed (SP) optimal controls problems (that is, problems of optimal control of SP systems) considered on the infinite time horizon. We mostly focus on problems with time discounting criteria but a possibility of the extension of results to periodic optimization problems is discussed as well. Our consideration is based on earlier results on averaging of SP control systems and on linear programming formulations of optimal control problems. The idea that we exploit is to first asymptotically approximate a given problem of optimal control of the SP system by a certain averaged optimal control problem, then reformulate this averaged problem as an infinite-dimensional linear programming (LP) problem, and then approximate the latter by semi-infinite LP problems. We show that the optimal solution of these semi-infinite LP problems and their duals (that can be found with the help of a modification of an available LP software) allow one to construct near optimal controls of the SP system. We demonstrate the construction with two numerical examples.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Objective and algorithm considerations when optimizing the number and placement of turbines in a wind power plant

Abstract. Optimizing turbine layout is a challenging problem that has been extensively researched in the literature. However, optimizing the number of turbines within a given boundary has not been studied as extensively and is a difficult problem because it introduces discrete design variables and a discontinuous design space. An essential step in performing wind power plant layout optimization is to define the objective function, or value, that is used to express what is valuable to a wind power plant developer, such as annual energy production, cost of energy, or profit. In this paper, we demonstrate the importance of selecting the appropriate objective function when optimizing a wind power plant in a land-constrained site. We optimized several different wind power plants with different wind resources and boundary sizes. Results show that the optimal number of turbines varies drastically depending on the objective function. For a simple, one-dimensional, land-based scenario, we found that a wind power plant optimized for minimal cost of energy produced just 72 % of the profit compared to the wind power plant optimized for maximum profit, which corresponded to a loss of about USD 2 million each year. This paper also compares the performance of several different optimization algorithms, including a novel repeated-sweep algorithm that we developed. We found that the performance of each algorithm depended on the number of design variables in the problem as well as the objective function.

17 WIND ENERGY↗

Optimization study of Ultra-long Cycle Fast Reactor core concept

An optimization of an Ultra-long Cycle Fast Reactor (UCFR) design with a power rating of 1000 MW(electric), UCFR-1000, has been performed. Firstly, geometric optimization has been performed in the aspects of core size and core shape in terms of thermal–hydraulic (TH) feedback. Secondly, fuel composition optimization has been performed by adopting pressurized water reactor (PWR) spent fuel (SF) as a blanket material as well as natural uranium (NU). Thirdly, thorium has been loaded in the inner core for the optimization of radial power distribution. Lastly, a small-size UCFR with a power rate of 100 MWe has been developed with optimization of maximum neutron flux and fast neutron fluence limit for a short term deployable nuclear reactor. The equivalent diameter and the height of the optimized UCFR-1000 core are 5.9 and 2.4 m, respectively, while the equivalent diameter and the height of the optimized UCFR-100 core are 4.3 and 1.0 m, respectively. The size of the optimized UCFR-1000 has been enlarged in the radial direction and shortened in the axial direction from those of the initial UCFR design (Tak et al., 2013a) and this modification makes the burning speed of active core movement slower. It has been confirmed for both designs that a full-power operation of 60 years without refueling is feasible with respect to isotopics and criticality by a breed-and-burn strategy. The core performance characteristics of both designs have been evaluated in terms of axial/radial power shapes, neutron flux and nuclide distributions, breeding ratio, reactivity feedback coefficients, control rod worth, etc. By the design optimization study in this paper, the reductions of maximum neutron flux, fast neutron fluence, and axial/radial power peaking have been achieved, which are favorable for the safety of the UCFR.

Breed-and-burn↗

A deterministic method for PWR loading pattern optimization

A new deterministic approach to core loading optimization is presented. Selection of fuel enrichment and burnable poison (BP) arrangement in a pressurized water reactor (PWR) core are optimally determined subject to power peaking factor (PF) constraints. The deterministic approach is based on the method of Lagrange multipliers and the direct adjoining approach for the inequality power PF constraint. The optimality conditions are derived using calculus of variations resulting in the presence of jump conditions and a linear control Hamiltonian. The optimal control problems are addressed by simultaneously minimizing the Hamiltonian using the gradient method and performing Newton's method in different regions of the core to produce viable solutions for the controls. Without active control of the power profile in PWRs during depletion, our methodology is able to satisfy the power PF constraint at all times by proper loading selection at the beginning of cycle (BOC). This is achieved by promoting the proper burnup path forward in time during the calculation of the forward optimality conditions. Here this information is utilized in the adjoint burnup calculation, which acts to propagate the optimal control path back to the BOC during the calculation of the adjoint optimality conditions. The methodology has been developed into a new code DMCO (Deterministic Multi-Control Optimization) which can produce two-dimensional two-group depletion results in approximately seven minutes per optimization iteration on a personal computer. No application of heuristics is required and the code is capable of finding solutions from initial control distributions. A preliminary case study is presented for the Westinghouse AP600 first cycle fuel loading design which achieved an extended fuel cycle while satisfying power PF constraints.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Biomimetic model-based advanced control strategy integrated with multi-agent optimization for nonlinear chemical processes

Here, a novel framework is proposed for integrating biomimetic-based advanced control and multi-agent optimization approaches for nonlinear chemical process applications. In particular, a Biologically-Inspired Optimal Control Strategy, denoted as BIO-CS, is combined with multi-agent optimization (MAO) techniques to provide optimal solutions for dynamic systems. In this combined framework, the BIO-CS algorithm employs gradient-based optimal control solvers for the intermediate problems associated with the leader-follower agents’ local interactions. Also, the MAO uses the capabilities of heuristic-based optimization techniques by sharing process information to obtain optimal operating setpoints for the controller considering an overall process objective. The applicability of the proposed method is demonstrated using a nonlinear, multivariable, process model of a fermentation system. Specifically, the optimal operating points are computed by the MAO implementation for setpoint tracking, trajectory tracking and plant-model mismatch scenarios for BIO-CS application. Results of the developed framework are compared to a gradient-based Sequential Quadratic Programming (SQP) technique and a classical proportional-integral (PI) controller in terms of optimization and control studies, respectively. As an additional contribution, BIO-CS is also cast as a model predictive controller (MPC) for the first time and compared to the agent-based BIO-CS approach in terms of computational time and tracking error. Closed-loop control results show up to 46% improvement in tracking performance during transient for the multi-agent BIO-CS when compared to BIO-CS as MPC for additional computational expense. The obtained results illustrate the capabilities of this novel integrated framework including BIO-CS as MPC to achieve desired nonlinear system performance for various scenarios.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Random field optimization

Herein we present a new modeling paradigm for optimization that we call random field optimization. Random fields are a powerful modeling abstraction that aims to capture the behavior of random variables that live on infinite-dimensional spaces (e.g., space and time) such as stochastic processes (e.g., time series, Gaussian processes, and Markov processes), random matrices, and random spatial fields. This paradigm involves sophisticated mathematical objects (e.g., stochastic differential equations and space-time kernel functions) and has been widely used in neuroscience, geoscience, physics, civil engineering, and computer graphics. Despite of this, however, random fields have seen limited use in optimization; specifically, existing optimization paradigms that involve uncertainty (e.g., stochastic programming and robust optimization) mostly focus on the use of finite random variables. This trend is rapidly changing with the advent of statistical optimization (e.g., Bayesian optimization) and multi-scale optimization (e.g., integration of molecular sciences and process engineering). Our work extends a recently-proposed abstraction for infinite-dimensional optimization problems by capturing more general uncertainty representations. Moreover, we discuss solution paradigms for this new class of problems based on finite transformations and sampling, and identify open questions and challenges.

97 MATHEMATICS AND COMPUTING↗

Turbine scale and siting considerations in wind plant layout optimization and implications for capacity density

Improvements in wind energy technology, reduced costs, and ambitious clean energy goals have led to projections of high wind contribution in coming years. Developing methodologies to design wind plants with a variety of siting constraints and turbine sizes helps enable high wind penetration, and gain a better understanding of how wind plants are sensitive to setback constraints and turbine design. In this paper, we present a two-step optimization method to simultaneously determine the optimal number of turbines and their locations in a wind plant domain divided into many small, discrete parcels. We present the optimized performance metrics of a wind plant optimized with different turbine sizes and ratings, and with different siting restrictions within the wind plant. Our results indicate that taller and larger turbines are more sensitive to increasing siting constraints. We also compare the optimal wind plant layouts and performance for wind plants optimized for minimum COE and maximum profit. Wind plants optimized for profit had 130%-190% of the capacity of plants optimized for COE, which demonstrates that the optimal results are greatly affected by the objective function, which should be carefully considered. Finally, in this paper we demonstrate the effect of increasing siting constraints on wind plant capacity density, and how the results change when different land areas are used to calculate capacity density. When using the entire wind plant boundary area to determine capacity density, increasing siting constraints decreases the capacity density. However, when we only use the available area (the area left after removing the siting constraints) to calculate the capacity density, increasing the siting constraints increases capacity density. This is a critical insight because of how capacity density is typically defined and used in research, and has important implications for assessment of technical potential and capacity expansion modeling, as well as future wind deployment potential.

17 WIND ENERGY↗

Maximization of performance in multi-tube latent heat storage – Optimization of fins topology, effect of materials selection and flow arrangements

This paper addresses the need of multi-tube latent heat thermal storage (LHTES) systems with enhanced heat transfer performance. Uniquely, this work draws from topology optimization method for thermal energy storage to search for the optimal configuration of fins in multi-tube LHTES systems with different phase change materials (PCMs), flow arrangements and design constraints. The design freedom of topology optimization allows the discovery of innovative LHTES designs and elucidate the link between design and physical processes occurring during charging/discharging. Three key results of this study are: i) the optimized fin design is tightly connected to the type of storage duty cycle, which demonstrates the necessity to account for realistic operating conditions in the optimization process. ii) The fin material should be chosen in parallel with the layout of the fins and not sequentially as commonly done; this indicates that the optimization of LHTES systems is a co-design challenge. iii) Topology optimized multi-tube LHTES units surpass in performance fins optimized for a single-tube configuration in a multi-tube unit. Finally, this work demonstrates for the first time the manufacturability of topology-optimized LHTES units by using 3D printing.

25 ENERGY STORAGE↗

Exploratory Study of 4D versus 3D Robust Optimization in Intensity Modulated Proton Therapy for Lung Cancer

Purpose: The purpose of this study was to compare the impact of uncertainties and interplay on 3-dimensional (3D) and 4D robustly optimized intensity modulated proton therapy (IMPT) plans for lung cancer in an exploratory methodology study. Methods and Materials: IMPT plans were created for 11 nonrandomly selected non-small cell lung cancer (NSCLC) cases: 3D robustly optimized plans on average CTs with internal gross tumor volume density overridden to irradiate internal target volume, and 4D robustly optimized plans on 4D computed tomography (CT) to irradiate clinical target volume (CTV). Regular fractionation (66 Gy [relative biological effectiveness; RBE] in 33 fractions) was considered. In 4D optimization, the CTV of individual phases received nonuniform doses to achieve a uniform cumulative dose. The root-mean-square dose-volume histograms (RVH) measured the sensitivity of the dose to uncertainties, and the areas under the RVH curve (AUCs) were used to evaluate plan robustness. Dose evaluation software modeled time-dependent spot delivery to incorporate interplay effect with randomized starting phases of each field per fraction. Dose-volume histogram (DVH) indices comparing CTV coverage, homogeneity, and normal tissue sparing were evaluated using Wilcoxon signed rank test. Results: 4D robust optimization plans led to smaller AUC for CTV (14.26 vs 18.61, respectively; P=.001), better CTV coverage (Gy [RBE]) (D{sub 95%} CTV: 60.6 vs 55.2, respectively; P=.001), and better CTV homogeneity (D{sub 5%}-D{sub 95%} CTV: 10.3 vs 17.7, resspectively; P=.002) in the face of uncertainties. With interplay effect considered, 4D robust optimization produced plans with better target coverage (D{sub 95%} CTV: 64.5 vs 63.8, respectively; P=.0068), comparable target homogeneity, and comparable normal tissue protection. The benefits from 4D robust optimization were most obvious for the 2 typical stage III lung cancer patients. Conclusions: Our exploratory methodology study showed that, compared to 3D robust optimization, 4D robust optimization produced significantly more robust and interplay-effect-resistant plans for targets with comparable dose distributions for normal tissues. A further study with a larger and more realistic patient population is warranted to generalize the conclusions.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Machine learning based rate optimization under geologic uncertainty

We propose a novel approach for rate optimization during a waterflood under geologic uncertainty in reservoir properties such as permeability and porosity. The traditional approach typically involves several runs of the forward simulator. This may not scale well when the optimization is to be performed at the full field-level and over multiple geologic realizations. A machine-learning (ML) based approach which is quick and scalable for rate optimization over multiple geologic realizations is proposed instead. The training data for the model is generated by running the forward simulator with randomly assigned well rates using multiple geologic realizations. A reduced order representation of the permeability heterogeneity in each of the realizations is derived using a grid connectivity transformation (GCT). This step involves finding basis functions corresponding to the different modal frequencies of the grid connectivity represented by the grid Laplacian. The projection of the heterogeneous property field along these basis functions gives the basis coefficients that form the reduced order representation. Subsequently, for each training datapoint, streamlines are traced and the minimum time of flight (TOF) representing the tracer breakthrough time at each producer is recorded. The basis coefficients and well rates are fed to a machine learning model as input and the minimum TOF at the producers forms the output of the model. This trained model can then be used along with an optimizer for computing the optimal injection rates to maximize the injection sweep efficiency. This corresponds to minimizing the variance in the minimum TOF within each well group. Different architectures of neural network are tested using 5-fold cross validation to decide the best ML model to compute the streamline time of flight. The trained model is used to perform well rate optimization over multiple realizations of geology by using a risk tolerance penalty. The optimal well rates thus obtained are compared with two cases: a) equal well rates assigned to all injectors and producers and b) well rates obtained by optimizing over a single realization without considering the uncertainty in geology. The optimal well rates are seen to offer better oil recovery and sweep efficiency than both cases.

02 PETROLEUM↗

Development of multi-objective core optimization framework and application to sodium-cooled fast test reactors

The optimization of a Sodium-cooled Fast Reactor (SFR) core is a challenging process, due to the large number of design parameters, the nonlinearities among inputs and outputs, and the complicated correlation among output parameters. This study attempts to develop a generalized framework for the SFR core optimization by coupling the sensitivity analysis, advanced optimization algorithm, and optionally the surrogate modeling. The framework is built based on the fast reactor modeling capability of the Argonne Reactor Computation (ARC) suite and the sensitivity analysis and optimization modules embedded in the DAKOTA code, both have been integrated within the NEAMS Workbench. The genetic algorithm is selected as the optimization method for its robustness, while the option of surrogate modeling is also explored to alleviate the computational burden caused by employing the ARC direct core physics simulation and thus enhance the efficiency of the optimization. Finally, the normalized deviations of performance parameters of the near-optimal solution from those of the ideal core are calculated and used as criteria to down select the final core design. The developed framework is applied to the Advanced Burner Test Reactor (ABTR) core, and optimal solutions are determined by balancing various objectives simultaneously, including peak fast flux, core volume, power, reactivity swing, plutonium mass feed, while at the same time satisfying the predefined constraints due to safety or economics considerations. The optimal ABTR core design obtained using the direct physical simulation and surrogated model are compared and discussed. It is found that using the accurately constructed surrogate models can significantly reduce the required computational time while maintaining satisfactory accuracy.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Clifford Circuit-Based Heuristic Optimization of Fermion-To-Qubit Mappings

Simulation of interacting Fermionic Hamiltonians is one of the most promising applications of quantum computers. However, the feasibility of analyzing Fermionic systems with a quantum computer hinges on the efficiency of Fermion-to-qubit mappings that encode nonlocal Fermionic degrees of freedom in local qubit degrees of freedom. While recent studies have highlighted the importance of designing Fermion-to-qubit mappings that are tailored to specific problem Hamiltonians, the methods proposed so far either are restricted to a narrow class of mappings or they use computationally expensive and unscalable brute-force search algorithms. Here, in this work, we address this challenge by designing a heuristic numerical optimization framework for Fermion-to-qubit mappings. To this end, we first translate the Fermion-to-qubit mapping problem to a Clifford circuit optimization problem and then use simulated annealing to optimize the average Pauli weight of the problem Hamiltonian. For all Fermionic Hamiltonians we have considered, the numerically optimized mappings outperform their conventional counterparts, including ternary-tree-based mappings that are known to be optimal for single creation and annihilation operators. We find that our optimized mappings yield between 15% and 40% improvements on the average Pauli weight when the simulation Hamiltonian has an intermediate level of complexity. Most remarkably, the optimized mappings improve the average Pauli weight for 6 × 6 nearest-neighbor hopping and Hubbard models by more than 40% and 20%, respectively. Surprisingly, we also find specific interaction Hamiltonians for which the optimized mapping outperforms any ternary-tree-based mapping. Our results establish heuristic numerical optimization as an effective method for obtaining mappings tailored for specific Fermionic Hamiltonian.

Hamiltonians↗

Gradient-Informed Design Optimization of Select Nuclear Systems

In this work, we present a gradient-informed design optimization of nuclear reactor core components based on neutronics objectives with both continuous and discrete materials. The main argument in favor of using gradient-informed design optimization is that it scales well with increasing dimensionality of the design space. First, a challenge problem with 121 free parameters is solved with a gradient-informed method and then with a genetic algorithm. Then, a challenge problem to optimize the flux profile of a simplified assembly with eight axial zones is solved. Both challenge problems are solved using directly calculated derivatives from Tools for Sensitivity and Uncertainty Analysis Methodology Implementation (TSUNAMI) in the SCALE package. Furthermore, we demonstrate how a discrete optimization problem—selection of materials for 121 voxels—can be lifted into a continuous problem with mixed materials. In the continuous space, adjoint-based gradients are well-defined, and gradient descent is applicable. Then, a forcing function is introduced that with the selection of an appropriately sized hyperparameter can be used to guide the optimized continuous solution back into a discrete solution. This paper presents an account of the challenges that were faced when applying a gradient-informed optimization algorithm using a Monte Carlo calculation to estimate the gradient information and compares a gradient descent optimization method to a genetic algorithm optimization of the same geometry. Overall, this work demonstrates the potential use of adjoint-based gradient calculations in design optimization of nuclear systems.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Co-Optimization Scheme for Hybrid Electric Vehicles Powertrain and Exhaust Emission Control System Using Future Speed Prediction

Hybrid electric vehicles (HEVs) have been an effective solution for improved vehicle fuel efficiency and reduced emission pollution. In this paper, a co-optimization scheme is proposed to optimize fuel efficiency for HEVs. Here, the proposed optimization scheme uses obtainable future speed prediction as the basis to optimally tune control parameters for the existing powertrain control system. The ramp-up time of the catalyst temperature to reach its light-off level in the exhaust emission system is also considered as an additional optimization constraint to reduce emission. The Toyota Prius Hybrid Simulink model which is an integrated model for a powertrain and exhaust emission system is validated using real data from several real driving cycle scenarios. Then, to simplify the formulation of the proposed algorithm, the model for the optimization for powertrain and exhaust emission systems is represented by a set of equivalent neural network (NN) models learned using the data generated from the well-validated Toyota Prius Hybrid Simulink model. Using NN models, a co-optimization algorithm is established that provides an optimal tuning of some fuel-sensitive powertrain control parameters using future speed prediction, leading to a novel co-optimization algorithm, achieving on average a further 9.22% fuel savings for the Toyota Prius Hybrid Simulink model.

33 ADVANCED PROPULSION SYSTEMS↗

A novel active optimization approach for rapid and efficient design space exploration using ensemble machine learning

In this work, a novel design optimization technique based on active learning, which involves dynamic exploration and exploitation of the design space of interest using an ensemble of machine learning algorithms, is presented. In this approach, a hybrid methodology incorporating an explorative weak learner (regularized basis function model) which fits high-level information about the response surface, and an exploitative strong learner (based on committee machine) that fits finer details around promising regions identified by the weak learner, is employed. For each design iteration, an aristocratic approach is used to select a set of nominees, where points that meet a threshold merit value as predicted by the weak learner are selected to be evaluated using expensive function evaluation. In addition to these points, the global optimum as predicted by the strong learner is also evaluated to enable rapid convergence to the actual global optimum once the most promising region has been identified by the optimizer. This methodology is first tested by applying it to the optimization of a two-dimensional multi-modal surface. The performance of the new active learning approach is compared with traditional global optimization methods, namely micro-genetic algorithm (pGA) and particle swarm optimization (PSO). It is demonstrated that the new optimizer is able to reach the global optimum much faster with a significantly fewer number of function evaluations. Subsequently, the new optimizer is also applied to a complex internal combustion (IC) engine combustion optimization case with nine control parameters related to fuel injection, initial thermodynamic conditions, and in-cylinder flow. It is again found that the new approach significantly lowers the number of function evaluations that are needed to reach the optimum design configuration (by up to 80%) when compared to particle swarm and genetic algorithm-based optimization techniques.

Machine learning, active learning, design optimiza↗