Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computational optimization”

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

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

At least 1,459 records · Page 81

Ice storage model-predictive control in an office building with PV: scenario, error and sensitivity analysis

Thermal energy storage (TES) can enable more building-sited renewable electricity generation and lower utility bill costs for buildings owners and occupants, especially when there are high demand and variable time-of-use (TOU) charges. A model predictive control (MPC) strategy can offer additional savings over a schedule-based control with added complexity and reliance on forecasts. Here, this study examines savings for medium office buildings with chiller plants in three locations with building-installed solar photovoltaics (PV) to understand the impact of MPC. Control setpoints are fixed by a schedule-based control or optimized by nonlinear MPC. These control setpoints are actuated within EnergyPlus building models to simulate the utility cost of the chiller plant. NLP solutions can be unstable or unrealistic, but our results show that by regularizing the NLP, the solutions can be reasonably followed by the building model. MPC models make simplifications that lead to errors once the controller is participating in and changing the operation of the building. These errors average 9 % across the cases, showing that the most important parts of the system are represented. The no-thermal load costs are computed to show that the optimization can in some cases achieve both the minimum TOU and minimum monthly demand costs by demand management while reducing TOU energy costs by energy arbitrage. The MPC saves 35–66 % in the annual chiller plant operating costs, which is an additional savings above the schedule by 1–33 %. PV and TES are complementary and mostly independent, but a load with PV often results in better performance for the schedule. Our case study and sensitivity analysis show the importance of modeling and optimization for complex rates, but also the circumstances wherein a simpler strategy achieves the same performance with less potential for error.

14 SOLAR ENERGY↗

Real-Time Distributed Control of Smart Inverters for Network-level Optimization

The limitations of centralized optimization methods in managing electric power distribution systems operations have led to the distributed paradigm of computing and decision-making. Unfortunately, the existing distributed optimization algorithms are limited in their applicability to managing fast varying phenomena such as those resulting from highly variable Distributed Energy Resource (DER) generation patterns. They require a large number of communication rounds (in the order of 10 2 to 10 3 ) among the computing agents to solve one instance of the optimization problem. Related real-time distributed control methods are equally limited in their applications to power distribution systems with fast-changing DER generation; they require hundreds of rounds of communication and thus are slow in tracking the network-level optimal solutions. In this paper, we propose a novel distributed voltage controller that provides a fast-tracking of rapidly varying DER generation profiles while simultaneously converging to network-level optimal solutions within a few communication rounds. The proposed control algorithm leverages the radial topology of the system, which reduces the required communication rounds to reach the network-level optimum solution by order of magnitude. The novelty lies in carefully reducing the electrical network model from the perspective of each distributed controller and enabling appropriate data sharing among upstream and downstream nodes to achieve fast convergence. The simulation results demonstrate the effectiveness of the proposed approach in minimizing the feeder losses while maintaining the node voltage within the pre-specified limits.

voltage control, optimization, reactive power, inv↗

Integrating Analytical Solutions and U-Net Model for Predicting Groundwater Contaminant Plumes in Pump-and-Treat Systems

Pump-and-treat (P&T) is a common technique for groundwater remediation involving the extraction and treatment of contaminated water above ground. Optimizing the design and operation of the P&T well network is essential for maximizing the system’s effectiveness and efficiency. However, this optimization often necessitates many model evaluations, leading to computationally demanding tasks. This study introduces a novel approach that integrates analytical solutions for groundwater dynamics with the U-Net (Ronneberger et al., 2015) deep learning framework to predict groundwater contaminant plume migration under dynamic pumping conditions. By incorporating the Thiem equation (Thiem, 1906) into the input preprocessing, the U-Net model transforms sparse well data into a continuous spatial field that captures the hydraulic impacts of pumping activities. This integration enables the model to leverage both deep learning capabilities and classical physics-based groundwater theories, enhancing prediction accuracy and computational efficiency. These advancements can facilitate rapid, large-scale evaluations of P&T optimization simulations, allowing for timely and effective decision-making in well placement and system management. We demonstrate the model's robust performance across both simplified transient 2D models and a more complex 3D heterogeneous site model at the 200 West P&T facility at the Hanford Site. The U-Net-based model offers substantial computational advantages, reducing simulation times significantly compared to full physics-based models and providing a powerful tool for rapid site evaluation and P&T system optimization, such as evaluating alternative P&T well network designs. Our findings highlight the potential of advanced machine learning models to significantly enhance the efficiency and sustainability of groundwater remediation efforts, offering a novel application of U-Net architecture in environmental science.

Pump-and-treat↗

A deterministic method for PWR loading pattern optimization

A new deterministic approach to core loading optimization is presented. Selection of fuel enrichment and burnable poison (BP) arrangement in a pressurized water reactor (PWR) core are optimally determined subject to power peaking factor (PF) constraints. The deterministic approach is based on the method of Lagrange multipliers and the direct adjoining approach for the inequality power PF constraint. The optimality conditions are derived using calculus of variations resulting in the presence of jump conditions and a linear control Hamiltonian. The optimal control problems are addressed by simultaneously minimizing the Hamiltonian using the gradient method and performing Newton's method in different regions of the core to produce viable solutions for the controls. Without active control of the power profile in PWRs during depletion, our methodology is able to satisfy the power PF constraint at all times by proper loading selection at the beginning of cycle (BOC). This is achieved by promoting the proper burnup path forward in time during the calculation of the forward optimality conditions. Here this information is utilized in the adjoint burnup calculation, which acts to propagate the optimal control path back to the BOC during the calculation of the adjoint optimality conditions. The methodology has been developed into a new code DMCO (Deterministic Multi-Control Optimization) which can produce two-dimensional two-group depletion results in approximately seven minutes per optimization iteration on a personal computer. No application of heuristics is required and the code is capable of finding solutions from initial control distributions. A preliminary case study is presented for the Westinghouse AP600 first cycle fuel loading design which achieved an extended fuel cycle while satisfying power PF constraints.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Towards a self-driving trigger at the LHC: adaptive response in real time

Real-time data filtering and selection—or trigger—systems at high-throughput scientific facilities such as the experiments at the Large Hadron Collider must process extremely high-rate data streams under stringent bandwidth, latency, and storage constraints. Yet these systems are typically designed as static, hand-tuned menus of selection criteria grounded in prior knowledge and simulation. In this work, we further explore the concept of a self-driving trigger, an autonomous data-filtering framework that reallocates resources and adjusts thresholds dynamically in real-time to optimize signal efficiency, rate stability, and computational cost as instrumentation and environmental conditions evolve. We introduce a benchmark ecosystem to emulate realistic collider scenarios and demonstrate real-time optimization of a menu including canonical energy sum triggers as well as modern anomaly-detection algorithms that target non-standard event topologies using machine learning. Using simulated data streams and publicly available collision data from the Compact Muon Solenoid experiment, we demonstrate the capability to dynamically and automatically optimize trigger performance under specific cost objectives without manual retuning. Our adaptive strategy shifts trigger design from static menus with heuristic tuning to intelligent, automated, data-driven control, unlocking greater flexibility and discovery potential in future high-energy physics analyses.

Emami, Shaghayegh [Michigan U.] (ORCID:00090007589↗

Challenge Online Time Series Clustering For Demand Response A Theory to Break the ‘Curse of Dimensionality'

The advent of smart meters and advanced communication infrastructures catalyzes numerous smart grid applications such as dynamic demand response, and paves the way to solve challenging research problems in sustainable energy consumption. The space of solution possibilities are restricted primarily by the huge amount of generated data requiring considerable computational resources and efficient algorithms. To overcome this Big Data challenge, data clustering techniques have been proposed. Current approaches however do not scale in the face of the “increasing dimensionality” problem where a cluster point is represented by the entire customer consumption time series. To overcome this aspect we first rethink the way cluster points are created and designed, and then design an efficient online clustering technique for demand response (DR) in order to analyze high volume, high dimensional energy consumption time series data at scale, and on the fly. Our online algorithm is randomized in nature, and provides optimal performance guarantees in a computationally efficient manner. Unlike prior work we (i) study the consumption properties of the whole population simultaneously rather than developing individual models for each customer separately, claiming it to be a ‘killer’ approach that breaks the “curse of dimensionality” in online time series clustering, and (ii) provide tight performance guarantees in theory to validate our approach. Our insights are driven by the field of sociology, where collective behavior often emerges as the result of individual patterns and lifestyles.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Optimal Treatment Planning for Skull Base Chordoma: Photons, Protons, or a Combination of Both?

Purpose: We compared dosimetry of proton (PR), intensity modulated radiation therapy (IMRT) photon (PH), and combined PR and IMRT PH (PP) irradiation of skull base chordomas to determine the most optimal technique. Methods and Materials: Computed tomography simulation scans of 5 patients with skull base chordoma were used to generate four treatment plans: an IMRT PH plan with 1-mm planning target volume (PTV; PH1) for stereotactic treatment, an IMRT PH plan with 3-mm PTV (PH3) for routine treatment, a PR plan with beam-specific expansion margins on the clinical target volume, and a PP plan combining PR and PH treatment. All plans were prescribed 74 Gy/Cobalt Gray equivalents (CGE) to the PTV. To facilitate comparison, the primary objective of all plans was 95% or greater PTV prescribed dose coverage. Plans then were optimized to limit dose to normal tissues. Results: PTVs ranged from 4.4 to 36.7 cc in size (mean, 21.6 cc). Mean % PTV receiving 74 Gy was highest in the PP plans (98.4%; range, 96.5-99.2%) and lowest in the PH3 plans (96.1%; range, 95.1-96.7%). PR plans were the least homogeneous and conformal. PH3 plans had the highest mean % volume (V) of brain, brainstem, chiasm, and temporal lobes greater than tolerance doses. The PH1 plans had the lowest brainstem mean % V receiving 67 Gy (V{sub 67Gy}; 2.3 Gy; range, 0-7.8 Gy) and temporal lobe mean % V{sub 65Gy} (4.3 Gy; range, 0.1-7.7 Gy). Global evaluation of the plans based on objective parameters revealed that PH1 and PP plans were more optimal than either single-modality PR or PH3 plans. Conclusions: There are dosimetric advantages to using either PH1 or PP plans, with the latter yielding the best target coverage and conformality.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

PETSc/TAO Users Manual V.3.21

This manual describes the use of the Portable, Extensible Toolkit for Scientific Computation (PETSc) and the Toolkit for Advanced Optimization (TAO) for the numerical solution of partial differential equations (PDEs) and related problems on high-performance computers. PETSc/TAO is a suite of data structures and routines that provide the building blocks for implementing large-scale application codes on parallel (and serial) computers. PETSc uses the MPI standard for all distributed memory communication. PETSc/TAO includes a large suite of parallel linear solvers, nonlinear solvers, time integrators, and optimizers that may be used in application codes written in Fortran, C, C++, and Python (via petsc4py; see Getting Started ). The library is organized hierarchically, enabling users to employ the abstraction level most appropriate for a particular problem. By using techniques of object-oriented programming, PETSc provides enormous flexibility for users.

97 MATHEMATICS AND COMPUTING↗

Review of Shape and Topology Optimization for Design of Air-to-Refrigerant Heat Exchangers

Air-to-refrigerant heat exchangers (HXs) have been the topic of exhaustive research as they are fundamental components of HVAC&R systems. It has been well-established that the large airside thermal resistance dominates the HX thermal resistance, and thus significant research efforts have focused on improving the air-side performance of these heat exchangers. As HXs continue to become more compact, thermal resistance reduction is typically realized through the utilization of extended secondary heat transfer surfaces such as fins. However, past research has shown that the thermal-hydraulic trade-offs provided by fins are often not attractive enough to warrant their use, especially for small diameter tubes. Yet, the inadequate primary surface area provided by compact HXs essentially mandate the necessity of fins to meet thermal resistance requirements. In recent years, advancements in computational tools such as Computational Fluid Dynamics (CFD) and optimization algorithms, coupled with the advent of additive manufacturing technologies, have allowed engineers to expand conventional HX design ideologies to include such concepts as shape and topology optimization. This lends itself directly to primary heat transfer surface optimization and even the potential removal of finned surfaces altogether. This paper presents a comprehensive literature review investigating air-to-refrigerant HX shape and topology optimization. The fundamentals of both shape and topology optimization, model development, and experimental validations are all separately discussed. Studies featuring manufactured prototypes and/or experimentally validated optimal designs are treated with additional emphasis. This paper concludes by identifying key research gaps and proposing future research directions for HX shape and topology optimization.

42 ENGINEERING↗

Simple formalism for efficient derivatives and multi-determinant expansions in quantum Monte Carlo

We present a simple and general formalism to compute efficiently the derivatives of a multi-determinant Jastrow-Slater wave function, the local energy, the interatomic forces, and similar quantities needed in quantum Monte Carlo. Through a straightforward manipulation of matrices evaluated on the occupied and virtual orbitals, we obtain an efficiency equivalent to algorithmic differentiation in the computation of the interatomic forces and the optimization of the orbital parameters. Furthermore, for a large multi-determinant expansion, the significant computational gain afforded by a recently introduced table method is here extended to the local value of any one-body operator and to its derivatives, in both all-electron and pseudopotential calculations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Individually optimized uniform contrast enhancement in CT angiography for the diagnosis of pulmonary thromboembolic disease—A simulation study

Purpose: To improve the diagnostic quality of CT pulmonary angiography (CTPA) by individually optimizing a biphasic contrast injection function to achieve targeted uniform contrast enhancement. To compare the results against a previously reported discrete Fourier transform (DFT) approach. Methods: This simulation study used the CTPA datasets of 27 consecutive patients with pulmonary thromboembolic disease (PE). An optimization approach was developed consisting of (1) computation of the impulse enhancement function (IEF) based on a test bolus scan, and (2) optimization of a biphasic contrast injection function using the IEF in order to achieve targeted uniform enhancement. The injection rates and durations of a biphasic contrast injection function are optimized by minimizing the difference between the resulting contrast enhancement curve and the targeted uniform enhancement curve, while conforming to the clinical constraints of injection rate and total contrast volume. The total contrast volume was limited first to the clinical standard of 65 ml, and then to the same amount used in the DFT approach for comparison. The optimization approach and the DFT approach were compared in terms of the root mean square error (RMSE) and total contrast volume used. Results: When the total contrast volume was limited to 65 ml, the optimization approach produced significantly better contrast enhancement (closer to the targeted uniform contrast enhancement) than the DFT approach (RMSE 17 HU vs 56 HU,p < 0.00001). On average, the optimization approach used 63 ml contrast, while the DFT approach used 50 ml with four patients exceeding 65 ml. When equivalent total contrast volume was used for individual patient, the optimization approach still generated significantly better contrast enhancement (RMSE 44 HU vs 56 HU, p < 0.01). Constraints for the injection function could be easily accommodated into the optimization process when searching for the optimal biphasic injection function. Conclusions: The optimization approach generated individually optimized biphasic injection functions yielding significantly better contrast enhancement compared to the DFT approach. This new approach has the potential to improve the diagnostic quality of CTPA for PE.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

MLPF: efficient machine-learned particle-flow reconstruction using graph neural networks

In general-purpose particle detectors, the particle-flow algorithm may be used to reconstruct a comprehensive particle-level view of the event by combining information from the calorimeters and the trackers, significantly improving the detector resolution for jets and the missing transverse momentum. In view of the planned high-luminosity upgrade of the CERN Large Hadron Collider (LHC), it is necessary to revisit existing reconstruction algorithms and ensure that both the physics and computational performance are sufficient in an environment with many simultaneous proton–proton interactions (pileup). Machine learning may offer a prospect for computationally efficient event reconstruction that is well-suited to heterogeneous computing platforms, while significantly improving the reconstruction quality over rule-based algorithms for granular detectors. We introduce MLPF, a novel, end-to-end trainable, machine-learned particle-flow algorithm based on parallelizable, computationally efficient, and scalable graph neural network optimized using a multi-task objective on simulated events. We report the physics and computational performance of the MLPF algorithm on a Monte Carlo dataset of top quark–antiquark pairs produced in proton–proton collisions in conditions similar to those expected for the high-luminosity LHC. The MLPF algorithm improves the physics response with respect to a rule-based benchmark algorithm and demonstrates computationally scalable particle-flow reconstruction in a high-pileup environment.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Distributed quantum approximate optimization algorithm on a quantum-centric supercomputing architecture

Quantum approximate optimization algorithm (QAOA) has shown promise in solving combinatorial optimization problems by providing quantum speedup on near-term gate-based quantum computing systems. However, QAOA faces challenges for high-dimensional problems due to the large number of qubits required and the complexity of deep circuits, limiting its scalability for real-world applications. In this study, we present a distributed QAOA (DQAOA), which leverages distributed computing strategies to decompose a large computational workload into smaller tasks that require fewer qubits and shallower circuits than are necessary to solve the original problem. These sub-problems are processed using a combination of high-performance and quantum computing resources. The global solution is iteratively updated by aggregating sub-solutions, allowing convergence toward the optimal solution. We demonstrate that DQAOA can handle considerably large-scale optimization problems (e.g., 1000-bit problem), achieving a high solution quality and short time-to-solution, outperforming existing strategies. Furthermore, we realize DQAOA on a quantum-centric supercomputing architecture, paving the way for practical applications of gate-based quantum computers in real-world optimization tasks. To extend DQAOA’s applicability to materials science, we further develop an active learning algorithm integrated with our DQAOA (AL-DQAOA), which involves machine learning, DQAOA, and active data production in an iterative loop. We successfully optimize photonic structures using AL-DQAOA, indicating that solving real-world optimization problems using gate-based quantum computing is feasible. We expect the proposed DQAOA to be applicable to a wide range of optimization problems and AL-DQAOA to find broader applications in material design.

Kim, Seongmin [ORNL] (ORCID:0000000159063004)↗

Computer-aided classification of suspicious pigmented lesions using wide-field images

Early identification of melanoma is conducted through whole-body visual examinations to detect suspicious pigmented lesions, a situation that fluctuates in accuracy depending on the experience and time of the examiner. Computer-aided diagnosis tools for skin lesions are typically trained using pre-selected single-lesion images, taken under controlled conditions, which limits their use in wide-field scenes. Here, we propose a computer-aided classifier system with such input conditions to aid in the rapid identification of suspicious pigmented lesions at the primary care level. 133 patients with a multitude of skin lesions were recruited for this study. All lesions were examined by a board-certified dermatologist and classified into “suspicious” and “non-suspicious”. A new clinical database was acquired and created by taking Wide-Field images of all major body parts with a consumer-grade camera under natural illumination condition and with a consistent source of image variability. 3–8 images were acquired per patient on different sites of the body, and a total of 1759 pigmented lesions were extracted. A machine learning classifier was optimized and build into a computer aided classification system to binary classify each lesion using a suspiciousness score. In a testing set, our computer-aided classification system achieved a sensitivity of 100% for suspicious pigmented lesions that were later confirmed by dermoscopy examination (“SPL_A”) and 83.2% for suspicious pigmented lesions that were not confirmed after examination (“SPL_B”). Sensitivity for non-suspicious lesions was 72.1%, and accuracy was 75.9%. With these results we defined a suspiciousness score that is aligned with common macro-screening (naked eye) practices. This work demonstrates that wide-field photography combined with computer-aided classification systems can distinguish suspicious from non-suspicious pigmented lesions, and might be effective to assess the severity of a suspicious pigmented lesions. We believe this approach could be useful to support skin screenings at a population-level.

60 APPLIED LIFE SCIENCES↗

Yet another parameter-free shape optimization method

The use of node coordinates as design variables in shape optimization offers a larger design space than computer-aided design (CAD)-based shape parameterizations. It also allows for the optimization of legacy designs, i.e., a finite element mesh from an existing design can be readily optimized to meet new performance requirements without involving a CAD model. However, it is well known that the node coordinate parameterization method is fraught with numerical difficulties, which makes it impractical to use. This has led to several of “parameter-free” shape optimization methods that seek the advantages and avoid the pitfalls of the naïve node coordinate parameterization method. These methods come in two main varieties: sensitivity filtering (or gradient smoothing) and consistent filtering. The latter is analogous to the density filter method used in topology optimization (TO). In this work, we use the PDE filter from TO and energy-based filters to implement consistent shape optimization filtering schemes easily and efficiently. Numerical experiments demonstrate that consistent methods are more robust than sensitivity filtering methods.

42 ENGINEERING↗

Stability of solution mappings for parametric bilevel vector equilibrium problems

In this paper, we first revisit the parametric bilevel vector equilibrium problems in Hausdorff topological vector spaces. Then we study the stability conditions such as (Hausdorff) upper semicontinuity, (Hausdorff) lower semicontinuity, outer-continuity and outer-openness of solutions for such problems. Many examples are provided to illustrate the essentialness of the imposed assumptions. For the applications, we obtain the stability results for the parametric vector variational inequality problems with equilibrium constraints and parametric vector optimization problems with equilibrium constraints.

97 MATHEMATICS AND COMPUTING↗

Integrated dynamic policy management methodology and system for strategic environmental assessment of golf course installation policy in Taiwan

Strategic environmental assessment (SEA) focuses primarily on assessing how policies, plans, and programs (PPPs) influence the sustainability of the involved regions. However, the processes of assessing policies and developing management strategies for pollution load and resource use are usually separate in the current SEA system. This study developed a policy management methodology to overcome the defects generated during the above processes. This work first devised a dynamic management framework using the methods of systems thinking, system dynamics, and Managing for Results (MFRs). Furthermore, a driving force-pressure-state-impact-response (DPSIR) indicator system was developed. The golf course installation policy was applied as a case study. Taiwan, counties of Taiwan, and the golf courses within those individual counties were identified as a system, subsystems, and objects, respectively. This study identified an object-linked double-layer framework with multi-stage-option to simultaneously to quantify golf courses in each subsystem and determine ratios of abatement and allocation for pollution load and resource use of each golf course. The DPSIR indicator values for each item of each golf course in each subsystem are calculated based on the options taken in the two decision layers. The summation of indicator values for all items of all golf courses in all subsystems according to various options is defined as the sustainability value of the policy. An optimization model and a system (IDPMS) were developed to obtain the greatest sustainability value of the policy, while golf course quantity, human activity intensity, total quantities of pollution load and resource use are simultaneously obtained. The solution method based on enumeration of multiple bounds for objectives and constraints (EMBOC) was developed for the problem with 1.95 x 10{sup 128} combinations of possible options to solve the optimal solution in ten minutes using a personal computer with 3.0 GHz CPU. This study obtain the policy with the optimal environmental sustainability value in Taiwan is 102 golf courses. Human activity intensity and total quantities of pollution load and resource use which are concurrently obtained are less than those of the existing policy and the existing quantities in 2006. The optimal solution remains unchanged under most sensitivity analysis conditions, unless the weights and constraints are extremely changed. The analytical results indicate that the proposed methodology can be used to assist the authorities for simultaneously generating and assessing the policy during the SEA process.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗