Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Pareto front”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Towards an Agent-Based Blackboard System for Reactor Design Optimization

The field of reactor design is rich with opportunities for applications of computational optimization algorithms; these applications can range from preliminary core design to reactor shuffling patterns. Many of these schemes rely on sets of previously generated solutions (sometimes referred to as “generations”) to inform future decisions. While it is important to build upon prior knowledge, this process requires a full generation of solutions to be formed before future solutions can be examined. Rather than relying on a generational scheme to perform an optimization, we propose using an agent-based approach in conjunction with a blackboard framework for performing reactor design optimizations. Utilizing an agent-based approach allows agents to perform tasks independently, while retaining the ability to build off of previous solutions. We develop an agent-based blackboard system (ABBS) for determining the Pareto front (PF) in sodium fast reactor design optimization problems and compared this with the Non-Dominated Sorting Genetic Algorithm II (NSGA-II). Our goal is to evaluate the viability of the ABBS in producing a PF that is comparable with the NSGA-II algorithm. The design space consists of the fuel height, fuel smear, and plutonium fraction in the core, and we seek to minimize the reactivity swing and plutonium mass, while maximizing the burnup. The diversity, coverage, and spread of the PFs generated by the two methods are examined, and the ABBS is able to converge to the same PF as the NSGA-II algorithm. These results show that the ABBS is able to find optimal designs that are similar to those found by the NSGA-II algorithm. We conclude our study by applying the ABBS to the design of a sodium-cooled fast reactor to dispose of weapons-grade plutonium. The ABBS finds a core design that can burn upwards of 17.5 kg of weapons-grade plutonium per year and degrade an additional 195 kg of weapons-grade plutonium per year into non-weapons-grade material.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2026

Exploring the fusion power plant design space: comparative analysis of positive and negative triangularity tokamaks through optimization

The optimal configuration choice between positive triangularity (PT) and negative triangularity (NT) tokamaks for fusion power plants hinges on navigating different operational constraints rather than achieving specific plasma performance metrics. This study presents a systematic comparison using constrained multi-objective optimization with the integrated FUsion Synthesis Engine (FUSE) framework. Over 200 000 integrated design evaluations were performed exploring the trade-offs between capital cost minimization and operational reliability (maximizing q 95 ) while satisfying engineering constraints including 250 ± 50 MW net electric power, tritium breeding ratio > 1.1, power exhaust limits and an hour flattop time. Both configurations achieve similar cost-performance Pareto fronts through contrasting design philosophies. PT, while demonstrating resilience to pedestal degradation (compensating for up to 40% reduction), are constrained to larger machines (R 0 > 6.5 m) by the narrow operational window between L–H threshold requirements and the research-established power exhaust limit (P sol /R < 15 MW m –1 ). This forces optimization through comparatively reduced magnetic field (∼8 T). NT configurations exploit their freedom from these constraints to access compact, high-field designs (R 0 ~ 5.5 m, B 0 >12 T), creating natural synergy with advancing HTS technology. Sensitivity analyses reveal that PT’s economic viability depends critically on uncertainties in L–H threshold scaling and power handling limits. Notably, a 50% variation in either could eliminate viable designs or enable access to the compact design space. These results suggest configuration selection should be risk-informed: PT offers the lowest-cost path when operational constraints can be confidently predicted, while NT is robust to large variations in constraints and physics uncertainties.

FUSE framework↗
DOE OSTI2025

Harnessing the power of gradient-based simulations for multi-objective optimization in particle accelerators

Abstract Particle accelerator operation requires simultaneous optimization of multiple objectives. Multi-objective optimization (MOO) is particularly challenging due to trade-offs between the objectives. Evolutionary algorithms, such as genetic algorithms (GAs), have been leveraged for many optimization problems, however, they do not apply to complex control problems by design. This paper demonstrates the power of differentiability for solving MOO problems in particle accelerators using a deep differentiable reinforcement learning (DDRL) algorithm. We compare the DDRL algorithm with model-free reinforcement learning (MFRL), GA, and Bayesian optimization (BO) for simultaneous optimization of heat load and trip rates in the continuous electron beam accelerator facility. The underlying problem enforces strict constraints on both individual states and actions as well as cumulative (global) constraints on energy requirements of the beam. Using historical accelerator data, we develop a physics-based surrogate model which is differentiable and allows for back-propagation of gradients. The results are evaluated in the form of a Pareto-front with two objectives. We show that the DDRL outperforms MFRL, BO, and GA on high dimensional problems.

43 PARTICLE ACCELERATORS↗
DOE OSTI2025

Constraining nuclear mass models using 𝑟-process observables with multiobjective optimization

Modeling nuclear masses, particularly for nuclei far from stability, remains a key objective in nuclear physics. One contemporary approach is machine learning (ML), which trains on experimental data, but can suffer large errors when extrapolating toward neutron-rich species. In nature, such masses shape observables for the rapid neutron capture process (𝑟 process), which in principle could inform ML models. Here, we introduce a multiobjective optimization approach using the Pareto front algorithm. We show that this technique, capable of identifying models that generate 𝑟-process abundances aligning with both solar and stellar data, is a promising method to select ML models with reliable extrapolation power.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2023

A Comparison of Outer Rotor Radial and Axial Flux Machines for Application in Electric Vehicles

Axial flux machines have attracted a lot of interest in the recent years as potential high torque low weight candidates for use as traction motors in electric vehicles (EV). This paper compares axial and radial flux machines for electric vehicle applications. An external rotor radial flux machine with a Halbach array surface permanent magnet rotor and concentrated windings is chosen as a baseline to compare with axial flux designs. Both axial and radial flux motors are sized to meet the EV same requirements. Multi-objective design optimization using differential evolution minimizing loss and volume is carried out for both types of machines. Hundreds of candidate designs for each type of machine are analyzed, pareto fronts are identified and compared. The potential advantages of axial flux machines are evaluated and quantified.

Rallabandi, Vandana↗
DOE OSTI2026

Multi-Objective Boundary Analysis of Discrete and Integrated SiC FET Modular Non-inverting Buck and Boost Converters for Fuel Cell EVs

This paper presents a multi-objective analysis of discrete and integrated SiC FET-based non-inverting buck-boost converter modules for modular fuel cell electric vehicle (EV) systems. Two converter ratings, 60 kW and 90 kW, are evaluated for both implementations, scalable up to 420 kW and 450 kW, respectively. Performance is assessed across efficiency, volumetric and gravimetric power density, cost, thermal stress, and estimated lifetime, where lifetime is derived from SiC FET B10 power-cycling data and junction temperature variations at rated power. A normalized overall performance index combined with a Pareto-boundary framework is used to identify configurations that optimally balance competing objectives. Results show that most configurations lie on the Pareto front, providing balanced trade-offs, while certain high-power discrete (90 kW at 450 kW) and integrated (60 kW at 180−420 kW) configurations are dominated. In general, discrete modules are more favorable for lower-power modular systems due to higher power density and lower cost, whereas integrated modules become more advantageous at higher power levels due to improved thermal behavior and longer lifetime. These findings provide practical design guidance for scalable fuel cell converter architectures and highlight the importance of system-level trade-offs in modular power electronics design.

Asa, Erdem [ORNL] (ORCID:0000000190884812)↗
DOE OSTI2023

A Multi-objective Microgrid Assessment and Sizing Framework for Economic and Resilience Benefits

This paper presents an innovative multi-objective assessment and sizing framework for battery energy storage system paired with photovoltaics for a cost-effective and resilient microgrid. In the proposed framework, we simultaneously consider i) economic benefits from bundling grid services in grid-connected mode and ii) enhanced resilience by operating the microgrid in island mode upon outages of the main grid. Instead of simply treating resilience as another monetary value stream, this paper models resilience and economic benefits as two separate objectives. Multi-objective optimization is developed to explore different sizing and dispatch options and generate the Pareto front to assist decision-making in system design. Case studies on a real-world microgrid project in Puget Sound Energy system are presented to illustrate the proposed modeling and sizing methods.

Battery energy storage, Microgrid, Optimal Sizingp↗
DOE OSTI2022

Algorithm 1028: VTMOP: Solver for Blackbox Multiobjective Optimization Problems

VTMOP is a Fortran 2008 software package containing two Fortran modules for solving computationally expensive bound-constrained blackbox multiobjective optimization problems. VTMOP implements the algorithm of [32], which handles two or more objectives, does not require any derivatives, and produces well-distributed points over the Pareto front. The first module contains a general framework for solving multiobjective optimization problems by combining response surface methodology, trust region methodology, and an adaptive weighting scheme. The second module features a driver subroutine that implements this framework when the objective functions can be wrapped as a Fortran subroutine. Lastly, support is provided for both serial and parallel execution paradigms, and VTMOP is demonstrated on several test problems as well as one real-world problem in the area of particle accelerator optimization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

ParMOO: A Python library for parallel multiobjective simulation optimization

A multiobjective optimization problem (MOOP) is an optimization problem in which multiple objectives are optimized simultaneously. The goal of a MOOP is to find solutions that describe the tradeoff between these (potentially conflicting) objectives. Such a tradeoff surface is called the Pareto front. Real-world MOOPs may also involve constraints – additional hard rules that every solution must adhere to. In a multiobjective simulation optimization problem, the objectives are derived from the outputs of one or more computationally expensive simulations. Such problems are ubiquitous in science and engineering.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Deep Learning–Assisted Multiobjective Optimization of Geological CO 2 Storage Performance under Geomechanical Risks

In geological CO 2 storage, designing the optimal well control strategy for CO 2 injection to maximize CO 2 storage while minimizing the associated geomechanical risks is not trivial. This challenge arises due to pressure buildup, CO 2 plume migration, the highly nonlinear nature of geomechanical responses to rock-fluid interaction, and the high computational cost associated with coupled flow and geomechanics simulations. In this paper, we introduce a novel optimization framework to address these challenges. The optimization problem is formulated as follows: maximize total CO 2 storage while minimizing geomechanical risks by adjusting the injection schedules within bounded constraints. The geomechanical risks are primarily driven by injection-induced pressure build-up, which is characterized by ground displacement and the induced microseismicity. We used the Fourier neural operator (FNO)-based deep learning model to construct surrogate models, replacing the time-consuming coupled flow and geomechanics simulations for evaluating the aforementioned objective functions. The developed surrogate models have been incorporated into a multiobjective optimization framework through a genetic algorithm to reduce the computational burden. The proposed optimization framework reduces the computational cost from approximately 2,400 hours, when using objective function evaluations based on physics-based simulations, to around 20 minutes. A set of Pareto-optimal solutions of the proposed workflow yields nontrivial optimal decisions, reducing the microseismicity potential and the vertical displacement. This Pareto front highlights the optimal trade-offs between CO 2 storage amount, safety, and ground displacement, emphasizing the need for careful optimization and management of injection strategies to achieve a balanced outcome. The novelty of this work is twofold. First, we demonstrate the importance of incorporating the minimization of the geomechanical risks as objective functions into the CO 2 storage optimization workflow to mitigate the potential risk of induced microseismicity and ground displacement. Second, we leverage the FNO-based surrogate models to optimize a real-field CO 2 storage operation.

42 ENGINEERING↗
DOE OSTI2021

Performant implementation of the atomic cluster expansion

The atomic cluster expansion is a general polynomial expansion of the atomic energy in multi-atom basis functions. Here we implement the atomic cluster expansion in the performant C++ code PACE that is suitable for use in large scale atomistic simulations. We briefly review the atomic cluster expansion and give detailed expressions for energies and forces as well as efficient algorithms for their evaluation. We demonstrate that the atomic cluster expansion as implemented in PACE shifts a previously established Pareto front for machine learning interatomic potentials towards faster and more accurate calculations. Moreover, general purpose parameterizations are presented for copper and silicon and evaluated in detail. We show that the new Cu and Si potentials significantly improve on the best available potentials for highly accurate large-scale atomistic simulations.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2023

Multi-Objective Adaptive Mesh Refinement Using Reinforcement Learning

Finite element methods approximate the solution to a partial differential equation (PDE) on a mesh consisting of many elements. In general, using more, smaller elements results in a lower error in the approximation. However, it is often possible to lower the error substantially by only refining, or decreasing the size of, the few elements in the mesh that have the highest error. Adaptive mesh refinement (AMR) is a process that selectively refines regions of a mesh with high error to achieve a desired accuracy in as few degrees of freedom (DOFs) as possible. AMR is favorable compared to uniform refinement, which refines all elements of the mesh equally, because it can often achieve the same accuracy without wasting extra computation time on refinement of elements that already have low error. However, it is difficult to know which elements to refine. In this report we explore ways to choose which elements to refine such that we minimize both the resulting error and the cumulative DOFs used in computation. In particular, we introduce a Pareto-front learning algorithm that trains a policy to give the optimal refinement actions to minimize the cumulative DOFs used to achieve a given target error. Such a policy is useful because it can be deployed on many different problem types where different accuracy levels are desired. Furthermore, training a single policy for a range of target errors allows us to use transfer learning to reduce the required training time.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Explainable and Differentiable Reinforcement Learning for Multi-objective Optimization in Particle Accelerators

Operating particle accelerators involves optimizing multiple goals simultaneously, which can be challenging due to trade-offs among objectives. While evolutionary algorithms like the genetic algorithm (GA) have been used for various Multi-Objective Optimization (MOO) tasks, they are not inherently suited for complex control problems. This talk highlights two variations of Reinforcement Learning (RL) for concurrently optimizing heat load and trip rates at the Continuous Electron Beam Accelerator Facility (CEBAF). The problem involves strict constraints on individual states, actions, and overall energy requirements of the beam. First, this talk highlights how differentiability can be harnessed through a Deep Differentiable Reinforcement Learning (DDRL) approach to address MOO issues within particle accelerators. We examine the DDRL method alongside Model Free Reinforcement Learning (MFRL), GA, and Bayesian Optimization (BO). The performance of these methods is assessed by generating a Pareto-front for two objectives. Our findings indicate that DDRL excels in handling high-dimensional problems more effectively than MFRL, BO, and GA. Next, we will show integration of explainable physics-based constraints into RL algorithms to enhance trans- parency and trust in decision-making processes by enabling users to verify that agents adhere to established physical principles. This surrogate function can be modeled using neural networks or sparse dictionary mod- els. By examining the mathematical form of the learned constraint function, we are able to confirm the agent has learned to use the established physics of each environment provided but the surrogate model. In addi- tion, we find that the introduction of a mathematical functional dictionary based surrogate model enables our reinforcement learning algorithms to reliably converge for difficult high-dimensional accelerator controls environments.

Rajput, Kishansingh [Thomas Jefferson National Acc↗
DOE OSTI2026

Design and Optimization of Processing Pathways for Rare Earth Element Recovery from End-of-Life Products

In this presentation, we first discuss the benefits of targeting end-of-life (EOL) products as a feedstock. We then discuss the problem statement of designing a processing facility for recovering rare earth elements (REEs) from EOL HDDs and motors from EOL EVs/HEVs. We then discuss the most profitable pathway, and then discuss the environmental impacts associated with the processing pathway, comparing it to a processing facility in China, and find it to have lower impacts overall. We also investigate the trade-off solutions for other pathways that are not as profitable, but have lower impacts by generating Pareto Fronts. In the next portion of the presentation, Critical Materials Recycling, Inc. is discussed. We discuss how their process was found to be the optimal pathway after performing superstructure optimization, and how we are currently working with them to further optimize their process to increase profits. Finally, we wrap up with conclusions summarizing the main takeaways of the presentation.

36 MATERIALS SCIENCE↗
DOE OSTI2021

The Co-Optimization of Sustainable Aviation Fuel: Cost, Emissions, and Performance

The combustion of petroleum-based fuels contributes to increases in atmospheric CO2, contributing to climate change. As other sectors electrify, current battery technology makes this impractical for the aviation industry. The fastest pathway to reducing the carbon contributions of aviation is to create low or no net carbon-emitting drop-in petroleum alternatives. This research explores 3 potential sorghum derived jet fuel molecules from 4 different production routes, hydro-processed esters and fatty acids (HEFA), and Jet A, to identify how blends including these fuels could offer improved performance (MJ/kg, MJ/L) and improved emissions (gCO2/MJ) while minimizing costs. Different applications will value each target metric differently. This research utilizes the Jet Fuel Blend Optimizer (JudO) to create a 4-dimensional Pareto front across potential solutions. The molecules considered will not offer reduced cost compared to conventional jet fuel (Jet A), but they can be utilized to create blends with higher specific energy, greater energy density, and reduced greenhouse gas emissions. Considerations including carbon credits, the sale of byproducts, and the valuation of improved performance will make the proposed molecules more commercially viable. At the lowest region of GHG solutions, coupled with equivalent LCFS approximations, JudO determined blends that could achieve as high as 69% overall carbon reductions at a premium of $0.34/L.

Feldhausen, John J.↗
NASA NTRS2002

Transonic Wing Shape Optimization Using a Genetic Algorithm

A method for aerodynamic shape optimization based on a genetic algorithm approach is demonstrated. The algorithm is coupled with a transonic full potential flow solver and is used to optimize the flow about transonic wings including multi-objective solutions that lead to the generation of pareto fronts. The results indicate that the genetic algorithm is easy to implement, flexible in application and extremely reliable.

Holst, Terry L.↗
NASA NTRS2003

Aerodynamic Shape Optimization Using Evolutionary Algorithms

A method for aerodynamic shape optimization based on an evolutionary algorithm approach is presented and demonstrated. Results are presented for a number of model problems to access the effect of algorithm parameters on convergence efficiency and reliability. A transonic viscous airfoil optimization problem, both single and two-objective variations, is used as the basis for a preliminary comparison with an adjoint-gradient optimizer. The evolutionary algorithm is coupled with a transonic full potential flow solver and is used to optimize the inviscid flow about transonic wings including multi-objective and multi-discipline solutions that lead to the generation of pareto fronts. The results indicate that the evolutionary algorithm approach is easy to implement, flexible in application and extremely reliable.

Holst, Terry L.↗
NASA NTRS2003

Aerodynamic Shape Optimization using an Evolutionary Algorithm

A method for aerodynamic shape optimization based on an evolutionary algorithm approach is presented and demonstrated. Results are presented for a number of model problems to access the effect of algorithm parameters on convergence efficiency and reliability. A transonic viscous airfoil optimization problem-both single and two-objective variations is used as the basis for a preliminary comparison with an adjoint-gradient optimizer. The evolutionary algorithm is coupled with a transonic full potential flow solver and is used to optimize the inviscid flow about transonic wings including multi-objective and multi-discipline solutions that lead to the generation of pareto fronts. The results indicate that the evolutionary algorithm approach is easy to implement, flexible in application and extremely reliable.

Hoist, Terry L.↗