SEARCH · Engineering Papers

Results for “computational challenges”

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.

SourceResearch connectionFrom yearThrough year

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

At least 253 records · Page 14

All sources NASA NTRS DOE OSTI

DOE OSTI2020

Adaptive simulations enable computational design of electron beam processing of nanomaterials with supersonic micro-jet precursor

Focused Electron Beam Induced Processing (FEBIP) is a powerful tool for the “direct-write” of nanomaterials with the possibility of atomistic control on suspended 2D material substrates. FEBIP capabilities have been significantly expanded by using a localized jet-based delivery of precursors, and especially when a thermally energized supersonic micro-jet enhances the delivery of mass flux along with controlling the far-from-equilibrium thermodynamic state of adsorbed adatoms. The possibilities of growing nanomaterials with “dialed-in” composition with ultra-high growth rates and aspect ratios up to 100:1 have been demonstrated using the supersonic micro-jet-FEBIP. Bringing this scientific discovery to the level of maturity required for practical applications in additive nanomanufacturing requires simulation tools that are capable of capturing the complex flow physics of micro-jet-substrate interactions that bridge a wide range of flow regimes from the high-density gas micro-jet expanding into the vacuum environment of FEBIP. To address this significant computational challenge, a new approach has been developed and described in this work for a multiscale adaptive DSMC (Direct Simulation Monte Carlo) algorithm to predict the micro-jet gas dynamics in an FEBIP environment, spanning the full range of flow regimes from low Knudsen (Kn) number O(0.01) continuum flow to high Kn of O(10) for the molecular flow within a unified computational framework. Here, the fundamental principles of the adaptive DSMC algorithm are described, its viability as a DSMC technique is demonstrated, and computational improvements for the benchmark cases are discussed in the context of advancing 3D nanofabrication with FEBIP. Ultimately, combining the first principle simulations via adaptive DSMC with the complementary experimental data will enable the creation of the powerful CAD tools for in silico design and optimal operation of micro-jet-FEBIP.

36 MATERIALS SCIENCE↗

DOE OSTI2015

A Parallel Computing Framework for Finding the Supported Solutions to a Biobjective Network Optimization Problem

Abstract Solving multi‐objective combinatorial optimization problems can quickly become computationally challenging when applied to large networks generated from big data. Present‐day first‐rate Mixed Integer Programming (MIP) solvers have parallelism built‐in to take advantage of multicore architectures; but specialized network optimization algorithms that can often solve graph problems more efficiently than a general MIP solver are typically programmed serially. Thus, these network algorithm implementations do not take full advantage of modern multicore computer capabilities. Many parallel computing languages include a fork/join framework into their concurrency packages that allow for simple conversion of recursive serial algorithms to operate in parallel without having to use complicated low‐level message‐passing interfaces. Fork/join is particularly well suited to divide and conquer algorithms such as Non‐Inferior Set Estimation (NISE) method for computing the supported Pareto front of a multi‐objective optimization problem. This work develops a simple general parallel NISE (pNISE) implementation using the Java 7 concurrency tools, and then offers results from a specific implementation of solving a bi‐objective shortest path problem. The results indicate that this method is capable of sizeable speed‐ups on both small‐scale personal computers as well as large‐scale shared memory supercomputers. Finally, other network problems suitable to this method are discussed, including multi‐objective variants of the minimum spanning tree problem, transportation problem, assignment problem, maximum flow problem, and the minimum‐cost flow problem. Copyright © 2015 John Wiley & Sons, Ltd.

Medrano, Fernando Antonio↗

DOE OSTI2026

Parametric reduced order models for graded lattice structures

Graded lattice structures, characterized by smoothly varying mechanical properties, hold significant promise for optimizing material distribution in advanced engineering applications. However, accurately modeling these structures poses substantial computational challenges due to the continuous geometric variations within their unit cells. Here, to address these challenges, this paper introduces a novel Efficient Reduced Order Model (EROM) that integrates the Matrix Discrete Empirical Interpolation Method (MDEIM) and Discrete Empirical Interpolation Method (DEIM) with polynomial regression to efficiently manage geometric parametrization in lattice structures. Unlike traditional reduced order models (ROMs) that require extensive precomputed libraries for each geometric configuration, our approach enables continuous geometric variations through a flexible algebraic formulation, significantly reducing computational costs while preserving high accuracy. The method constructs projection matrices for individual unit cells that can be efficiently assembled into global systems, leveraging the repetitive nature of lattice structures. Numerical studies demonstrate that our EROM achieves displacement errors below 1% and von Mises stress prediction errors below 4%, coupled with computational speedups exceeding two orders of magnitude compared to full-order simulations. The proposed method's modularity and scalability make it particularly suitable for design optimization and real-time simulation of functionally graded lattice structures, with applications spanning aerospace to biomedical engineering.

11 - NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

DOE OSTI2023

Dynamic Network Analysis of Nuclear Science Literature for Research Influence Assessment

Analyzing nuclear science literature via data-driven methods is a critical step for assessing research influence and technology advancements. Indicators of scholarly activities may be buried in large volumes of nuclear research publications and collaboration networks over time. Mining for relevant scholarly influence trends in large volumes of text can be computationally challenging; however, open-source information on research collaborations over time can offer opportunities to extract meaningful insights. While network centrality analysis of scholarly research provides topology-based insights, additional emphasis on dynamics associated with the diffusion of information through these networks is important. Here this paper represents a step in that direction through the development of a novel dynamic network analysis framework and computational engine to identify key entities and capabilities over time within global scholarly nuclear science collaboration networks. Network theoretic, stochastic simulation, and optimization methods are leveraged to address variability in scholarly interactions, influence propagation, and collaboration patterns via network connections. A topic-aware influence maximization algorithm is developed to address the goal of identifying key influential authors in diverse research topics over time. Efficient parallelized implementation of the algorithm is applied to reduce computational costs. A proof-of-concept case study using open-source Scopus data with 33,517 published nuclear research papers from 2000-2019 is presented and representative analytic insights are generated. Broad implications of these insights are discussed and future research directions are also identified.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

DOE OSTI2016

CFD and X-ray Analysis of Gaseous Direct Injection from an Outward Opening Injector

Using natural gas in an internal combustion engine (ICE) is emerging as a promising way to improve thermal efficiency and reduce exhaust emissions. In the development of such engine platforms, computational fluid dynamics (CFD) plays a fundamental role in the optimization of geometries and operating parameters. One of the most relevant issues in the simulation of direct injection (DI) gaseous processes is the accurate prediction of the gas jet evolution. The simulation of the injection process for a gaseous fuel does not require complex modeling, nevertheless properly describing high-pressure gas jets remains a challenging task. At the exit of the nozzle, the injected gas is under-expanded, the flow becomes supersonic and shocks occur due to compressibility effects. These phenomena lead to challenging computational requirements resulting from high grid resolution and low computational time-steps. In this paper, the simulation of gaseous injection from an outward opening injector was carried out with the commercial CFD software CONVERGE. Argon was injected into a quiescent chamber filled with Nitrogen. Two free-jet cases with injection pressure of 15 and 10 bar, and ambient pressure of 1 and 2 bar respectively, were tested. For the 15 bar injection pressure and 1 bar ambient pressure, a jet impinging on a barrier case was performed as well. The numerical results were validated against experimental mass measurements using X-ray radiography. The results, presented in terms of 2D maps and transverse sections of equivalent path length of argon, showed good agreement between modeling and experiments in terms of jet penetration, shape and gas mass distribution. These emphasized the significant impact of mesh size on the results for the simulation of this type of injector. Due to the small geometrical dimensions a fine mesh is required in order to deliver an accurate description of the mixture formation. Numerical results were discussed with a particular emphasis on the application to engine simulations, where a trade-off between accuracy and computational time is a necessity.

Bartolucci, Lorenzo↗

DOE OSTI2022

Recent advances and challenges in optimization models for expansion planning of power systems and reliability optimization

Optimization models for expansion planning of power systems aim to determine capacities, investment timing, and location of power systems to satisfy the power demands while minimizing the total cost. The models have become complex in recent years to reflect both regulations on conventional energy sources and the increasing penetration of renewable energy sources (RES). This paper reviews the basic concepts and optimization models for expansion planning of power systems. We first explain the definition and features of generation expansion planning (GEP), transmission expansion planning (TEP), and generation and transmission expansion planning (GTEP). To address the computational challenges of large-scale expansion planning problems, we review several simplifications including temporal and spatial aggregation, and decomposition methods. This paper also addresses power system reliability defined as the probability of satisfying the load demand while withstanding failures of components. Finally, the goal of this paper is to provide a research overview, discuss trends in expansion planning of power systems, and suggest directions for future research.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2018

Development of predictive capability of cycle-to-cycle variation in dual-fuel engines using supercomputing-based computational fluid dynamics

Cycle-to-cycle variation (CCV) in internal combustion engines is expected due to variabilities in operating conditions such as in-cylinder fuel stratification, mixing behavior, manifold air pressure, injection timing etc. Generally, engine experimental studies provide averaged quantities such as cylinder pressure, emissions, indicated mean effective pressure (IMEP) from multiple cycles and their CCV of IMEP, and CCV of cylinder pressure from consecutive cycles for a given test condition. Capturing 3D spatial distributions of relevant measures such as fuel-air mixing, temperature, turbulence levels and emissions from such experiments is challenging. Computational Fluid Dynamics (CFD) is an alternative to experiments, that can be used effectively to understand the spatial and temporal distributions of parameters of interest.Quantitative understanding of CCV in dual-fuel (DF) engines will accelerate the development and deployment of engines that provide fuel flexibility, economic advantage and emission compliance. Earlier work [1] performed to develop an understanding of the physics of CCV in large-bore, medium-speed, dual-fuel engines was partially successful. That effort entailed a sparse design of experiment (DOE) of full-cylinder geometry, closed-cycle, dual-fuel CFD simulations in which variabilities within some of the identified global parameters were exercised. The Coefficient of Variation (COV) of cylinder pressure was promising compared with experimental COV. This reinforced the understanding of which global parameters are significant contributors to CCV in DF combustion.The authors have used several high-performance supercomputing facilities in the process of developing predicting capability of CCV in large-bore engines, while operating in dual-fuel, diesel and natural gas (NG), combustion mode [1, 2]. In the current study CCV influencing parameters in a diesel-natural gas dual-fuel engine was studied using a 4th order DOE consisting of 137 concurrent cases. These full-geometry, closed-cycle, CFD simulations were run on the Mira supercomputing facility at the Argonne National Laboratory (ANL). This paper describes key learnings of that study along with a validation of the DOE. Further, the CCV prediction methodology, which is applicable to simulation-based design and testing, is described.

Gubba, Sreenivasa Rao↗

DOE OSTI2021

Quantum computing based hybrid deep learning for fault diagnosis in electrical power systems

Quantum computing (QC) and deep learning have shown promise of supporting transformative advances and have recently gained popularity in a wide range of areas. Here, this paper proposes a hybrid QC-based deep learning framework for fault diagnosis of electrical power systems that combine the feature extraction capabilities of conditional restricted Boltzmann machine with an efficient classification of deep networks. Computational challenges stemming from the complexities of such deep learning models are overcome by QC-based training methodologies that effectively leverage the complementary strengths of quantum assisted learning and classical training techniques. The proposed hybrid QC-based deep learning framework is tested on a simulated electrical power system with 30 buses and wide variations of substation and transmission line faults, to demonstrate the framework’s applicability, efficiency, and generalization capabilities. High computational efficiency is enjoyed by the proposed hybrid approach in terms of computational effort required and quality of diagnosis performance over classical training methods. In addition, superior and reliable fault diagnosis performance with faster response time is achieved over state-of-the-art pattern recognition methods based on artificial neural networks (ANN) and decision trees (DT).

42 ENGINEERING↗

DOE OSTI2021

Particle track classification using quantum associative memory

Pattern recognition algorithms are commonly employed to simplify the challenging and necessary step of track reconstruction in sub-atomic physics experiments. Aiding in the discrimination of relevant interactions, pattern recognition seeks to accelerate track reconstruction by isolating signals of interest. In high collision rate experiments, such algorithms can be particularly crucial for determining whether to retain or discard information from a given interaction even before the data is transferred to tape. As data rates, detector resolution, noise, and inefficiencies increase, pattern recognition becomes more computationally challenging, motivating the development of higher efficiency algorithms and techniques. Quantum associative memory is an approach that seeks to exploits quantum mechanical phenomena to gain advantage in learning capacity, or the number of patterns that can be stored and accurately recalled. Here, we study quantum associative memory based on quantum annealing and apply it to the particle track classification. We focus on discrimination models based on Ising formulations of quantum associative memory model (QAMM) recall and quantum content-addressable memory (QCAM) recall. We characterize classification performance of these approaches as a function detector resolution, pattern library size, and detector inefficiencies, using the D-Wave 2000Q processor as a testbed. Discrimination criteria is set using both solution-state energy and classification labels embedded in solution states. We find that energy-based QAMM classification performs well in regimes of small pattern density and low detector inefficiency. In contrast, state-based QCAM achieves reasonably high accuracy recall for large pattern density and the greatest recall accuracy robustness to a variety of detector noise sources.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

DOE OSTI2014

Investigation of ALEGRA shock hydrocode algorithms using an exact free surface jet flow solution.

Computational testing of the arbitrary Lagrangian-Eulerian shock physics code, ALEGRA, is presented using an exact solution that is very similar to a shaped charge jet flow. The solution is a steady, isentropic, subsonic free surface flow with significant compression and release and is provided as a steady state initial condition. There should be no shocks and no entropy production throughout the problem. The purpose of this test problem is to present a detailed and challenging computation in order to provide evidence for algorithmic strengths and weaknesses in ALEGRA which should be examined further. The results of this work are intended to be used to guide future algorithmic improvements in the spirit of test-driven development processes.

Hanks, Bradley Wright.↗

DOE OSTI2020

Scalable Deep-Learning-Accelerated Topology Optimization for Additively Manufactured Materials

Topology optimization (TO) is a popular and powerful computational approach for designing novel structures, materials, and devices. Two computational challenges have limited the applicability of TO to a variety of industrial applications. First, a TO problem often involves a large number of design variables to guarantee sufficient expressive power. Second, many TO problems require a large number of expensive physical model simulations, and those simulations cannot be parallelized. To address these issues, we propose a general scalable deep-learning (DL) based TO framework, referred to as SDL-TO, which utilizes parallel schemes in high performance computing (HPC) to accelerate the TO process for designing additively manufactured (AM) materials. Unlike the existing studies of DL for TO, our framework accelerates TO by learning the iterative history data and simultaneously training on the mapping between the given design and its gradient. The surrogate gradient is learned by utilizing parallel computing on multiple CPUs incorporated with a distributed DL training on multiple GPUs. The learned TO gradient enables a fast online update scheme instead of an expensive update based on the physical simulator or solver. Using a local sampling strategy, we achieve to reduce the intrinsic high dimensionality of the design space and improve the training accuracy and the scalability of the SDL-TO framework. The method is demonstrated by benchmark examples and AM materials design for heat conduction. The proposed SDL-TO framework shows competitive performance compared to the baseline methods but significantly reduces the computational cost by a speed up of around 8.6x over the standard TO implementation.

Bi, Sirui↗

DOE OSTI2015

Partnership for Edge Physics Simulation (EPSI)

We propose to develop advanced simulation codes, based upon an extreme parallelism, first principles kinetic approach, to address the challenges associated with the edge region of magnetically confined plasmas. This work is relevant to both existing magnetic fusion facilities and essential for next-generation burning plasma experiments, such as ITER where success is critically dependent upon H-mode operation achieving an edge pedestal of sufficient height for good core plasma performance without producing deleterious large scale edge localized instabilities. The plasma edge presents a well-known set of multi-physics, multi-scale problems involving complex 3D magnetic geometry. Perhaps the greatest computational challenge is the lack of scale separation – temporal scales for drift waves, Alfven waves, ELM dynamics for example have strong overlap. Similar overlap occurs on the spatial scales for the ion poloidal gyro-radius, drift wave and pedestal width. The traditional approach of separating fusion problems into weakly interacting spatial or temporal domains clearly breaks down in the edge. A full kinetic model (full-f model) must be solved to understand and predict the edge physics including non-equilibrium thermodynamic issues arising from the magnetic topology (the open field lines producing a spatially sensitive velocity hole), plasma wall interactions, neutral and atomic physics. The plan here is to model these phenomena within a comprehensive first principles set of equations without the need for the insurmountable multiple-codes coupling issues by building on the XGC1 code developed under the SciDAC Proto-FSP Center for Plasma Edge Simulation (CPES). This proposal includes the critical participants in the XGC1 development. We propose enhancing the capability of XGC1 by including all the important turbulence physics contained in kinetic ion and electron electromagnetic dynamics, by extending the PIC technology to incorporate several positive features found in the Eulerian grid technology, combining the coarse grained XGC0 code into it with a multiscale projective time integration technique to be developed in the project for experimental time scale simulation of the edge multi-physics, and by implementing modern computational technologies to move forward with the extreme scale heterogeneous hardware/software platform development. Ultra-fast edge localized instabilities, involving compressional Alven modes, will be studied using a proper MHD or two-fluid codes employing kinetic closure information from XGC. The proposed research integrates the most important physical processes on overlapping temporal and spatial scales, to study (i) transitions and thresholds for enhanced confinement regimes, (ii) the predictive understanding of the edge pedestal formation, structure and dynamics, (iii) the effect of the edge plasma on the core confinement, (iv) the physics of Edge Localized Modes and their suppression or mitigation via external control techniques, and (v) the heat load on the material wall. Our approach will implement physical models that are valid in their relevant collisionality regimes for current experiments and future burning plasma devices. Comparisons with experimental data will be made at multiple levels including characterization of turbulence dynamics, flux-gradient responses in the energy, particle and momentum channels, and observations of global phenomena such as L-H transitions, momentum generation, ELM dynamics, ELM-free regimes and the tokamak density limit. The proposal team has established strong connections, through joint membership, with other organizations that will be critical for success. These include FASTMath, SUPER and QUEST Institutes respectively for meshing tools and solvers; code performance tuning and uncertainty quantification as well as a proposed Data Management and Visualization Institute.. We will also be teaming with ongoing fusion SciDAC’s: CSWPI for RF-edge plasmas interactions; CEMM for the M3D MHD simulations and with PEPSC for incorporation of energetic particle physics. Finally, the team includes representatives from each of the major U.S. experimental facilities who will coordinate the validation program and the development of synthetic diagnostics.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2021

Efficient Phasor-Based Dynamic Volt/VAr and Volt/Watt Analysis of Large Distribution Grid with High Penetration of Smart Inverters

As the penetration of power-electronics based smart inverters (SIs) is increasing in distribution grids, it adds computational challenges in solving dynamic models of large-scale distribution feeders. Voltage and reactive power (Volt/VAr), and voltage and active power (Volt/Watt) dynamics have been analyzed at slower time scales akin to the control of legacy grid devices. However, smart inverters, being power-electronics based devices, can provide dynamic active/reactive power support at a faster time scale, which necessitates Volt/VAr and Volt/Watt dynamics to be analyzed at a faster time scale. The existing dynamic models are overly detailed and computationally intractable for distribution feeders with a large number of inverters. In this context, this proposed work aims towards developing a computationally tractable, scalable, and accurate phasor-based model for dynamic Volt/VAr and Volt/Watt analyses of large distribution systems with high penetration of smart inverters. Case studies demonstrate that the proposed phasor-based model sufficiently captures the Volt/VAr and Volt/Watt dynamics, and is computationally faster by one order of magnitude compared to the average model and by two orders of magnitude compared to the detailed switching model. Case studies also demonstrate the efficacy and scalability of the proposed model in analyzing Volt/VAr and Volt/Watt dynamics of large-scale power networks with hundreds of SIs.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2021

Dynamic Distribution of High-Rate Data Processing from CERN to Remote HPC Data Centers

The prompt reconstruction of the data recorded from the Large Hadron Collider (LHC) detectors has always been addressed by dedicated resources at the CERN Tier-0. Such workloads come in spikes due to the nature of the operation of the accelerator and in special high load occasions experiments have commissioned methods to distribute (spill-over) a fraction of the load to sites outside CERN. The present work demonstrates a new way of supporting the Tier-0 environment by provisioning resources elastically for such spilled-over workflows onto the Piz Daint Supercomputer at CSCS. Furthermore, this is implemented using containers, tuning the existing batch scheduler and reinforcing the scratch file system, while still using standard Grid middleware. ATLAS, CMS and CSCS have jointly run selected prompt data reconstruction on up to several thousand cores on Piz Daint into a shared environment, thereby probing the viability of the CSCS high performance computer site as on demand extension of the CERN Tier-0, which could play a role in addressing the future LHC computing challenges for the high luminosity LHC.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Fermionic quantum processing with programmable neutral atom arrays

Simulating the properties of many-body fermionic systems is an outstanding computational challenge relevant to material science, quantum chemistry, and particle physics.-5.4pc]Please note that the spelling of the following author names in the manuscript differs from the spelling provided in the article metadata: D. González-Cuadra, D. Bluvstein, M. Kalinowski, R. Kaubruegger, N. Maskara, P. Naldesi, T. V. Zache, A. M. Kaufman, M. D. Lukin, H. Pichler, B. Vermersch, Jun Ye, and P. Zoller. The spelling provided in the manuscript has been retained; please confirm. Although qubit-based quantum computers can potentially tackle this problem more efficiently than classical devices, encoding nonlocal fermionic statistics introduces an overhead in the required resources, limiting their applicability on near-term architectures. In this work, we present a fermionic quantum processor, where fermionic models are locally encoded in a fermionic register and simulated in a hardware-efficient manner using fermionic gates. We consider in particular fermionic atoms in programmable tweezer arrays and develop different protocols to implement nonlocal gates, guaranteeing Fermi statistics at the hardware level. We use this gate set, together with Rydberg-mediated interaction gates, to find efficient circuit decompositions for digital and variational quantum simulation algorithms, illustrated here for molecular energy estimation. Finally, we consider a combined fermion-qubit architecture, where both the motional and internal degrees of freedom of the atoms are harnessed to efficiently implement quantum phase estimation as well as to simulate lattice gauge theory dynamics.

74 ATOMIC AND MOLECULAR PHYSICS↗

DOE OSTI2022

An Online Approach to Solve the Dynamic Vehicle Routing Problem with Stochastic Trip Requests for Paratransit Services

Many transit agencies operating paratransit and microtransit services have to respond to trip requests that arrive in real-time, which entails solving hard combinatorial and sequential decision-making problems under uncertainty. To avoid decisions that lead to significant inefficiency in the long term, vehicles should be allocated to requests by optimizing a non-myopic utility function or by batching requests together and optimizing a myopic utility function. While the former approach is typically offline, the latter can be performed online. We point out two major issues with such approaches when applied to paratransit services in practice. First, it is difficult to batch paratransit requests together as they are temporally sparse. Second, the environment in which transit agencies operate changes dynamically (e.g., traffic conditions can change over time), causing the estimates that are learned offline to become stale. To address these challenges, we propose a fully online approach to solve the dynamic vehicle routing problem (DVRP) with time windows and stochastic trip requests that is robust to changing environmental dynamics by construction. We focus on scenarios where requests are relatively sparse—our problem is motivated by applications to paratransit services. We formulate DVRP as a Markov decision process and use Monte Carlo tree search to evaluate actions for any given state. Accounting for stochastic requests while optimizing a non-myopic utility function is computationally challenging; indeed, the action space for such a problem is intractably large in practice. To tackle the large action space, we leverage the structure of the problem to design heuristics that can sample promising actions for the tree search. Our experiments using real-world data from our partner agency show that the proposed approach outperforms existing state-of-the-art approaches both in terms of performance and robustness.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

DOE OSTI2023

Extreme-scale stochastic optimization and simulation via learning-enhanced decomposition and parallelization (Final Technical Report)

Stochastic optimization and simulation models ubiquitously arise in designing and operating complex service/engineering systems. They can be extreme in scale due to high-dimensional data and decisions, and can also involve decisions made sequentially in response to newly revealed data, both causing significant computational challenge. The objective of this research is to explore a unified framework that integrates machine learning with discrete optimization and risk-averse modeling, to improve the efficiency of decomposition paradigms for stochastic optimization and simulations at extreme scale. The models we consider represent a broad class of complex decision-making problems, where 0-1 or continuous decisions are made before and/or after knowing multiple sources of uncertainties that could be correlated. We will employ machine learning methods to dynamically decide and prioritize computational procedures, including cut generation, branching, and bounding of the optimal objective. Furthermore, the research will shed new lights on the traditional decomposition algorithms for extreme-scale computing. Deliverables of the research include new modeling and computational methods for advancing the state-of-the-art research in optimization and simulation, bringing many relevant risk-averse, data-driven optimization problems in practice within the range of tractability. Examples include distributed computing server scheduling and sensor deployment for monitoring critical infrastructures. Success in this effort will enable progress in solving multiple extreme-scale problems in the complex system design and operations arising from DoE missions in energy, environment, and national security.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2019

A method to identify weak points of interconnection of renewable energy resources

The increasing penetration of renewable energy resources (RERs) is challenging power grid planning and operation in maintaining grid reliability. Potential power grid reliability and stability issues may arise when large-scale RERs are connected to a weak power grid. These issues may become more significant due to the mutual interactions among RERs that are interconnected electrically close through a power network. Weakness analysis based on grid strength assessment is useful for identifying the potential weak grid issues. However, when taking into account the impact of the interactions among RERs, the weakness analysis becomes computationally challenging. Different combinations of points of interconnections (POIs) of RERs may have different impacts on grid strength at each POI. Due to the combination nature, such weakness analysis may be time-consuming when identifying the weakest combination of POIs from a large number of potential candidates in realistic power grids. To address this concern, the impact of the power network structure on grid strength is analyzed in this paper. It is found that the impact mainly depends on the impedance ratios at POIs. The findings can be summarized as two criteria to develop a recursive method for fast identification of the weakest combination in this paper. The efficacy of the proposed method is demonstrated through case studies on the IEEE 39-bus system and a realistic power grid.

24 POWER TRANSMISSION AND DISTRIBUTION↗