Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Mathematical programming”

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 559 records · Page 31

Optimization Algorithm for Criticality Experiment Design Using Whisper

Many criticality experiments performed to aid in nuclear data evaluation are designed to maximize the sensitivity of the system’s effective neutron multiplication factor to a certain nuclide reaction pair over an energy region of interest. This is typically done by evaluating possible designs in a transport code such as MCNP and selecting the one with the highest desired sensitivity. A designer has many tools to try to maximize this sensitivity such as different moderators, reflectors, fuels, and geometries. This balancing act of identifying a critical and maximally sensitive system become very computationally expensive as more variables are added and higher precisions are desired. In order to identify these optimal configurations more efficiently a Particle Swarm Optimization (PSO) algorithm coupled with MCNP has been developed by Los Alamos National Laboratory (LANL). This algorithm has been used to design two upcoming criticality experiments that will be performed at the National Criticality Experiments Research Center (NCERC), located at the Nevada National Security Site, and operated by LANL, the only general-purpose critical experiments laboratory in the United States. PSO uses a population (swarm) of candidate solutions (particles) on a search space of dimensions such as moderator and reflector thicknesses or enrichments and concentrations. These particles move around the search space from generation to generation according to simple rules. Eventually, the swarm converges on the configuration that is both critical and maximally sensitive to a piece of nuclear data. PSO is well suited for criticality experiments as the algorithm is agnostic to the underlying physics, meaning it is effective on many different experimental setups. This algorithm has been modified to maximize the nuclear data similarity coefficient between an application case and an experiment aimed at replicating the application case using WHISPER, a nuclear criticality safety analysis tool. This allows for the efficient design of critical experiments informed by nuclear data sensitives.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Verification and Validation of the New MCNP6.3 Criticality Features

The MCNP6® code, version 6.3, has been extensively verified and validated for many applications. The use of the same default capabilities existing in the MCNP6.2 code are also used in the verification and validation (V&V) of the MCNP6.3 code. In this paper, selected new features, code enhancements, and bug fixes in the MCNP6.3 code that impact criticality safety applications are described and investigated. More specifically, the changes within the MCNP6.3 code that are studied in this work include both the new fission matrix and the Doppler broadening resonance correction (DBRC) features. For nuclear criticality safety applications, the V&V benchmark problems within the criticality, extended criticality, and Rossi-α suites are used to study the upgrades within the MCNP6.3 code. Some additional investigations into benchmarks at elevated temperatures are used to showcase the impacts of the temperature-specific capabilities.

97 MATHEMATICS AND COMPUTING↗

Scalable branching on dual decomposition of stochastic mixed-integer programming problems

In this work, we present a scalable branching method for the dual decomposition of stochastic mixed-integer programming. Our new branching method is based on the branching method proposed by Caroe and Schultz that creates branching disjunctions on first-stage variables only. We propose improvements to the process for creating branching disjunctions, including (1) branching on the optimal solutions of the Dantzig-Wolfe reformulation of the restricted master problem and (2) using a more comprehensive (yet simple) measure for the dispersions associated with subproblem solution infeasibility. We prove that the proposed branching process leads to an algorithm that terminates finitely, and we provide conditions under which globally optimal solutions can be identified after termination. We have implemented our new branching method, as well as the Caroe-Schultz method and a branch-and-price method, in the open-source software package DSP. Using SIPLIB test instances, we present extensive numerical results to demonstrate that the proposed branching method significantly reduces the number of node subproblems and solution times.

97 MATHEMATICS AND COMPUTING↗

IER 500: AWE-LLNL Measurement Campaign at DAF [Slides]

Presentation Hosted at Device Assembly Facility (DAF). Joint collaboration by Atomic Weapons Establishment (AWE) and Lawrence Livermore National Laboratory (LLNL). Multiple measurements were recorded through a two-week period with 12 unique objects measured. LLNL deployed Machine learning software program for diagnostic assessments. Current status notes the dedicated DAF team LLNL maintains. Additionally, LLNL is compiling a report on the AWE-LLNL measurements and designing security benchmark experiments. The presentation concludes with future work envisioned.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Q-POP-Thermo: A general-purpose thermodynamics solver for ferroelectric materials

We report that Q-POP-Thermo is a program designed to compute thermodynamic monodomain equilibrium states and their properties for ferroelectric single crystals and thin films based on the Landau-Ginzburg-Devonshire (LGD) Theory. Utilizing symbolic manipulation with the SymPy Library, the governing equations along with appropriate boundary conditions are solved for speedy minimization of the free energy of a crystal. Utilizing the popular Differential Evolution algorithm, with appropriate hybridization, multiple phase diagrams, such as the pressure-temperature phase diagram for bulk single crystals and the common strain-temperature phase diagram for monodomain thin-film systems can be readily generated. Furthermore, a variety of material properties of stable ferroelectric phases, including dielectric, piezoelectric, and electrocaloric properties, can simultaneously be calculated. Validation studies are presented for both thin-film and single crystal systems to test the effectiveness and capability of the open-source program.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

2021 NIRT Mini Drill (After Action Report)

During the summer and fall of 2021, several functional area drills were held that focused on exercising Consequence Management’s (CM) ability to extract and use data from RadResponder for the purpose of answering intermediate-phase questions presented as technical inject requests for information (RFI) in Sandia National Laboratories (SNL) Consequence Management Operational System (COSMOS) software. The scenario chosen was that of Northern Lights 2016 (NL16) which was a large-scale nuclear power plant (NPP) release exercise in the state of Minnesota. The NL16 data was extracted from the Radiological Assessment and Monitoring System (RAMS) event where it was created and was reformatted for implanting to a new RadResponder event. Next, the beta-version of a laboratory sample data simulator was used to generate more sample data that was injected to the event. Five “mini-drills” were devised with each prompt defined by a data-based need. For each drill, a team of assessment and NARAC scientists worked the problem using the drill prompt and the available data in RadResponder. The teams held a kickoff meeting, had several days to work the problem, and then reported their results as well as observations in a hotwash. Several areas for improvement in both the software and process were identified during the course of these drills. This report will document the process of addressing each RFI and the discovered gaps in both software capability and methodology so that they can be considered for future development and investment by the CM and NIRT programs.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

EvaluateFlux, VARPOW, VARPEAK, and DIF3DtoVTK Utility Programs for DIF3D

The DIF3D-VARIANT solver is part of the DIF3D code which was developed at ANL for engineering level predictive analysis of nuclear reactor cores. Over the course of the last 20 years, the DIF3D-VARIANT option of DIF3D has become increasingly more used because of improvements in computer memory capabilities and performance. This is beneficial to the users of DIF3D as DIF3D-VARIANT is able to apply both p- and h- spatial mesh refinement strategies in diffusion and transport theory. Given its greater use, utility programs were created to assist in post-processing the DIF3D output. This document discusses the basic execution process of DIF3D and the output files it creates but is primarily focused on being the manual for the utility programs EvaluateFlux, VARPOW, VARPEAK, and DIF3DtoVTK.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

NETL UPGrants Addendum to the CO2U LCA Guidance Toolkit

The NETL UPGrants Addendum provides additional guidance and changes to the Carbon Dioxide Utilization Life Cycle Analysis Guidance for the U.S. DOE Office of Fossil Energy and Carbon Management, Version 2.0 to make it more applicable to vendors preparing life cycle analyses for the Utilization Procurement Grants program.

20 FOSSIL-FUELED POWER PLANTS↗

AI-Enhanced Co-Design for Next-Generation Microelectronics: Innovating Innovation (Workshop Report)

The Artificial Intelligence Enhanced Co-Design for Next Generation Microelectronics virtual workshop was held April 4-5, 2023, and attended by subject matter experts from universities, industry, and national laboratories. This was the third in a series of workshops to motivate the research community to identify and address major challenges facing microelectronics research and production. The 2023 workshop focused on a set of topics from materials to computing algorithms, and included discussions on relevant federal legislation and such as the Creating Helpful Incentives to Produce Semiconductors and Science Act (CHIPS Act) which was signed into law in the summer of 2022. Talks at the workshop included edge computing in radiation environments, new materials for neuromorphic computing, advanced packaging for microelectronics, and new AI techniques. We also received project updates from several of the Department of Energy (DOE) microelectronics co-design projects funded in the fall of 2021, and from three of the Energy Frontier Research Centers (EFRCs) that had been funded in the fall of 2022. The workshop also conducted a set of breakout discussions around the five principal research directions (PRDs) from the 2018 Department of Energy workshop report: 1) define innovative material, device, and architecture requirements driven by applications, algorithms, and software; 2) revolutionize memory and data storage; 3) re-imagine information flow unconstrained by interconnects; 4) redefine computing by leveraging unexploited physical phenomena; 5) reinvent the electricity grid through new materials, devices, and architectures. We tasked each breakout group to consider one primary PRD (and other PRDs as relevant topics arose during discussions) and to address questions such as whether the research community has embraced co-design as a methodology and whether new developments at any level of innovation from materials to programming models requires the research community to reevaluate the PRDs developed back in 2018.

97 MATHEMATICS AND COMPUTING↗

Advanced Simulation and Computing: FY25 Implementation Plan

The DOE National Nuclear Security Administration (NNSA) Stockpile Stewardship Program (SSP) is an integrated technical program for maintaining the safety, security, and reliability of the U.S. nuclear stockpile. The SSP incorporates nuclear test data, computational modeling and simulation, and experimental facilities to advance understanding of nuclear weapons. The suite of data analyzed comes from activities including previous nuclear tests, stockpile surveillance, experimental research, and development and engineering programs. This integrated national program requires the continued use of experimental facilities and the computational capabilities to support the SSP missions. These component parts, in addition to an appropriately scaled production capability, enable NNSA to support stockpile requirements. The ultimate goal of the SSP, and thus of the Advanced Simulation and Computing (ASC) program, is to ensure that the U.S. maintains a safe, secure, and effective strategic deterrent.

97 MATHEMATICS AND COMPUTING↗

HPC-enabled computation of demand models at scale

The purpose of this project is to examine the energy impact of urban-scale traffic for the Los Angeles Basin by developing and implementing a scalable traffic assignment model. An energy optimization function will be posed and when integrated into the optimization code for travel assignment it can be mathematically proven to converge. The energy optimization function can then be compared to the typical travel time optimization that is traditionally used in traffic assignment models. The analysis will begin with static traffic assignment models with the routing for all origin and destinations computed in parallel on high performance computing facilities. Convergence of the numerical methods rely on the solution of convex programs (or extensions of these). This step will mostly consist of demonstrating the ability to parallelize the Frank Wolfe algorithm on various platforms.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

HPC4Mobilty w/ UCB

The purpose of this project is to examine the energy impact of urban-scale traffic for the Los Angeles Basin by developing and implementing a scalable traffic assignment model. An energy optimization function will be posed and when integrated into the optimization code for travel assignment it can be mathematically proven to converge. The energy optimization function can then be compared to the typical travel time optimization that is traditionally used in traffic assignment models. The analysis will begin with static traffic assignment models with the routing for all origin and destinations computed in parallel on high performance computing facilities. Convergence of the numerical methods rely on the solution of convex programs (or extensions of these). This step will mostly consist of demonstrating the ability to parallelize the Frank Wolfe algorithm on various platforms. This work will contribute to LBNL’s efforts to develop new processes, analytical tools, program designs, and business models to advance the state of the art in next-generation sustainable transportation solutions.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

FY21 MCNP ® Updates for the Nuclear Criticality Safety Program [Slides]

LANL has devoted a substantial amount effort toward the MCNP6.3 release over the past year by improving many of their processes, infrastructure, and capabilities. Many new resources in support of the MCNP code and DOE NCSP applications are coming online now. LANL is excited to receive feedback on all of the new and improved capabilities that will be packaged with MCNP6.3.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

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↗

Decomposing a renewable energy design and dispatch model

We address a mixed-integer linear programming model which selects a cost-minimizing set of available technologies with which to design a renewable energy system and prescribe their associated dispatch decisions. Realistically sized instances of such models pose computational challenges. To this end, we develop a Lagrangian heuristic based on a decomposition methodology which partitions the model into blocks and optimizes these more manageable, smaller subproblems. It also provides a lower bound to assess solution quality. In conclusion, we apply this methodology to the National Renewable Energy Laboratory's Renewable Energy Integration and Optimization (REopt TM ) model to generate near-optimal solutions to realistic instances containing, on average, approximately 300,000 variables and at least as many constraints, with a mean 30% optimality gap improvement using a five-minute solution time limit, compared to directly solving the original monolith.

97 MATHEMATICS AND COMPUTING↗

Benders Cut Classification via Support Vector Machines for Solving Two-Stage Stochastic Programs

In this work, we consider Benders decomposition for solving two-stage stochastic programs with complete recourse based on finite samples of the uncertain parameters. We define the Benders cuts binding at the final optimal solution or the ones significantly improving bounds over iterations as valuable cuts. We propose a learning-enhanced Benders decomposition (LearnBD) algorithm, which adds a cut classification step in each iteration to selectively generate cuts that are more likely to be valuable cuts. The LearnBD algorithm includes two phases: (i) sampling cuts and collecting information from training problems and (ii) solving testing problems with a support vector machine (SVM) cut classifier. We run the LearnBD algorithm on instances of capacitated facility location and multicommodity network design under uncertain demand. Our results show that SVM cut classifier works effectively for identifying valuable cuts, and the LearnBD algorithm reduces the total solving time of all instances for different problems with various sizes and complexities.

97 MATHEMATICS AND COMPUTING↗

Supporting cost-effective watershed management strategies for Chesapeake Bay using a modeling and optimization framework

Extensive efforts to adaptively manage nutrient pollution rely on Chesapeake Bay Program’s (Phase 6) Watershed Model, called Chesapeake Assessment Scenario Tool (CAST), which helps decision-makers plan and track implementation of Best Management Practices (BMPs). We describe mathematical characteristics of CAST and develop a constrained nonlinear BMP-subset model, software, and visualization framework. This represents the first publicly available optimization framework for exploring least-cost strategies of pollutant load control for the United States’ largest estuary. The optimization identifies implementation options for a BMP subset modeled with load reduction effectiveness factors, and the web interface facilitates interactive exploration of >30,000 solutions organized by objective, nutrient control level, and for ~200 counties. We assess framework performance and demonstrate modeled cost improvements when comparing optimization-suggested proposals with proposals inspired by jurisdiction plans. Stakeholder feedback highlights the framework’s current utility for investigating cost-effective tradeoffs and its usefulness as a foundation for future analysis of restoration strategies.

54 ENVIRONMENTAL SCIENCES↗

Frontiers in computing for artificial intelligence

An emerging diversity of computational platforms offers many different approaches to adopting the paradigm of artificial intelligence to the study of electron-ion collisions. Here we review several leading candidates in this computational frontier and their workflows for experimental applications of artificial intelligence that may impact the future Electron-Ion Collider. We discuss the motivation for exploring novel methods to solve artificial intelligence and machine learning problems including with customized devices, quantum simulation, and heterogeneous computing systems. Furthermore, these technologies offer promising approaches to address some of the leading concerns of future computing that may impact the Electron-Ion Collider but they will require further development and testing in order to support future planning efforts.

detector design and construction technologies and ↗