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,099 records · Page 61

An adaptive moments-based interface reconstruction using intersection of the cell with one half-plane, two half-planes and a circle

We present a new adaptive moment-of-fluid (A-MOF) interface reconstruction method. It uses the zeroth, first, and second moments of the fragment of material inside a cell of the mesh to construct a shape that approximates the respective material fragment. The new method requires information about the material moments only for the cell under consideration. The adaptive method chooses between shapes obtained by the intersection of the cell with one half-plane, two half-planes, or a circle. The A-MOF method allows to exactly reproduce several convex shapes: corners, filaments, and their concave cell-complements; as well as pieces of the circles and its cell-compliments. Interface reconstruction is formulated as a local (for each cell), non-linear, equality constrained optimization problem, which does not require additional communication and allows for an efficient parallel implementation. In conclusion, we present an extensive set of test problems, both for interface reconstruction on a single cell, and for reconstruction of a variety of shapes on the entire mesh.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A phase-field fracture formulation for generalized standard materials: The interplay between thermomechanics and damage

Accurately modeling fracture of ductile materials poses open challenges in the field of computational mechanics due to the multiphysics nature of their failure processes. Integrating the interplay between thermodynamics and damage into ductile fracture models is vital for predicting critical failure modes. Here, in this paper, we develop a versatile phase-field (PF) framework for modeling ductile fracture, taking into account finite-strain elasto-plasticity. The framework stems from a variational formulation of constitutive relations for generalized standard materials (GSMs), whose response is described by a Helmholtz free energy and a dissipation pseudo-potential. Its variational structure is based on a minimum principle for a functional that expresses the sum of power densities for reversible and irreversible processes. By minimizing this functional with a constraint on a von Mises yield function, we derive the evolution equation for the equivalent plastic strain and an associative flow rule. This constrained optimization problem is analytically solved for a wide class of thermo-viscoplasticity models. The key innovations of the current work include (i) a cubic plastic degradation function that accounts for a non-vanishing damage-dependent yield stress, (ii) closed-form expressions of the Helmholtz free energy and dissipation pseudo-potential for three thermo-viscoplasticity models, (iii) an extended Johnson–Cook plasticity model with a nonlinear hardening law, and (iv) a plastic work heat source that depends on the plastic degradation function and a variable Taylor–Quinney (TQ) coefficient. The capabilities of the proposed framework are tested with the aid of four ductile fracture problems, including the Sandia Fracture Challenge. In each of these problems, we examine the evolution of relevant field variables such as the PF order parameter, the equivalent plastic strain, the temperature, and the internal power dissipation density, in addition to the overall structural response quantified by the force–displacement curve. These numerical studies demonstrate that the proposed framework effectively represents ductile fracture, yielding computational results that exhibit good agreement with experimental data.

36 MATERIALS SCIENCE↗

Optimal checkpointing for adjoint multistage time-stepping schemes

Here, we consider checkpointing strategies that minimize the number of recomputations needed when performing discrete adjoint computations using multistage time-stepping schemes that require computing several substeps within one complete time step. Specifically, we propose two algorithms that can generate optimal checkpoint-ing schedules under weak assumptions. The first is an extension of the seminal Revolve algorithm adapted to multistage schemes. The second algorithm, named CAMS, is developed based on dynamic programming, and it requires the least number of recomputations when compared with other algorithms. The CAMS algorithm is made publicly available in a library with bindings to C and Python. Numerical results show that the proposed algorithms can deliver up to two times the speedup compared with that of classical Revolve. Moreover, we discuss the utilization of the CAMS library in mature scientific computing libraries and demonstrate the ease of using it in an adjoint workflow. The proposed algorithms have been adopted by the PETSc TSAdjoint library. Their performance has been demonstrated with a large-scale PDE-constrained optimization problem on a leadership-class supercomputer. This work is a significant extension of the authors' conference paper.

97 MATHEMATICS AND COMPUTING↗

Cloud-based implementation of white-box model predictive control for a GEOTABS office building: A field test demonstration

Model predictive control (MPC) has been proven in simulations and pilot case studies to be a superior control strategy for large buildings. MPC can utilize the weather and occupancy schedule forecasts, together with the system model, to predict the future thermal behavior of the building and minimize the overall energy use and maximize thermal comfort. However, these advantages come with the cost of increased modeling effort, computational demands, communication infrastructure, and commissioning efforts. Thus a typical approach is to, often rapidly, simplify the building modeling and MPC optimization problem while paying a price of not reaching the full performance potential. It has been shown that by employing accurate physics-based models, MPC performance can be notably increased closer to its theoretical performance bound. However, implementation of such high-fidelity MPC in real buildings remains a challenge, resulting in a lack of successful field test studies. This work presents the methodology and field test demonstration of a computationally efficient implementation of the white-box MPC in an office building in Belgium. The detailed model of the building is based on first-principle physical equations. The deployment and supervision of MPC operation in a practical setting are supported by an automated cloud-based communication infrastructure. The motivating factor behind the cloud-based architecture is its compatibility with a commercially appealing control as a service concept. The building is equipped with a ground source heat pump (GSHP) and thermally activated building structures (TABS), where the combination of both is also known as GEOTABS. From a control perspective, GEOTABS buildings are particularly challenging systems due to large scale, complex heating, ventilation and air conditioning (HVAC) system, and slow dynamics with time delays. On the other hand, there is an increased potential for energy savings due to the high thermal mass, which acts as thermal storage. The MPC operation is demonstrated during the challenging transient seasons (switching between heating and cooling), and its performance is compared to a traditional rule-based controller (RBC). We provide a proof of concept of real MPC operation for the most difficult seasons with notable GSHP energy use savings equal to 53.5% and thermal comfort improvement by 36.9%. Other MPC applications found in the literature describe tests for only cooling or only heating, and up to now only for a black-box or a grey-box approach.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Synthesis of carbon core–shell pore structures and their performance as supercapacitors

High-power supercapacitors require excellent electrolyte mobility within the pore network and high electrical conductivity for maximum capacitance and efficiency. Achieving high power typically requires sacrificing energy densities, as the latter demands a high specific surface area and narrow porosity that impedes ion transport. Here, we present a novel solution for this optimization problem: a nanostructured core–shell carbonaceous material that exhibits a microporous carbon core surrounded by a mesoporous, graphitic shell. The tunable synthesis parameters yielded a structure that features either a sharp or a gradual transition between the core and shell sections. Electrochemical supercapacitor testing using organic electrolyte revealed that these novel core–shell materials outperform carbons with homogeneous pore structures. The hybrid core–shell materials showed a combination of good capacitance retention, typical for the carbon present in the shell and high specific capacitance, typical for the core material. These materials achieved power densities in excess of 40 kW kg -1 at energy densities reaching 27 Wh kg -1 .

25 ENERGY STORAGE↗

Machine learning from RANS and LES to inform coarse grid simulations

Nuclear system thermal hydraulic analysis has historically relied on computationally inexpensive 1D codes. However, such tools are unable to capture multiscale multidimensional effects in large nuclear reactor enclosures. On the other hand, simulations with higher fidelity can be too expensive for such purposes. One of the ways to reduce computational cost is to perform simulations on a coarse grid, which, unfortunately, introduces large discretization errors. In this paper, two high-to-low data-driven approaches are investigated: (1) a coarse grid turbulence model to predict eddy viscosity and (2) correction of errors in coarse grid velocity fields. The approaches aim to reduce grid- and turbulence model-induced errors in coarse grid Reynolds-averaged Navier–Stokes (RANS) simulations. Two sources of high-fidelity data, RANS and large eddy simulations (LES), are explored. To extract the eddy viscosity from the LES data, an inverse optimization problem is solved. However, the LES eddy viscosity is shown to be comparable to the RANS eddy viscosity in terms of error reduction. Therefore, the directly available RANS eddy viscosity was used to develop a coarse grid data-driven turbulence model. Additionally, error correction in velocity is used to reduce the remaining uncertainties and bring the results closer to reality. In conclusion, the performance of the frameworks is demonstrated for a scaled upper plenum of a gas-cooled reactor facility.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Development of a nearshore oscillating surge wave energy converter with variable geometry

This paper presents an analysis of a novel wave energy converter concept that combines an oscillating surge wave energy converter (OSWEC) with control surfaces. The control surfaces allow for a variable device geometry that enables the hydrodynamic properties to be adapted with respect to structural loading, absorption range and power-take-off capability. The device geometry is adjusted on a sea state-to-sea state time scale and combined with wave-to-wave manipulation of the power take-off (PTO) to provide greater control over the capture efficiency, capacity factor, and design loads. This work begins with a sensitivity study of the hydrodynamic coefficients with respect to device width, support structure thickness, and geometry. A linear frequency domain analysis is used to evaluate device performance in terms of absorbed power, foundation loads, and PTO torque. Previous OSWEC studies included nonlinear hydrodynamics, in response a nonlinear model that includes a quadratic viscous damping torque that was linearized via the Lorentz linearization. Inclusion of the quadratic viscous torque led to construction of an optimization problem that incorporated motion and PTO constraints. Results from this study found that, when transitioning from moderate-to-large sea states the novel OSWEC was capable of reducing structural loads while providing a near constant power output.

16 TIDAL AND WAVE POWER↗

Stochastic pre-event preparation for enhancing resilience of distribution systems

Extreme weather events are the common causes for power supply interruptions and power outages in electrical distribution systems. Improving the distribution system and enhancing its resilience is becoming crucial due to the increased frequency of extreme weather events. Preparation and allocation of multiple flexible resources, such as mobile resources, fuel resources, and labor resources before extreme weather events can mitigate the effects of extreme weather events and enhance the resilience of power distribution systems. Here, in this paper, a two-stage stochastic mixed-integer linear programming (SMILP) is proposed to optimize the preparation and resource allocation process for upcoming extreme weather events, which leads to faster and more efficient post-event restoration. The objective of the proposed two-stage SMILP is to maximize the served load and minimize the operating cost of flexible resources. The first stage in the optimization problem selects the amounts and locations of different resources. The second stage considers the operational constraints of the distribution system and repair crew scheduling constraints. The proposed stochastic pre-event preparation model is solved by a scenario decomposition method, Progressive Hedging (PH), to ease the computational complexity introduced by a large number of scenarios. Furthermore, to show the impact of solar photovoltaic (PV) generation on system resilience, three types of PV systems are considered during a power outage and the resilience improvements with different PV penetration levels are compared. Numerical results from simulations on a large-scale (more than 10,000 nodes) distribution feeder have been used to validate the effectiveness and scalability of the proposed method.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Constructing probabilistic scenarios for wide-area solar power generation

Optimizing thermal generation commitments and dispatch in the presence of high penetrations of renewable resources such as solar energy requires a characterization of their stochastic properties. In this study, we describe novel methods designed to create day-ahead, wide-area probabilistic solar power scenarios based only on historical forecasts and associated observations of solar power production. Each scenario represents a possible trajectory for solar power in next-day operations with an associated probability computed by algorithms that use historical forecast errors. Scenarios are created by segmentation of historic data, fitting non-parametric error distributions using epi-splines, and then computing specific quantiles from these distributions. Additionally, we address the challenge of establishing an upper bound on solar power output. Our specific application driver is for use in stochastic variants of core power systems operations optimization problems, e.g., unit commitment and economic dispatch. These problems require as input a range of possible future realizations of renewables production. However, the utility of such probabilistic scenarios extends to other contexts, e.g., operator and trader situational awareness. Finally, we compare the performance of our approach to a recently proposed method based on quantile regression, and demonstrate that our method performs comparably to this approach in terms of two widely used methods for assessing the quality of probabilistic scenarios: the Energy score and the Variogram score.

14 SOLAR ENERGY↗

Distributed output-feedback model predictive control for multi-agent consensus

We introduce a distributed output-feedback model predictive control approach for achieving consensus among multiple agents. Each agent computes a distributed control action based on an output-feedback measurement of a local neighborhood tracking error and communicates information only to its neighbors, according to a communication network modeled as a directed graph. Each agent computes its distributed control action by solving a local min–max optimization problem that simultaneously computes a local state estimate and control input under worst-case assumptions on unmeasured input disturbances and measurement noise. Under easily verified controllability and observability assumptions, this distributed output-feedback model predictive control approach provides an upper bound on the group consensus error, thereby ensuring practical consensus in the presence of unmeasured disturbances and noise. A numerical example with four agents connected in a directed graph is demonstrated to illustrate the results.

42 ENGINEERING↗

Longitudinal train dynamics model for a rail transit simulation system

The paper develops a longitudinal train dynamics model in support of microscopic railway transportation simulation. The model can be calibrated without any mechanical data making it ideal for implementation in transportation simulators. The calibration and validation work is based on data collected from the Portland light rail train fleet. The calibration procedure is mathematically formulated as a constrained non-linear optimization problem. The validity of the model is assessed by comparing instantaneous model predictions against field observations, and also evaluated in the domains of acceleration/deceleration versus speed and acceleration/deceleration versus distance. A test is conducted to investigate the adequacy of the model in simulation implementation. The results demonstrate that the proposed model can adequately capture instantaneous train dynamics, and provides good performance in the simulation test. Thus, the model provides a simple theoretical foundation for microscopic simulators and will significantly support the planning, management and control of railway transportation systems.

42 ENGINEERING↗

Actuator selection and placement for localized feedback flow control

The selection and placement of actuators and sensors to control compressible viscous flows is addressed by developing a novel methodology based upon the eigensystem structural sensitivity of the linearized evolution operator appropriate for linear feedback control. Forward and adjoint global modes are used to construct a space of possible perturbations to the linearized operator, which yields a small optimization problem for selecting the parameters that best achieve the control objective, including where they should be placed. The method is demonstrated by informing actuation to suppress amplification of the instabilities in boundary layer separation in a high-subsonic diffuser. Complete stabilization is observed in the separated shear layer for short downstream distances at modest Reynolds number. Higher Reynolds numbers and longer distances are expected to be more challenging to stabilize; here the control informed by the procedure still substantively suppresses amplification of instabilities. It is also demonstrated that more complex actuator–sensor selections may not yield superior controllers.

Mechanics↗

The DESC stellarator code suite Part 3: Quasi-symmetry optimization

The DESC stellarator optimization code takes advantage of advanced numerical methods to search the full parameter space much faster than conventional tools. Only a single equilibrium solution is needed at each optimization step thanks to automatic differentiation, which efficiently provides exact derivative information. A Gauss–Newton trust-region optimization method uses second-order derivative information to take large steps in parameter space and converges rapidly. With just-in-time compilation and GPU portability, high-dimensional stellarator optimization runs take orders of magnitude less computation time with DESC compared to other approaches. This paper presents the theory of the DESC fixed-boundary local optimization algorithm along with demonstrations of how to easily implement it in the code. Example quasi-symmetry optimizations are shown and compared to results from conventional tools. Three different forms of quasi-symmetry objectives are available in DESC, and their relative advantages are discussed in detail. In the examples presented, the triple product formulation yields the best optimization results in terms of minimized computation time and particle transport. This paper concludes with an explanation of how the modular code suite can be extended to accommodate other types of optimization problems.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Performing fully parallel constraint logic programming on a quantum annealer

A quantum annealer exploits quantum effects to solve a particular type of optimization problem. The advantage of this specialized hardware is that it effectively considers all possible solutions in parallel, thereby potentially outperforming classical computing systems. However, despite quantum annealers having recently become commercially available, there are relatively few high-level programming models that target these devices. In this article, we show how to compile a subset of Prolog enhanced with support for constraint logic programming into a two-local Ising-model Hamiltonian suitable for execution on a quantum annealer. In particular, we describe the series of transformations one can apply to convert constraint logic programs expressed in Prolog into an executable form that bears virtually no resemblance to a classical machine model yet that evaluates the specified constraints in a fully parallel manner. We evaluate our efforts on a 1,095-qubit D-Wave 2X quantum annealer and describe the approach's associated capabilities and shortcomings.

97 MATHEMATICS AND COMPUTING↗

Development of Steady-State and Dynamic Mass and Energy Constrained Neural Networks for Distributed Chemical Systems Using Noisy Transient Data

The paper presents the development of algorithms for mass and energy constrained neural network models that can exactly conserve the overall mass and energy of distributed chemical process systems, even though the noisy transient data used for optimal model training violate the same. In contrast to approximately satisfying mass and energy balance constraints of a system by soft penalization of objective function, algorithms have been developed for solving equality-constrained nonlinear optimization problems, thus providing the guarantee of exactly satisfying the system mass and energy conservation laws. For developing dynamic mass-energy constrained network models for distributed systems, hybrid series and parallel dynamic-static neural networks have been leveraged. The developed algorithms for solving both the training and forward problems are validated using both steady-state and dynamic data in the presence of various noise characteristics. The developed data-driven algorithms are flexible to exactly satisfy mass and energy balance constraints for dynamic chemical processes if the system holdup information is available. The proposed network structures and algorithms are applied to the development of data-driven lumped and distributed models of an adiabatic superheater/reheater system, a nonisothermal continuous stirred tank reactor, as well as an electrically heated plug-flow reactor system where one form of energy gets transformed to another. It has been observed that the mass-energy constrained neural networks yield a root mean squared error of <1% with respect to the system truth for the case studies evaluated in this work.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Atomic Radius and Charge Parameter Uncertainty in Biomolecular Solvation Energy Calculations

Atomic radii and charges are two major parameters used in implicit solvent electrostatics and energy calculations. The optimization problem for charges and radii is under-determined, leading to uncertainty in the values of these parameters and in the results of solvation energy calculations using these parameters. This paper presents a method for quantifying this uncertainty in solvation energies using surrogate models based on generalized polynomial chaos (gPC) expansions. There are relatively few atom types used to specify radii parameters in implicit solvation calculations; therefore, surrogate models for these low-dimensional spaces could be constructed using least-squares fitting. However, there are many more types of atomic charges; therefore, construction of surrogate models for the charge parameter space required compressed sensing combined with an iterative rotation method to enhance problem sparsity. We present results for the uncertainty in small molecule solvation energies based on these approaches. Additionally, we explore the correlation between uncertainties due to radii and charges which motivates the need for future work in uncertainty quantification methods for high-dimensional parameter spaces.

Yang, Xiu↗

A Comparison of Electronic Structure Methods for Predicting the Hydrogenation Energies of Candidate Molecules for Hydrogen Storage

The development of novel energy materials and fuels is required to expand current available energy sources. Aiming to reach this goal, there is growing interest in using molecular hydrogen as an energy carrier due to its abundance and high energy density. Liquid organic hydrogen carriers (LOHCs) are a promising route to the large-scale storage and transport of hydrogen for use in the energy economy. The search for thermodynamically viable LOHC molecules for real world use has led to a set of constraints on the dehydrogenation enthalpy and the minimum gravimetric hydrogen capacity. These constraints allow one to formulate the search for an ideal LOHC candidate molecule as an optimization problem well suited to the strengths of machine learning and artificial intelligence computational approaches. A critical barrier to a large-scale, high-throughput screening of LOHC candidate molecules is the lack of reliable training data. Computational electronic structure methods including density functional theory, coupled cluster approximations, and diffusion Monte Carlo can be used to provide training data where experimental data are either unreliable or do not exist. In this work, we use these methods to calculate the dehydrogenation energies and enthalpies of candidate LOHC molecules.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Energy Minimization of Discrete Protein Titration State Models Using Graph Theory

There are several applications in computational biophysics which require the optimization of discrete interacting states; e.g., amino acid titration states, ligand oxidation states, or discrete rotamer angles. Such optimization can be very time-consuming as it scales exponentially in the number of sites to be optimized. In this paper, we describe a new polynomial-time algorithm for optimization of discrete states in macromolecular systems. This algorithm was adapted from image processing and uses techniques from discrete mathematics and graph theory to restate the optimization problem in terms of maximum flow-minimum cut graph analysis. The interaction energy graph, a graph in which vertices (amino acids) and edges (interactions) are weighted with their respective energies, is transformed into a flow network in which the value of the minimum cut in the network equals the minimum free energy of the protein, and the cut itself encodes the state that achieves the minimum free energy. Because of its deterministic nature and polynomial-time performance, this algorithm has the potential to allow for the ionization state of larger proteins to be discovered.

energy minimization↗