Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Optimization”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

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

At least 1,225 records · Page 68

Tools for analysis of optimization models

The software is code for analyzing, debugging, and solving optimization models. The code implements several algorithms and provides convenient APIs to apply these algorithms to optimization models. The algorithms are primarily based on graph theory. They compute well-known partitions of graphs, and use these partitions to provide the user information about their optimization model, including diagnosing certain types of structural modeling errors. Some algorithms may be used as a subroutine to solve an optimization problem, and may call an optimization solver to facilitate this. Well-known linear algebra routines are called to provide further diagnostics. The software contains no data and no models other than toy models used for testing.

Parker, Robert↗

BEopt™ (Building Energy Optimization Tool) version 3.0.1 3/16/2023 [SWR-05-41]

The BEopt™ (Building Energy Optimization Tool) software provides capabilities to evaluate residential building designs and identify cost-optimal efficiency packages at various levels of whole-house energy savings along the path to zero net energy. The BEopt software can be used to analyze both new construction and existing home retrofits, as well as single-family detached and multi-family buildings, through evaluation of single building designs, parametric sweeps, and cost-based optimizations. The BEopt software provides detailed simulation-based analysis based on specific house characteristics, such as size, architecture, occupancy, vintage, location, and utility rates. Discrete envelope and equipment options, reflecting realistic construction materials and practices, are evaluated. The BEopt software uses EnergyPlus®, the Department of Energy's flagship simulation engine. Simulation assumptions are based on ANSI/RESNET/ICC Standards and the Building America Housing Simulation Protocols. The sequential search optimization technique used by the BEopt software: Finds minimum-cost building designs at different target energy-savings levels Identifies multiple near-optimal designs along the path, allowing for equivalent solutions based on builder or contractor preference. Download A BEopt™ Version 3.0.1 Beta release (Mar. 16, 2023) is now available. Download the BEopt 3.0.1 Beta setup file.

Christensen, Craig↗

Dispatch Optimization Variable Engine

The Dispatch Optimization Variable Engine (DOVE) is software tool written in python, developed at Idaho National Laboratory (INL) that provides an easily accessible application-programming-interface (API) to performing resource dispatch optimization analysis for integrated energy system (IES) configurations. DOVE is an integral part of the Framework for Optimization of Resources and Economics (FORCE) software suite and is leveraged by codes such as the Holistic Energy Resource Optimization Network (HERON) and the Optimization of Real-Time Capacity Allocation (ORCA). The philosophy behind DOVE is to provide a modular software solution to IES planning and operation by utilizing state-of-the-art algorithms and machine learning. The goal is to accurately capture the dispatching behavior of a complex energy system given varying time-dependent signals for demand and commodity pricing.

McDowell, DylanJ. [Idaho National Laboratory (INL)↗

arco (Assembled Resource-Constrained Optimization) [SWR-26-030]

Arco (Assembled Resource-Constrained Optimization) is a memory-smart optimization DSL and solver for LP and MIP problems on constrained hardware. The software is an optimization framework built around a KDL-based domain-specific language and a CLI compiler/solver. You write optimization models in .kdl files, and the arco CLI compiles, validates, inspects, and solves them. Language bindings (Python today, more planned) provide programmatic access to the same engine. Built for harder optimization problems on constrained resources, Arco is intentional about every allocation, careful with stack and heap behavior, and relentless about minimizing memory usage so more systems can run real workloads. Arco is built primarily for internal use within our organization. You are welcome to try it, but we make no guarantees about API stability or robustness at this stage

Sanchez Perez, Pedro Andres [National Laboratory o↗

Optimization Layers for Pyomo [SWR-25-132]

Optimization Layers for Pyomo solves an optimization problem using Pyomo and IPOPT during the forward pass. It computes the gradient of the optimal solution with respect to the parameters based on the KKT conditions in the backward pass. It is a Python library for constructing differentiable optimization layers in PyTorch from Pyomo optimization models.

Chen, Kejun [National Laboratory of the Rockies (N↗

Machine Learning Approach for Spatiotemporal Multivariate Optimization of Environmental Monitoring Sensor Locations

Abstract Long-term environmental monitoring is critical for managing the soil and groundwater at contaminated sites. Recent improvements in state-of-the-art sensor technology, communication networks, and artificial intelligence have created opportunities to modernize this monitoring activity for automated, fast, robust, and predictive monitoring. In such modernization, it is required that sensor locations be optimized to capture the spatiotemporal dynamics of all monitoring variables as well as to make it cost-effective. The legacy monitoring datasets of the target area are important to perform this optimization. In this study, we have developed a machine-learning approach to optimize sensor locations for soil and groundwater monitoring based on ensemble supervised learning and majority voting. For spatial optimization, Gaussian process regression (GPR) is used for spatial interpolation, while the majority voting is applied to accommodate the multivariate temporal dimension. Results show that the algorithms significantly outperform the random selection of the sensor locations for predictive spatiotemporal interpolation. While the method has been applied to a four-dimensional dataset (with two-dimensional space, time, and multiple contaminants), we anticipate that it can be generalizable to higher-dimensional datasets for environmental monitoring sensor location optimization.

Siddiquee, Masudur R.↗

Optimization of thermal barrier coating performance and durability over a drive cycle

A methodology to thermo-mechanically optimize a piston thermal barrier coating over a full drive cycle was established. The optimization objective was to minimize the heat transfer to the engine wall while maintaining structural integrity of the coating. Over 800 candidate materials were investigated and the optimization required more than one million non-road transient drive cycle calculations; real materials were investigated to ensure a realizable result and the existence of thermal and mechanical properties. High computational efficiency was achieved using a recently developed analytical heat transfer technique for multilayer engine walls. An uncoupled approach was utilized for the optimization, wherein the gas temperature and heat transfer coefficient profiles from a fully coupled and calibrated baseline model over the 20-min drive cycle were employed. The coating/piston interface temperature was constrained to be below the maximum piston service temperature limit. The durability was assessed using a recently developed analytical coating delamination framework for engine in-cylinder coatings based on the energy release rate when a crack forms. Results are presented for a mechanically unconstrained optimization and for cases constrained to three fixed levels of drive-cycle maximum energy release rate, and also constrained by the individual material’s toughness. The best-performing coating materials identified were verified using the fully coupled system-level model, which compared well to the uncoupled predictions. A study on the effect of adding a sealing layer to some high-performing, but porous, coatings showed a reduction in fuel consumption benefit and an increased exhaust temperature over the cycle, but the system still outperformed the uncoated case. The results of the study elucidate the importance of including engine performance and mechanical failure considerations in thermal barrier coating design.

Engineering↗

Multiobjective and categorical global optimization of photonic structures based on ResNet generative neural networks

Abstract We show that deep generative neural networks, based on global optimization networks (GLOnets), can be configured to perform the multiobjective and categorical global optimization of photonic devices. A residual network scheme enables GLOnets to evolve from a deep architecture, which is required to properly search the full design space early in the optimization process, to a shallow network that generates a narrow distribution of globally optimal devices. As a proof-of-concept demonstration, we adapt our method to design thin-film stacks consisting of multiple material types. Benchmarks with known globally optimized antireflection structures indicate that GLOnets can find the global optimum with orders of magnitude faster speeds compared to conventional algorithms. We also demonstrate the utility of our method in complex design tasks with its application to incandescent light filters. These results indicate that advanced concepts in deep learning can push the capabilities of inverse design algorithms for photonics.

Jiang, Jiaqi↗

Hyper-Differential Sensitivity Analysis of Uncertain Parameters in PDE-Constrained Optimization

Many problems in engineering and sciences require the solution of large scale optimization constrained by partial differential equations (PDEs). Though PDE-constrained optimization is itself challenging, most applications pose additional complexity, namely, uncertain parameters in the PDEs. Uncertainty quantification (UQ) is necessary to characterize, prioritize, and study the influence of these uncertain parameters. Sensitivity analysis, a classical tool in UQ, is frequently used to study the sensitivity of a model to uncertain parameters. In this article, we introduce "hyper-differential sensitivity analysis" which considers the sensitivity of the solution of a PDE-constrained optimization problem to uncertain parameters. Our approach is a goal-oriented analysis which may be viewed as a tool to complement other UQ methods in the service of decision making and robust design. We formally define hyper-differential sensitivity indices and highlight their relationship to the existing optimization and sensitivity analysis literatures. Assuming the presence of low rank structure in the parameter space, computational efficiency is achieved by leveraging a generalized singular value decomposition in conjunction with a randomized solver which converts the computational bottleneck of the algorithm into an embarrassingly parallel loop. Two multi-physics examples, consisting of nonlinear steady state control and transient linear inversion, demonstrate efficient identification of the uncertain parameters which have the greatest influence on the optimal solution.

97 MATHEMATICS AND COMPUTING↗

Xopt and Badger: a machine learning ecosystem for real-time accelerator control and optimization

Machine learning (ML)-based black-box optimization algorithms have demonstrated significant improvements in accelerator optimization speed, often by orders of magnitude. However, deploying these algorithms in real-time facility control remains challenging due to the specialized expertise and infrastructure required. To bridge this gap, we introduce the Xopt ecosystem, a versatile suite of tools designed to make advanced ML-based optimization accessible to the broader accelerator community. This ecosystem includes Xopt, a modular Python framework that facilitates the integration of ML-based optimization algorithms with arbitrary control problems, and Badger, a graphical user interface built on top of Xopt, which enables seamless deployment of ML algorithms in real-time control systems. The Xopt ecosystem has been successfully applied towards solving challenging real-time control problems at leading international accelerator facilities, including SLAC, LBNL, Argonne, Fermilab, BNL, DESY, and ESRF, demonstrating its effectiveness in real-world optimization tasks. In this presentation, we provide an overview of Xopt’s capabilities and illustrate its impact through case studies from SLAC accelerator facilities including LCLS, LCLS-II, and FACET-II.

Roussel, Ryan [SLAC]↗

Bayesian optimization scheme for the design of a nanofibrous high power target

High Power Targetry (HPT) R&D is critical in the context of increasing beam intensity and energy for next generation accelerators. Many target concepts and novel materials are being developed and tested for their ability to withstand extreme beam environments; the HPT R&D Group at Fermilab is developing an electrospun nanofiber material for this purpose. The performance of these nanofiber targets is sensitive to their construction parameters, such as the packing density of the fibers. Lowering the density improves the survival of the target, but reduces the secondary particle yield. Optimizing the lifetime and production efficiency of the target poses an interesting design problem, and in this paper we study the applicability of Bayesian optimization to its solution. We first describe how to encode the nanofiber target design problem as the optimization of an objective function, and how to evaluate that function with computer simulations. We then explain the optimization loop setup. Thereafter, we present the optimal design parameters suggested by the algorithm, and close with discussions of limitations and future refinements.

43 PARTICLE ACCELERATORS↗

Quantum Optimization and Approximation Algorithms

Shor's groundbreaking quantum algorithm for integer factoring provides an exponential speedup over the best-known classical algorithms. In the 20 years since Shor's algorithm was conceived, only a handful of fundamental quantum algorithmic kernels, generally providing modest polynomial speedups over classical algorithms, have been invented. To better understand the potential advantage quantum resources provide over their classical counterparts, one may consider other resources than execution time of algorithms. Quantum Approximation Algorithms direct the power of quantum computing towards optimization problems where quantum resources provide higher-quality solutions instead of faster execution times. We provide a new rigorous analysis of the recent Quantum Approximate Optimization Algorithm, demonstrating that it provably outperforms the best known classical approximation algorithm for special hard cases of the fundamental Maximum Cut graph-partitioning problem. We also develop new types of classical approximation algorithms for finding near-optimal low-energy states of physical systems arising in condensed matter by extending seminal discrete optimization techniques. Our interdisciplinary work seeks to unearth new connections between discrete optimization and quantum information science.

97 MATHEMATICS AND COMPUTING↗

Thermomechanical design optimization for low metal footprint in hybrid metal-polymer heat exchanger

Material and maintenance costs of metal-based heat exchangers surpass profits in waste heat recovery (WHR) from ultra-low temperature (<100C) sources [1]. A low-cost alternative like polymer pipes suffer from poor thermal conductivity (~0.2 W/mK), and a low overall heat transfer coefficient. Polymers’ thermal conductivity have previously been enhanced through systematic molecular alignment by stretching [2], chemical vapor deposition of extended polymers [3], surface grating [4], etc. However, these approaches suffer from scalability issues for WHR heat exchangers in terms of cost [3], and thermomechanical considerations [5]. In this work, we propose novel hybrid metal-polymer heat exchangers that are made from polymer-copper strips. Through finite element method (FEM) simulations, we first optimize the placement of copper around polymer strips to enhance the transverse thermal conductivity of the strips. The copper cladded polymer strips are wound helically in a roll-to-roll system to form the pipes for a heat exchanger. We then optimize the design of helically wound pipes to reduce thermomechanical strains to < 0.2 % at 100C and 40 psi working conditions. At 25 % volume fraction of copper in the pipe, we predict up to 20 % enhancement in overall heat transfer from a base polymer with a thermal conductivity of 0.2 W/mK. We also compare and contrast the thermomechanical performance of the optimized metal-polymer strips to random metal matrix composites. Finally, we experimentally verify the thermal conductivity of the optimized strips through bulk thermal conductivity and thermal interface resistance measurement setup. By systematically improving the design through FEM and experimental measurements, we provide an optimized design of hybrid metal-polymer pipes that provides a low metal footprint and cost-effective means for harvesting waste heat from ultra-low temperature sources. Thekdi, Arvind, and Sachin U. Nimbalkar. Oak Ridge National Lab, 2015 Shen, Sheng, et al. Nature nanotechnology 5.4 (2010): 251. Xu, Yanfei, et al. Science advances 4.3 (2018): 3031. Smith, M. K., Singh, V., Kalaitzidou, K., & Cola, B. A. (2015). ACS nano, 9(2), 1080-1088. Aymonier, C., Bortzmeyer, D., Thomann, R., & M&uuml;lhaupt, R. (2003). Chemistry of Materials, 15(25), 4874-4878.

C Rajagopal, Manjunath↗

Introduction to Mixed Variable Optimization (MVO) [Slides]

Mixed Variable Optimization (MVO) is an optimization method that uses discrete (categorical) and continuous variables in its optimization process. This method of optimization is applicable to highly nonlinear problems where the information used in the optimization is of poor quality of has minor inaccuracies in the data sets.

97 MATHEMATICS AND COMPUTING↗

Sustainable Data Evolution Technology (SDET) for Power Grid Optimization (Final Report)

This project develops an innovative sustainable data evolution technology (SDET) to create open-access power grid datasets and facilitate updates to these datasets by the power grid community. The lack of open-access, realistic large-scale datasets significantly limits the ability of researchers, developers and ultimately end users to develop, benchmark and compare new methods and tools for optimizing the operation and planning of the grid, which leads to slow adoption by end users. Available open datasets include the IEEE sponsored 14-300 bus transmission test cases and distribution test feeders, the Edinburgh Power Systems Test Case Archive (39-2224 buses), and the Polish cases (2383-3375 buses) available with MATPOWER. These datasets serve certain purposes, but for power grid optimization, they are insufficient in one or more of these aspects: 1) they are too small; 2) they are incomplete in both models and scenarios for optimization purposes; and 3) they are static and are not keeping up with grid needs. The SDET technology delivers large-scale realistic datasets and data-creation tools capable of generating new datasets. We work closely with the Category-2 data repository project awarded by the same GRID DATA program. The generated datasets and data creation tools are compatible with and available through the data repository. The objective is to make this a sustained effort within and beyond the ARPA-E GRID DATA program so that the datasets can evolve over time and meet the current and future needs for power grid optimization and potentially other applications in power grid operation and planning. The novel and disruptive features of SDET differentiate itself from prior work in the following aspects: 1) SDET derives features and metrics for both transmission and distribution (T&D) systems by analyzing many public and private datasets provided by our industry partners National Rural Electric Cooperative Association (NRECA) and PJM Interconnection (PJM). 2) SDET develops data-creation tools and use these tools to generate large-scale open-access realistic datasets that comply with the metrics for both T&D systems. 3) SDET validates the created datasets using industry tools provided by our vendor partner GE Energy Solution. The data creation tools, as well as the created datasets, are integrated into the data repository (DR. POWER) funded by ARPA-E GRID DATA program in Category 2. Users can use the datasets and access these data creation tools to create and update datasets, thus datasets can evolve per user requirements and power grid development. The SDET is a novel and disruptive technology compared to current ad hoc and static dataset generation. It is expected the SDET technology will fundamentally enhance the development, assessment, and adoption of new methods and tools for power grid optimization and other applications, which in turn would significantly improve the reliability, resiliency, and efficiency of the power grid – a major ARPA-E mission objective.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Innovations in optimization and control of accelerators using methods of differential geometry and genetic algorithms (Final Report)

Online tuning of particle accelerators is necessary in order to achieve optimal machine performance. However, it is also a major challenge due to the large parameter space which must be searched and the fact that many of the desir- able objectives compete with one another, and so will not reach their optimal values simultaneously. In order to mitigate these issues, we have explored using dimension-reduction techniques to reduce the size of the parameter space which must be searched and multi-objective genetic algorithms to obtain the sets of tuning parameters which provide pareto-optimal values for the objectives. These methods have enabled us to obtain improved values of the vertical emittance at the Cornell Electron Storage Ring (CESR), and to do so with greater control of orbit errors. Algorithmic tuning is a multidisciplinary endeavour, requiring expertise in beam dynamics, diagnostics, control systems and computer science, and thus a key practical problem is to formulate a common language in which experts with different specialties can communicate. We developed a solution to this problem in the form of a generic accelerator software interface that allows for rapid prototyping of optimization and control algorithms. Our interface is built on the Experimental Physics and Industrial Control Systems (EPICS) and makes possible testing control code in simulation before deployment on real accelerators, as well as deployment of third-party optimization code.

43 PARTICLE ACCELERATORS↗

Application of a machine learning algorithm (XGBoost) to offline RHIC luminosity optimization

The operation parameter optimization in 2020 RHIC low energy run is difficult. First, the RHIC luminosity is affected by many RHIC operation parameters, as well as affected by many Low Energy RHIC electron Cooling (LEReC) operation parameters. Second, the luminosity signal in this run is noisy and not sensitive to these parameter changes, especially when these parameters are very close to their optimized values. It is not easy to distinguish the effects of one parameter from all other operation parameters separately. Therefore, it is difficult to optimize the luminosity by varying these parameters one by one. To find a way for luminosity optimization, we analyze some operation parameters via a machine learning algorithm - XGBoost. After constructing a black-box surrogate model from XGBoost and plotting their partial dependency plots (PDF) and SHAP value plots for different operation parameters, we can find the effects of an individual parameter on the RHIC luminosity and optimize it accordingly.

43 PARTICLE ACCELERATORS↗

Concurrent Shape and Topology Optimization

The typical topology optimization workflow uses a design domain that does not change during the optimization process. Consequently, features of the design domain, such as the location of loads and constraints, must be determined in advance and are not optimizable. A method is proposed herein that allows the design domain to be optimized along with the topology. This approach uses topology and shape derivatives to guide nested optimizers to the optimal topology and design domain. The details of the method are discussed, and examples are provided that demonstrate the utility of this approach.

42 ENGINEERING↗