Search NASA⌕ Search

SEARCH · Search NASA

Results for “solution 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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

Network Community Detection on Small Quantum Computers

In recent years, a number of quantum computing devices with small numbers of qubits have become available. A hybrid quantum local search (QLS) approach that combines a classical machine and a small quantum device to solve problems of practical size is presented. Herein, the proposed approach is applied to the network community detection problem. QLS is hardware-agnostic and easily extendable to new quantum computing devices as they become available. It is demonstrated to solve the 2-community detection problem on graphs of sizes of up to 410 vertices using the 16-qubit IBM quantum computer and D-Wave 2000Q, and compare their performance with the optimal solutions. The results herein demonstrate that QLS performs similarly in terms of quality of the solution and the number of iterations to convergence on both types of quantum computers and it is capable of achieving results comparable to state-of-the-art solvers in terms of quality of the solution including reaching the optimal solutions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Linear convergence of accelerated conditional gradient algorithms in spaces of measures

A class of generalized conditional gradient algorithms for the solution of optimization problem in spaces of Radon measures is presented. The method iteratively inserts additional Dirac-delta functions and optimizes the corresponding coefficients. Under general assumptions, a sub-linear [see formula in PDF] rate in the objective functional is obtained, which is sharp in most cases. To improve efficiency, one can fully resolve the finite-dimensional subproblems occurring in each iteration of the method. We provide an analysis for the resulting procedure: under a structural assumption on the optimal solution, a linear [see formula in PDF] convergence rate is obtained locally.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS1986

A hybrid nonlinear programming method for design optimization

Solutions to engineering design problems formulated as nonlinear programming (NLP) problems usually require the use of more than one optimization technique. Moreover, the interaction between the user (analysis/synthesis) program and the NLP system can lead to interface, scaling, or convergence problems. An NLP solution system is presented that seeks to solve these problems by providing a programming system to ease the user-system interface. A simple set of rules is used to select an optimization technique or to switch from one technique to another in an attempt to detect, diagnose, and solve some potential problems. Numerical examples involving finite element based optimal design of space trusses and rotor bearing systems are used to illustrate the applicability of the proposed methodology.

Rajan, S. D.↗
NASA NTRS1992

Analytical guidance law development for aerocapture at Mars

During the first part of this reporting period research has concentrated on performing a detailed evaluation, to zero order, of the guidance algorithm developed in the first period taking the numerical approach developed in the third period. A zero order matched asymptotic expansion (MAE) solution that closely satisfies a set of 6 implicit equations in 6 unknowns to an accuracy of 10(exp -10), was evaluated. Guidance law implementation entails treating the current state as a new initial state and repetitively solving the MAE problem to obtain the feedback controls. A zero order guided solution was evaluated and compared with optimal solution that was obtained by numerical methods. Numerical experience shows that the zero order guided solution is close to optimal solution, and that the zero order MAE outer solution plays a critical role in accounting for the variations in Loh's term near the exit phase of the maneuver. However, the deficiency that remains in several of the critical variables indicates the need for a first order correction. During the second part of this period, methods for computing a first order correction were explored.

Calise, A. J.↗
DOE OSTI2026

Optimizing pressurized-water reactor equilibrium cycle using a novel loading pattern encoding and rule-based genetic crossover operators

This work presents an extended multi-batch approach applied in shuffling scheme optimization for equilibrium cycle for pressurized water reactors using Genetic Algorithms (GAs). A new ruled based GA crossover operator called Inherited Location and Batch (ILB) was introduced to enhance offsprings reproduction efficiency specialized for equilibrium cycle optimization problem. This approach was implemented within the Plant ReLoad Optimization (PRLO) framework and validated using a generic reactor model based on the AP1000 design, with core parameters calculated via the CASMO/SIMULATE software package. The ILB approach is then applied for both single and multi-objective problems in maximizing cycle length and core average exposure while minimizing the average enrichment of the 57 fresh fuel assemblies (FAs) per cycle. The optimal solutions are selected based on their dominance to the objectives from all feasible solutions. This research identified three optimal solutions satisfied safety constraints: The first solution minimizes feed enrichment costs with a cycle length of 338.8 days and core exposure of 25.39 MWd/MT; the second solution extends cycle length to 361.2 days, with the highest core exposure of 26.84 MWd/MT, using 3.75 wt% average fuel enrichment; the third solution balances both objectives with a cycle length of 349.6 days, core exposure of 25.82 MWd/MT with a slight enrichment increase compared to the first solution. Collectively, these findings underscore the efficiency and effectiveness of the proposed approach in achieving practical multi-objective optimal equilibrium cycle designs using GAs optimizer.

11 - NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2019

Bang-Bang Theorem for a Coupled ODE-PDE Control System

An optimal control problem for a system of one dimensional hyperbolic conservation laws is considered. The system is controlled through the boundary condition, which depends on the state of a nonlinear control system. It is proven that the problem has an optimal solution; moreover, it admits ε-optimal solutions generated by bang-bang controls. Bibliography: 8 titles. Illustrations: 1 figure.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2012

Recursive Branching Simulated Annealing Algorithm

This innovation is a variation of a simulated-annealing optimization algorithm that uses a recursive-branching structure to parallelize the search of a parameter space for the globally optimal solution to an objective. The algorithm has been demonstrated to be more effective at searching a parameter space than traditional simulated-annealing methods for a particular problem of interest, and it can readily be applied to a wide variety of optimization problems, including those with a parameter space having both discrete-value parameters (combinatorial) and continuous-variable parameters. It can take the place of a conventional simulated- annealing, Monte-Carlo, or random- walk algorithm. In a conventional simulated-annealing (SA) algorithm, a starting configuration is randomly selected within the parameter space. The algorithm randomly selects another configuration from the parameter space and evaluates the objective function for that configuration. If the objective function value is better than the previous value, the new configuration is adopted as the new point of interest in the parameter space. If the objective function value is worse than the previous value, the new configuration may be adopted, with a probability determined by a temperature parameter, used in analogy to annealing in metals. As the optimization continues, the region of the parameter space from which new configurations can be selected shrinks, and in conjunction with lowering the annealing temperature (and thus lowering the probability for adopting configurations in parameter space with worse objective functions), the algorithm can converge on the globally optimal configuration. The Recursive Branching Simulated Annealing (RBSA) algorithm shares some features with the SA algorithm, notably including the basic principles that a starting configuration is randomly selected from within the parameter space, the algorithm tests other configurations with the goal of finding the globally optimal solution, and the region from which new configurations can be selected shrinks as the search continues. The key difference between these algorithms is that in the SA algorithm, a single path, or trajectory, is taken in parameter space, from the starting point to the globally optimal solution, while in the RBSA algorithm, many trajectories are taken; by exploring multiple regions of the parameter space simultaneously, the algorithm has been shown to converge on the globally optimal solution about an order of magnitude faster than when using conventional algorithms. Novel features of the RBSA algorithm include: 1. More efficient searching of the parameter space due to the branching structure, in which multiple random configurations are generated and multiple promising regions of the parameter space are explored; 2. The implementation of a trust region for each parameter in the parameter space, which provides a natural way of enforcing upper- and lower-bound constraints on the parameters; and 3. The optional use of a constrained gradient- search optimization, performed on the continuous variables around each branch s configuration in parameter space to improve search efficiency by allowing for fast fine-tuning of the continuous variables within the trust region at that configuration point.

Bolcar, Matthew↗
NASA NTRS2006

Orbit design and optimization based on global telecommunication performance metrics

The orbit selection of telecommunications orbiters is one of the critical design processes and should be guided by global telecom performance metrics and mission-specific constraints. In order to aid the orbit selection, we have coupled the Telecom Orbit Analysis and Simulation Tool (TOAST) with genetic optimization algorithms. As a demonstration, we have applied the developed tool to select an optimal orbit for general Mars telecommunications orbiters with the constraint of being a frozen orbit. While a typical optimization goal is to minimize tele-communications down time, several relevant performance metrics are examined: 1) area-weighted average gap time, 2) global maximum of local maximum gap time, 3) global maximum of local minimum gap time. Optimal solutions are found with each of the metrics. Common and different features among the optimal solutions as well as the advantage and disadvantage of each metric are presented. The optimal solutions are compared with several candidate orbits that were considered during the development of Mars Telecommunications Orbiter.

genetic algorithms↗
NASA NTRS1978

Optimal analytic rendezvous using Clohessy-Wiltshire equations

The optimal solution time that minimizes the sum of the two applied impulses necessary to rendezvous is obtained analytically for the Clohessy-Wiltshire equations with a linear gravity model assumption. A plume impingement inequality constraint on the solution is examined, and an optimal policy is developed. Numerical tests are conducted to verify the analysis and to illustrate the optimal solution algorithm.

Jezewski, D. J.↗
NASA NTRS1979

An analytic approach to optimal rendezvous using Clohessy-Wiltshire equations

An analytic approach is used to obtain the optimal solution time that minimizes the sum of the two applied impulses necessary to rendezvous for the Clohessy-Wiltshire equations. A plume impingement inequality constraint on the solution is examined, and an optimal policy is developed. Numerical tests are conducted to verify the analysis and to illustrate the optimal solution algorithm.

Jezewski, D. J.↗
NASA NTRS2010

Tuning Parameters in Heuristics by Using Design of Experiments Methods

With the growing complexity of today's large scale problems, it has become more difficult to find optimal solutions by using exact mathematical methods. The need to find near-optimal solutions in an acceptable time frame requires heuristic approaches. In many cases, however, most heuristics have several parameters that need to be "tuned" before they can reach good results. The problem then turns into "finding best parameter setting" for the heuristics to solve the problems efficiently and timely. One-Factor-At-a-Time (OFAT) approach for parameter tuning neglects the interactions between parameters. Design of Experiments (DOE) tools can be instead employed to tune the parameters more effectively. In this paper, we seek the best parameter setting for a Genetic Algorithm (GA) to solve the single machine total weighted tardiness problem in which n jobs must be scheduled on a single machine without preemption, and the objective is to minimize the total weighted tardiness. Benchmark instances for the problem are available in the literature. To fine tune the GA parameters in the most efficient way, we compare multiple DOE models including 2-level (2k ) full factorial design, orthogonal array design, central composite design, D-optimal design and signal-to-noise (SIN) ratios. In each DOE method, a mathematical model is created using regression analysis, and solved to obtain the best parameter setting. After verification runs using the tuned parameter setting, the preliminary results for optimal solutions of multiple instances were found efficiently.

Arin, Arif↗
DOE OSTI2021

Extended convex hull-based distributed optimal energy flow of integrated electricity-gas systems

Integrated electricity and gas systems are constructed to facilitate the gas-fired generation, and the distributed operation of these integrated systems have received much attention due to the increased emphasis on data security and privacy between different agencies. This paper proposes an extended convex hull based method to address optimal energy flow problems for the integrated electricity and gas systems in a distributed manner. First, a multi-block electricity-gas system model is constructed by dividing the whole system into N blocks considering both physical and regional differences. This multi-block model is then convexified by replacing the nonconvex gas transmission equation with the extended convex hull-based constraints. The Jacobi-Proximal alternating direction method of multipliers algorithm is adopted to solve the convexified model and minimize its operation cost. Finally, the feasibility of the optimal solution for the convexified model is checked, and a sufficient condition is developed. If the sufficient condition is satisfied, the optimal solution for the original nonconvex problem can be recovered from that for the convexified problem. Simulation results demonstrate that the proposed method is tractable and effective in obtaining feasible optimal solutions for multi-block optimal energy flow problems.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1992

Finite element solution of optimal control problems with state-control inequality constraints

It is demonstrated that the weak Hamiltonian finite-element formulation is amenable to the solution of optimal control problems with inequality constraints which are functions of both state and control variables. Difficult problems can be treated on account of the ease with which algebraic equations can be generated before having to specify the problem. These equations yield very accurate solutions. Owing to the sparse structure of the resulting Jacobian, computer solutions can be obtained quickly when the sparsity is exploited.

Bless, Robert R.↗
DOE OSTI2020

Decomposition Algorithms for Scalable Quantum Annealing

The presented python code provides wrapper functions for two decomposition algorithms: One algorithm to decompose Maximum Clique problems and one to decompose Minimum Vertex Cover problems. The functions take as input a networkx graph object, and decompose either problem on the input graph recursively into subproblems such that the optimal solution can be constructed from the optimal solutions of both subproblems. The recursion ends as soon as the subproblems reach a pre-specified size limit by the user, and they can be solved using any method provided in advance by the user as external function. This includes exact solvers or an adiabatic quantum annealer.

Pelofske, Elijah↗
DOE OSTI2022

MOOGLE: A Multi-Objective Optimization tool for three-dimensional nuclear fuel assembly design

MOOGLE is a new genetic algorithm methodology for the three-dimensional design of nuclear fuel assemblies. MOOGLE uses common fuel rod types as the decision variable to develop a suite of three-dimensional fuel assemblies to provide optimized solutions to the design problem. Pressurized Water Reactor (PWR) fuel assemblies were optimized using IFBA and gadolinium (Gd 2 O 3 ) as burnable poisons in order to compare how burnable poison choice affects optimization results. Boiling Water Reactor (BWR) fuel bundles were also optimized using three unique fuel rod palettes to study how the size of the design space affects optimization results. Burnable poison analysis showed that utilizing IFBA and Gd 2 O 3 as burnable poisons produced the best and widest range of optimized solutions. Further, BWR fuel bundle optimization results indicate that the inclusion of additional fuel rod types produced a wider solution space but did not improve optimization results for regions explored using fewer unique fuel rods. These tests demonstrate MOOGLE's ability to analyze the tradeoffs between the inclusion of different fuel elements and their effects on assembly performance.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2019

Integrated Solutions for Optimized Performance (ISOP) Final Technical Report

The goal of this project was to demonstrate technical feasibility of an integrated approach for deep energy retrofits by packaging innovative technologies with smart communicating controls that represent the next generation of energy efficiency. The integrated solutions for optimized performance (ISOP) package integrates (i) advanced lighting and plug load controls; (ii) intelligent daylight harvesting through automated self-powered shades and window films; (iii) advanced HVAC controls sequences (ASHRAE Guideline (GDL) 36); and (iv) fault detection and diagnosis (FDD) and continuous commissioning (CCx) using advanced analytics. These technologies address energy use across multiple building end uses that represent more than 60% of the energy consumption in all commercial buildings. The project was structured to be implemented over three budget periods: Budget Period 1 scope included site selection, project design, site-specific customization of technology packages, procurement of technologies, initiation of installation of technologies, the development of a measurement and verification plan and collection of pre-retrofit data collection. The first year go/no-go decision was based on securing host sites representing 250,000 sq. ft. of occupied operational spaces, savings analysis, technology procurement and initiation of installation. Budget Period 2 planned to complete technology installations and initiate data collection of post-retrofit performance data. The second year go/no-go was to be the completion of technology installations and commissioning, metering and data collecting to support the requirements laid out in site specific M&V plans. Budget Period 3 planned to collect and analyze post-retrofit performance data and provide data and reporting to support energy efficiency rebate programs. After the team completed activities planned for Budget Period 1, the team reached a Go/No-Go Decision Point. At that point, TRC recommended that DOE discontinue the project without prejudice due to challenges with securing demonstration sites to meet the full 250,000 sf of occupied operational spaces and DOE concurred. In Budget Period 1, the TRC team developed criteria to recruit and evaluate potential demonstration host sites. TRC worked with Princeton University, the project demonstration partner, to identify buildings on their campus as potential candidates for the demonstration. Following the selection of demonstration sites, the TRC team customized energy technology packages according to the needs and characteristics of each site. TRC defined technology specifications, identified vendors, and conducted analysis to estimate energy and cost savings potential. The project team then developed schedules for technology procurement processes and scheduled for installation at all selected demonstration sites. The project team worked with Princeton University and DOE to develop an approach to verify energy savings achieved through measurement and verification (M&V) 2.0 methods. Princeton University initiated open bids to procure the necessary materials and installation contractors. Bid results came back higher than estimates due to a couple of factors – lack of familiarity of the bidders with the proposed technologies and lack of local trained installers to execute the installation of these new measures. Due to the higher bids, projects no longer met the internal cost-effectiveness criteria used by Princeton to proceed with procurement of the full suite of technologies as proposed in ISOP. Princeton had already procured parts of the ISOP package as part of a campus-wide initiative for FDD and lighting retrofits, but with the higher costs for other ISOP components, Princeton could no longer commit to the full ISOP package on the selected sites. Based on this, the team reached the Go/No-Go decision point, where they decided not to proceed with the project. Princeton is separately installing portions of the ISOP package where they individually meet Princeton’s payback criteria but on a different schedule than would have been needed for the DOE ISOP project. The team has learned several lessons from project progress in the first budget period. The team will utilize these lessons in future projects, as should any team which proceeds with a project around the ISOP technology. The first lesson is that more information about the proposed sites is required earlier in the process (perhaps even at the proposal stage) in order to have a successful demonstration. Technical details not evident earlier in the process (such as the TLED limitations for ALCS) can derail project execution. The second lesson is that pricing of emerging technologies is highly variable due to lack of familiarity of local installers and distributor with the proposed technologies as well as alternate bids using products they were more familiar with, but that cost more than the ones proposed by TRC. Finally, the last major lesson is that the host site’s internal project criteria is of critical importance. Based on these higher installed costs and lack of an informed installer base for the products proposed for this project, the project does not meet Princeton’s simple payback goals of five years.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2023

Economic Evaluation of a Coupled Nuclear Power Plant and Hydrogen Production Facility: A Case Study

This study optimized the design sizes and operation of a power-to-hydrogen-to-power integrated energy system to allow a baseload power plant to operate flexibly in the energy market. In collaboration with a utility industry partner, the system, consisting of an electrolyzer, compressors, storage tank, and fuel cell, was optimized under conditions specific to the proposed project at the site of a nuclear power plant. The Design Integration and Synthesis Platform to Advance Tightly Coupled Hybrid Energy Systems (DISPATCHES) maximized net present value by optimizing sizing of components and dispatch decisions. Revenues included sale of electricity, capacity payments typical of the New York Independent System Operator, and the section 45V hydrogen production tax credit of the Inflation Reduction Act of 2022 (the tax credit was assumed to be available to legacy plants in the absence of clear guidance at present). Under default assumptions which excluded many capital expenditures, the base case optimized solution had a net present value of $\$$1.4 million over a 30 year lifetime, with a 0.365 MW fuel cell operating nearly continuously and 85% of revenues supplied by the hydrogen production tax credit (which was counted as a revenue regardless of profit, thus assuming credit monetization or offset of taxes within the larger firm was possible in all years). Beyond the base case, a sensitivity study elucidated drivers of the economics as capacity payment rate and hydrogen production tax credit rate vary. Additional sensitivity studies also extended results to variation of other, previously fixed parameters, including the fuel cell capital cost, and to imposition of further constraints. Optimization was also repeated for the default assumptions but recognizing tax credits upon use of hydrogen rather than upon its production, producing no change in the optimal solution. Most notably, capacity payments above $\$$15/kW-month drove optimal fuel cells multiple times larger than those with the default estimated capacity payment of $\$$2.5/kW-month (approaching 11 vs. 0.365 MW), and these larger fuel cells operated rarely (capacity factors of ~0.03). Furthermore, when the hydrogen production tax credit was provided for only 10 years, under the specific assumptions of this study (e.g., neither site preparation costs nor electrolyzer capital cost counted), the optimal solution avoided economic loss by ceasing system operation after the 10th year. Viewed broadly, this study demonstrated the capabilities of DISPATCHES, which can be user-adapted to serve other industrial case studies.

08 HYDROGEN↗