Search NASA⌕ Search

SEARCH · Search NASA

Results for “Network 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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Network Optimization of the Electrosynthesis of Chemicals from CO2

Carbon dioxide electroreduction (ECO2R) is gaining attention due to its capacity to mitigate CO2 emissions while using electricity that would otherwise be curtailed. Its foreseeable industrial implementation requires of holistic methods to assess the technological and economic performance of ECO2R processes and integrate them in current chemical supply chains and power systems. Here, we combine techno-economic assessment and mathematical programming to find the optimal paths to electroreduce CO2 into valuable chemicals under variable electricity prices. The proposed approach is tested with a case study addressing the CO2 capture from flue gas or direct air and its electricity-powered reduction into carbon monoxide, formic acid or multi-carbon compounds. The results obtained demonstrate the ability of the framework to build ECO2R networks and provide operation profiles that respond to fluctuating electricity prices.

carbon dioxide↗
DOE OSTI2025

Data-Driven Method for Groundwater-Level Mapping and Monitoring-Well Network Optimization at Hanford

This report summarizes the initial results and outcomes of a physics-informed, data-driven groundwater level (GWL) mapping capability for the Hanford Site. GWL mapping at Hanford is typically conducted annually and requires a significant amount of computational and expert resources, and it does not allow assessment of the informational value of specific monitoring wells. The proposed method produces spatially and temporally resolved fields consistent with sparse, irregularly sampled, and nonuniformly distributed well measurements. Implemented successfully, this capability will allow rapid mapping of groundwater levels and provide an opportunity to optimize monitoring activities (both location and sampling frequency) based on data information value evaluation. The approach integrates a diffusion-based generative model – trained on MODFLOW simulation data from the Plateau-to-River (P2R) model – with score-based data assimilation (SDA), allowing observation-conditioned mapping without retraining for each monitoring-network layout.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2026

Bridging Cloud and Edge Computing at NREL Using CONNECT: Cloud Optimized Networking for Next-Gen Edge Computing Technologies [Slides]

CONNECT is an innovative on-premise hardware and software solution that integrates edge and cloud computing infrastructure at NREL. Built on the AWS Greengrass middleware and leveraging the MQTT protocol, CONNECT enables real-time data streaming from IoT devices and gateways to both cloud and local services, empowering researchers to rapidly capture, analyze, and act upon edge-generated data while leveraging cloud capabilities. The platform addresses research infrastructure challenges by providing a pre-approved platform which is already configured with the correct networking and cybersecurity baselines thus eliminating procurement delays and enabling on-demand availability. CONNECT's hybrid architecture efficiently manages burstable workloads, allowing research teams to dynamically scale computational capacity, handle peak data loads, and reduce operational bottlenecks. Advanced capabilities include built-in GPU support for executing machine learning models which enables low-latency inference at the edge from models trained in the cloud. This architecture supports real-time analytics and filtering, providing a mechanism to allow only transmitting and processing high-value data. Cloud-based configuration management permits engineers to manage on-premise systems remotely, optimizing operational efficiency. By bridging edge and cloud computing, CONNECT provides NREL researchers with a flexible, scalable platform that accelerates scientific discovery while maintaining robust security and performance standards.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Optimizing Transportation Networks for E-Waste Reverse Logistics: A Multi-Modal Cost Allocation and Pricing Strategy

The exponential growth of electronic waste (e-waste) poses critical challenges for sustainable reverse logistics and transportation network optimization. This study develops a dual-channel transportation framework for e-waste logistics that integrates dynamic freight pricing, cost allocation mechanisms, and game-theoretic coordination. The model captures interactions between centralized hubs and distributed processing networks, accounting for freight rate elasticity, volume allocation, and capacity constraints. Using Stackelberg game theory and cost-sharing strategies, the framework optimizes transportation efficiency and profit distribution across logistics channels. Numerical simulations show that the dual-channel structure increases centralized hub profit by 226.8% compared to baseline single-channel operations, while boosting total transported volume by 1.2% and nearly doubling freight collector profit under cost-sharing. Scenario analyses across regional infrastructures reveal that network density, policy incentives, and logistics costs shape routing efficiency and profit allocation. These findings suggest that coordinated strategies combining dynamic pricing, targeted infrastructure investment, and strategic cost allocation are needed to design efficient, resilient, and regionally adaptable e-waste transportation systems.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
NASA NTRS2002

Prediction of Aerodynamic Coefficients for Wind Tunnel Data using a Genetic Algorithm Optimized Neural Network

A fast, reliable way of predicting aerodynamic coefficients is produced using a neural network optimized by a genetic algorithm. Basic aerodynamic coefficients (e.g. lift, drag, pitching moment) are modelled as functions of angle of attack and Mach number. The neural network is first trained on a relatively rich set of data from wind tunnel tests of numerical simulations to learn an overall model. Most of the aerodynamic parameters can be well-fitted using polynomial functions. A new set of data, which can be relatively sparse, is then supplied to the network to produce a new model consistent with the previous model and the new data. Because the new model interpolates realistically between the sparse test data points, it is suitable for use in piloted simulations. The genetic algorithm is used to choose a neural network architecture to give best results, avoiding over-and under-fitting of the test data.

Rajkumar, T.↗
NASA NTRS2019

Study network-related optimization problems using quantum alternating optimization ansatz

Network-related connectivity optimization problems are underlying a wide range of applications and are also of high computational complexity. We consider studying network optimization problems using two types of quantum heuristics. One is quantum annealing, and the other Quantum Alternating Operator Ansatz, an extension of the Quantum Approximate Optimization Algorithms for gate-model quantum computation, in which a cost-function based unitary and a non-commuting mixing unitary are applied alternately. We present problem mappings for problems of finding the spanning-tree or spanning-graph of a graph that optimizes certain costs, and a variant that further requires the spanning-tree be degree-bounded. With quantum annealing, all constraints are cast into penalty terms in the cost Hamiltonian, and the solution is encoded as the ground state of the Hamiltonian. We provide three mappings to the quadratic unconstrained binary optimization (QUBO) form, compare the resource requirements, and analyze the tradeoffs. For QAOA, we give special focus on the design of mixers based on the constraints presented in the problem, such that the system evolution remains in a subspace of the full Hilbert space where all constraints are satisfied. In the spanning-tree problem, one such hard constraint is that a mixer applied to a spanning-tree needs also be a spanning tree. This involves checking the connectivity of a subgraph, which is a global condition common for most network-related problems. We show how this feature can be efficiently represented in the mixer in a quantum coherent way, based on manipulation of a descendant-matrix and an adjacent matrix. We further develop a mixer for the spanning-graphs based on the spanning-tree mixer.

Zhihui Wang↗
NASA NTRS2001

A Closed-Loop Optimal Neural-Network Controller to Optimize Rotorcraft Aeromechanical Behaviour: Output from Two Sample Cases - Volume 2

A closed-loop optimal neural-network controller technique was developed to optimize rotorcraft aeromechanical behaviour. This technique utilities a neural-network scheme to provide a general non-linear model of the rotorcraft. A modem constrained optimisation method is used to determine and update the constants in the neural-network plant model as well as to determine the optimal control vector. Current data is read, weighted, and added to a sliding data window. When the specified maximum number of data sets allowed in the data window is exceeded, the oldest data set is and the remaining data sets are re-weighted. This procedure provides at least four additional degrees-of-freedom in addition to the size and geometry of the neural-network itself with which to optimize the overall operation of the controller. These additional degrees-of-freedom are: 1. the maximum length of the sliding data window, 2. the frequency of neural-network updates, 3. the weighting of the individual data sets within the sliding window, and 4. the maximum number of optimisation iterations used for the neural-network updates.

Leyland, Jane Anne↗
NASA NTRS1987

Optimal Network-Topology Design

Candidate network designs tested for acceptability and cost. Optimal Network Topology Design computer program developed as part of study on topology design and analysis of performance of Space Station Information System (SSIS) network. Uses efficient algorithm to generate candidate network designs consisting of subsets of set of all network components, in increasing order of total costs and checks each design to see whether it forms acceptable network. Technique gives true cost-optimal network and particularly useful when network has many constraints and not too many components. Program written in PASCAL.

Li, Victor O. K.↗
NASA NTRS2019

Exploring Network-Related Optimization Problems Using Quantum Heuristics

Network-related connectivity optimization problems are underlying a wide range of applications and are also of high computational complexity. We consider studying network optimization problems using two types of quantum heuristics.One is quantum annealing, and the other Quantum Alternating Operator Ansatz, an extension of the Quantum Approximate Optimization Algorithms for gate-model quantum computation, in which a cost-function based unitary and a non-commuting mixing unitary are applied alternately. We present problem mappings for problems of finding the spanning-tree or spanning-graph of a graph that optimizes certain costs, and a variant that further requires the spanning-tree be degree-bounded. With quantum annealing, all constraints are cast into penalty terms in the cost Hamiltonian, and the solution is encoded as the ground state of the Hamiltonian. We provide three mappings to the quadratic unconstrained binary optimization (QUBO) form, compare the resource requirements, and analyze the tradeoffs. For QAOA, we give special focus on the design of mixers based on the constraints presented in the problem, such that the system evolution remains in a subspace of the full Hilbert space where all constraints are satisfied. In the spanning-tree problem, one such hard constraint is that a mixer applied to a spanning-tree needs also be a spanning tree. This involves checking the connectivity of a subgraph, which is a global condition common for most network-related problems. We show how this feature can be efficiently represented in the mixer in a quantum coherent way, based on manipulation of a descendant-matrix and an adjacent matrix. We further develop a mixer for the spanning-graphs based on the spanning-tree mixer.

Wang, Zhihui↗
DOE OSTI2024

Networked Microgrids Optimization

This project is mainly about the operation optimization of three networked microgrids (MG), including centralized optimization and distributed optimization. The alternating direction method of multipliers (ADMM) algorithm is used for distributed optimization. In the distribution network considered here, there is a Distribution Management system (DMS) as the system coordinator and several networked microgrids. In grid-connected mode, power could be imported or exported at the distribution substation bus according to the utility rate, and the exchanged power at point of common coupling (PCC) of any microgrid has a limitation. In islanded mode, the power imports/exports at the distribution substation are zero. In both grid-connected and islanded mode, the distribution substation is taken as a slack bus with fixed voltage magnitude.

Chen, Yang [Oak Ridge National Laboratory (ORNL), ↗
NASA NTRS2001

A Closed-Loop Optimal Neural-Network Controller to Optimize Rotorcraft Aeromechanical Behaviour: Theory and Methodology - Volume 1

Given the predicted growth in air transportation, the potential exists for significant market niches for rotary wing subsonic vehicles. Technological advances which optimise rotorcraft aeromechanical behaviour can contribute significantly to both their commercial and military development, acceptance, and sales. Examples of the optimisation of rotorcraft aeromechanical behaviour which are of interest include the minimisation of vibration and/or loads. The reduction of rotorcraft vibration and loads is an important means to extend the useful life of the vehicle and to improve its ride quality. Although vibration reduction can be accomplished by using passive dampers and/or tuned masses, active closed-loop control has the potential to reduce vibration and loads throughout a.wider flight regime whilst requiring less additional weight to the aircraft man that obtained by using passive methads. It is ernphasised that the analysis described herein is applicable to all those rotorcraft aeromechanical behaviour optimisation problems for which the relationship between the harmonic control vector and the measurement vector can be adequately described by a neural-network model.

Leyland, Jane Anne↗
DOE OSTI2025

Analysis and optimization of seismic monitoring networks with Bayesian optimal experimental design

SUMMARY Monitoring networks increasingly aim to assimilate data from a large number of diverse sensors covering many sensing modalities. Bayesian optimal experimental design (OED) seeks to identify data, sensor configurations or experiments which can optimally reduce uncertainty and hence increase the performance of a monitoring network. Information theory guides OED by formulating the choice of experiment or sensor placement as an optimization problem that maximizes the expected information gain (EIG) about quantities of interest given prior knowledge and models of expected observation data. Therefore, within the context of seismo-acoustic monitoring, we can use Bayesian OED to configure sensor networks by choosing sensor locations, types and fidelity in order to improve our ability to identify and locate seismic sources. In this work, we develop the framework necessary to use Bayesian OED to optimize a sensor network’s ability to locate seismic events from arrival time data of detected seismic phases at the regional-scale. This framework requires five elements: (i) A likelihood function that describes the distribution of detection and traveltime data from the sensor network, (ii) A prior distribution that describes a priori belief about seismic events, (iii) A Bayesian solver that uses a prior and likelihood to identify the posterior distribution of seismic events given the data, (iv) An algorithm to compute EIG about seismic events over a data set of hypothetical prior events, (v) An optimizer that finds a sensor network which maximizes EIG. Once we have developed this framework, we explore many relevant questions to monitoring such as: how to trade off sensor fidelity and earth model uncertainty; how sensor types, number and locations influence uncertainty; and how prior models and constraints influence sensor placement.

58 GEOSCIENCES↗
DOE OSTI2022

Optimizing neural networks

A system and method design and optimize neural networks. The system and method include a data store that stores a plurality of gene vectors that represent diverse and distinct neural networks and an evaluation queue stored with the plurality of gene vectors. Secondary nodes construct, train, and evaluate the neural network and automatically render a plurality of fitness values asynchronously. A primary node executes a gene amplification on a select plurality of gene vectors, a crossing-over of the amplified gene vectors, and a mutation of the crossing-over gene vectors automatically and asynchronously, which are then transmitted to the evaluation queue. The process continuously repeats itself by processing the gene vectors inserted into the evaluation queue until a fitness level is reached, a network's accuracy level plateaus, a processing time period expires, or when some stopping condition or performance metric is met or exceeded.

97 MATHEMATICS AND COMPUTING↗