Search NASA⌕ Search

SEARCH · Search NASA

Results for “optimizer”

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 73 records · Page 4

Parametric Optimization Problem Formulation for Connected Hybrid Electric Vehicles using Neural Network based Equivalent Model

The dynamics of powertrain control systems are complicated and involve both nonlinear plant model and control functionalities, albeit they are well defined and formulated using first principle approaches. This constitutes difficulties in exploring implementable optimal tuning rules for some selected control parameters using vehicle-to-vehicle (V2V) communications. This paper presents a way to use neural networks (NN) to represent the problem of parameter tuning for optimizing fuel consumption. For this purpose, physical modelling and validation have been firstly performed for the closed loop powertrain system of the concerned vehicle for some given driving cycles. This is then followed by the sensitivity analysis that selects most influential control parameters to optimize. Using the data generated from the obtained physical models, an equivalent NN formulation has finally been obtained that gives simple yet unified objectives and constraints ready to be used to solve the optimization problem that produces optimal tuning rules for the selected control parameters to minimize fuel consumption.

Parameter optimization, V2X, Powertrain modeling↗

Real-time fast inverse dose optimization for image guided adaptive radiation therapy-Enhancements to fast inverse dose optimization (FIDO)

A fast, accurate and stable optimization algorithm is very important for inverse planning of intensity-modulated radiation therapy (IMRT), and for implementing dose-adaptive radiotherapy in the future. Conventional numerical search algorithms with positive beam weight constraints generally require numerous iterations and may produce suboptimal dose results due to trapping in local minima regions of the objective function landscape. A direct solution of the inverse problem using conventional quadratic objective functions without positive beam constraints is more efficient but it will result in unrealistic negative beam weights. We review here a direct solution of the inverse problem that is efficient and does not yield unphysical negative beam weights. In fast inverse dose optimization (FIDO) method the objective function for the optimization of a large number of beamlets is reformulated such that the optimization problem is reducible to a linear set of equations. The optimal set of intensities is then found through a matrix inversion, and negative beamlet intensities are avoided without the need for externally imposed ad hoc conditions. In its original version [S. P. Goldman, J. Z. Chen, and J. J. Battista, in Proceedings of the XIVth International Conference on the Use of Computers in Radiation Therapy, 2004, pp. 112-115; S. P. Goldman, J. Z. Chen, and J. J. Battista, Med. Phys. 32, 3007 (2005)], FIDO was tested on single two-dimensional computed tomography (CT) slices with sharp KERMA beams without scatter, in order to establish a proof of concept which demonstrated that FIDO could be a viable method for the optimization of cancer treatment plans. In this paper we introduce the latest advancements in FIDO that now include not only its application to three-dimensional volumes irradiated by beams with full scatter but include as well a complete implementation of clinical dose-volume constraints including maximum and minimum dose as well as equivalent uniform dose constraints. The method has been integrated into a commercial treatment planning system (Pinnacle, Philips Medical Systems) for beta testing using clinical radiotherapy cases and standard dose constraints set by radiation oncologists. Our FIDO method consistently delivered excellent treatment plans comparable and often better than those obtained using standard optimization techniques that are considerably slower. By design, FIDO is guaranteed to find a global minimum and will achieve highly conformal and homogeneous dose distributions without the need for artificial internal contours that must be created in conventional IMRT optimization systems to help the search engines better control some beam entry directions and in this way avoid the creation of hot and cold spots. This method provides a fast, intuitive and robust technique that yields excellent results for the inverse planning of IMRT. FIDO's ability to efficiently optimize very large numbers of beamlet weights also makes it an ideal tool for the optimization of helical tomotherapy. Future gains in speed will make it possible to use FIDO for instant treatment plan reoptimization using CT images produced at the radiotherapy machine, just prior to daily treatments of the patient.

61 RADIATION PROTECTION AND DOSIMETRY↗

Exact Optimal Power Dispatch in Unbalanced Distribution Systems With High PV Penetration

Smart inverters provide additional control capability to help optimize the operation of distribution systems. This paper proposes a framework for exact optimal active and reactive power dispatch of distributed photovoltaic (PV) generation, switched capacitors, and tap changers in large multi-phase unbalanced distribution systems. The objectives of the optimal dispatch are minimization of the energy loss, PV active power curtailment, and capacitor and tap changer switching operations, in addition to elimination of voltage violations and reverse power flow. The optimization problem is formulated in rectangular coordinates as a nonlinear, nonconvex problem. Effective computational strategies are proposed to allow the application of predictorcorrector primal-dual interior point method to solve optimization problems in real-time with a large number of constraints and variables, including discrete variables corresponding to switched capacitors and tap changers. The accuracy of the numerical solution and the ability to implement the proposed framework are validated using the unbalanced multi-phase IEEE 34-bus and EPRI 2,998-bus distribution systems with 15-minute load and PV data. The results show a significant loss reduction and complete removal of both voltage violations and reverse power flow.

Nguyen, Quan (ORCID:0000000347769557)↗

Optimizing the fuel efficiency of an opposed piston engine for electric power generation

This paper investigates the optimal crankshaft motion for an opposed piston (OP) engine in a novel hybrid architecture to maximize fuel efficiency. The OP engine was selected for this work due to its inherent thermodynamic benefits and the balanced nature of the engine which can achieve downsizing through reducing the number of cylinders rather than the individual cylinder volume. The typical geartrain required on an OP engine was exchanged for two electric motors, reducing friction loss and decoupling the crankshafts. Using the motors to control the crankshaft motion profiles, this architecture introduces capabilities to dynamically vary compression ratio, combustion volume, and scavenging dynamics. To leverage these opportunities, an optimization scheme was developed utilizing nonlinear optimization of a 0-D model to compute the crankshaft motion profile that maximizes the work generated by the system. This optimization was then iteratively coupled with a high fidelity model which supplies the cylinder flow boundary conditions. This iterative approach reduces the model complexity used in the optimal control problem (OCP) while capturing the gas exchange dynamics critical to the 2-stroke cycle of the OP engine. By using the rate of change of motor torque as the input to the OCP, the torque fluctuation in a single cycle can be limited to ensure tracking feasibility. The results show crankshaft velocity slows during the compression stroke and conversely accelerates during the expansion stroke, reducing the peak motor torque required for control and thus reducing the motor losses. The extended residence time at top dead center, however, leads to an increase in heat transfer, illustrating the trade-off between the work extraction efficiency and the indicated engine efficiency.

Engineering↗

RetSynth: determining all optimal and sub-optimal synthetic pathways that facilitate synthesis of target compounds in chassis organisms

The efficient biological production of industrially and economically important compounds is a challenging problem. Brute-force determination of the optimal pathways to efficient production of a target chemical in a chassis organism is computationally intractable. Many current methods provide a single solution to this problem, but fail to provide all optimal pathways, optional sub-optimal solutions or hybrid biological/non-biological solutions. Here we present RetSynth, software with a novel algorithm for determining all optimal biological pathways given a starting biological chassis and target chemical. By dynamically selecting constraints, the number of potential pathways scales by the number of fully independent pathways and not by the number of overall reactions or size of the metabolic network. This feature allows all optimal pathways to be determined for a large number of chemicals and for a large corpus of potential chassis organisms. Additionally, this software contains other features including the ability to collect data from metabolic repositories, perform flux balance analysis, and to view optimal pathways identified by our algorithm using a built-in visualization module. This software also identifies sub-optimal pathways and allows incorporation of non-biological chemical reactions, which may be performed after metabolic production of precursor molecules. The novel algorithm designed for RetSynth streamlines an arduous and complex process in metabolic engineering. Our stand-alone software allows the identification of candidate optimal and additional sub-optimal pathways, and provides the user with necessary ranking criteria such as target yield to decide which route to select for target production. Furthermore, the ability to incorporate non-biological reactions into the final steps allows determination of pathways to production for targets that cannot be solely produced biologically. With this comprehensive suite of features RetSynth exceeds any open-source software or webservice currently available for identifying optimal pathways for target production.

59 BASIC BIOLOGICAL SCIENCES↗

A Three-Stage Enhanced Reactive Power and Voltage Optimization Method for High Penetration of Solar

This paper presents a three-stage enhanced volt/var optimization method to stabilize voltage fluctuations in transmission networks by optimizing the usage of reactive power control devices. In contrast with existing volt/var optimization algorithms, the proposed method optimizes the voltage profiles of the system, while keeping the voltage and real power output of the generators as close to the original scheduling values as possible. This allows the method to accommodate realistic power system operation and market scenarios, in which the original generation dispatch schedule will not be affected. The proposed method was tested and validated on a modified IEEE 118-bus system with photovoltaic data.

photovoltaic, Volt/Var Control, indexes, simulatio↗

Multiobjective Optimal Controlled Variable Selection for a Gas Turbine–Solid Oxide Fuel Cell System Using a Multiagent Optimization Platform

Hybrid gas turbine–fuel cell systems have immense potential for high efficiency in electrical power generation with cleaner emissions compared with fossil-fueled power generation. We report a systematic controlled variable (CV) selection method is deployed for a hybrid gas turbine–fuel cell system in the HyPer (hybrid performance) facility at the U.S. Department of Energy’s National Energy Technology Laboratory (NETL) for maximizing its economic and control performance. A three-stage approach is used for the CV selection comprising a priori analysis, multiobjective optimization, and a posteriori analysis. The a priori analysis helps to screen off several candidate CVs, thus reducing the size of the combinatorial optimization problem for multiobjective CV selection. For optimal CV selection, a transfer function model of the HyPer facility is identified. By considering several candidate models, the final transfer function model is selected using Akaike’s Final Prediction Error criterion. Experimental data from the HyPer facility are used to estimate the noise in the measurement data. For solving the combinatorial multiobjective optimization problem for CV selection, a multiagent optimization platform comprising simulated annealing, genetic algorithm, and efficient ant colony optimization algorithms is used. Pareto-optimal CV sets exhibit a high trade-off between the economic and control objective. The a posteriori analysis is undertaken for several top Pareto-optimal CV sets. An optimal CV set is selected that shows the best compromise between process economics and controllability under both nominal and off-design conditions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Development of a Distribution Optimal Power Flow Federate for Open-Source OEDI-SI Platform

Increasing numbers of distributed generators in the electric power distribution networks require developing a control strategy to optimize solutions in real time. Linearized optimal distribution flow development has seen growth and acceptance in the distribution systems literature for efficiently modeling the \glspl{opf} for distribution systems. This paper examines the implementation and integration procedure for linearized optimal distribution flow federate to \gls{oedisi} platform. Specifically, we discuss i) the usage of the \gls{oedisi} platform, ii) obtaining a tractable solution using developed \gls{opf} federate, and iii) validation of solutions and bench-marking the \gls{oedisi} platform with developed \gls{opf} federate using OpenDSS. In brief, we demonstrate how a general linearized optimal distribution flow federate can be developed and integrated with a co-simulation environment to mimic real-world examples. The efficacy of the proposed method is demonstrated using the IEEE 123-bus test system under different scenarios to obtain a tractable solution and compare its results.

Sadnan, Rabayet↗

SU-E-T-295: Simultaneous Beam Sampling and Aperture Shape Optimization for Station Parameter Optimized Radiation Therapy (SPORT)

Purpose: Station Parameter Optimized Radiation Therapy (SPORT) was recently proposed to fully utilize the technical capability of emerging digital LINACs, in which the station parameters of a delivery system, (such as aperture shape and weight, couch position/angle, gantry/collimator angle) are optimized altogether. SPORT promises to deliver unprecedented radiation dose distributions efficiently, yet there does not exist any optimization algorithm to implement it. The purpose of this work is to propose an optimization algorithm to simultaneously optimize the beam sampling and aperture shapes. Methods: We build a mathematical model whose variables are beam angles (including non-coplanar and/or even nonisocentric beams) and aperture shapes. To solve the resulting large scale optimization problem, we devise an exact, convergent and fast optimization algorithm by integrating three advanced optimization techniques named column generation, gradient method, and pattern search. Column generation is used to find a good set of aperture shapes as an initial solution by adding apertures sequentially. Then we apply the gradient method to iteratively improve the current solution by reshaping the aperture shapes and updating the beam angles toward the gradient. Algorithm continues by pattern search method to explore the part of the search space that cannot be reached by the gradient method. Results: The proposed technique is applied to a series of patient cases and significantly improves the plan quality. In a head-and-neck case, for example, the left parotid gland mean-dose, brainstem max-dose, spinal cord max-dose, and mandible mean-dose are reduced by 10%, 7%, 24% and 12% respectively, compared to the conventional VMAT plan while maintaining the same PTV coverage. Conclusion: Combined use of column generation, gradient search and pattern search algorithms provide an effective way to optimize simultaneously the large collection of station parameters and significantly improves quality of resultant treatment plans as compared with conventional VMAT or IMRT treatments.

07 ISOTOPE AND RADIATION SOURCES↗

Selective robust optimization: A new intensity-modulated proton therapy optimization strategy

Purpose: To develop a new robust optimization strategy for intensity-modulated proton therapy as an important step in translating robust proton treatment planning from research to clinical applications. Methods: In selective robust optimization, a worst-case-based robust optimization algorithm is extended, and terms of the objective function are selectively computed from either the worst-case dose or the nominal dose. Two lung cancer cases and one head and neck cancer case were used to demonstrate the practical significance of the proposed robust planning strategy. The lung cancer cases had minimal tumor motion less than 5 mm, and, for the demonstration of the methodology, are assumed to be static. Results: Selective robust optimization achieved robust clinical target volume (CTV) coverage and at the same time increased nominal planning target volume coverage to 95.8%, compared to the 84.6% coverage achieved with CTV-based robust optimization in one of the lung cases. In the other lung case, the maximum dose in selective robust optimization was lowered from a dose of 131.3% in the CTV-based robust optimization to 113.6%. Selective robust optimization provided robust CTV coverage in the head and neck case, and at the same time improved controls over isodose distribution so that clinical requirements may be readily met. Conclusions: Selective robust optimization may provide the flexibility and capability necessary for meeting various clinical requirements in addition to achieving the required plan robustness in practical proton treatment planning settings.

60 APPLIED LIFE SCIENCES↗

Nonlinear multiobjective and dynamic real-time predictive optimization for optimal operation of baseload power plants under variable renewable energy

Considering the increase of disruptive variable renewable energy penetration into the power grid, this article focuses on the investigation of a multiobjective and dynamic real-time optimization framework to address the cycling of large-scale power plants under renewable penetration. In this framework, a parallelized particle swarm optimization step is first performed to generate feasible initial points. Then, a multiobjective and dynamic real-time optimization formulation generates optimal trajectories. Further, the benefit of predictive capability is investigated for the dynamic component, which introduces the novel nonlinear multiobjective and dynamic real-time predictive optimization approach. Two multiobjective formulations to obtain Pareto front optimal in real time are explored: the modified Tchebycheff-based weighted metric and ϵ-constraint methods. Economic and environmental objectives are considered in this study. A novel topical discussion on the intersection of dynamic real-time optimization with model predictive control is also presented. The developed framework is successfully applied to a baseload coal-fired power plant with postcombustion CO 2 capture. Results indicate that the approach can be deployed for a large-scale system if automatic differentiation, model reduction, and parallelization are adopted to improve computational tractability, with computational improvement up to 120-folds after performing these steps. Finally, market and carbon policies showed an impact on the optimal compromise between the objectives with an additional 63 ton of CO 2 captured under favorable market conditions.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Optimizing Irregular Communication with Neighborhood Collectives and Locality-Aware Parallelism

Irregular communication often limits both the performance and scalability of parallel applications. Typically, applications individually implement irregular communication as point-to-point, and any optimizations are integrated directly into the application. As a result, these optimizations lack portability. It is difficult to optimize point-to-point messages within MPI, as the interface for single messages provides no information on the collection of all communication to be performed. However, the persistent neighbor collective API, released in the MPI 4 standard, provides an interface for portable optimizations of irregular communication within MPI libraries. This paper presents methods for implementing existing optimizations for irregular communication within neighborhood collectives, analyzes the impact of replacing point-to-point communication in existing codebases such as Hypre BoomerAMG with neighborhood collectives, and finally shows up to a 1.38x speedup on sparse matrix-vector multiplication communication within a BoomerAMG solve through the use of our optimized neighbor collectives. Here, the authors analyze three implementations of persistent neighborhood collectives for Alltoallv: an unoptimized wrapper of standard point-to-point communication, and two locality-aware aggregating methods. The second locality-aware implementation exposes an non-standard interface to perform additional optimization, and the authors present the additional 0.07x speedup from the extended interface. All optimizations are available in an open-source codebase, MPI Advance, which sits on top of MPI, allowing for optimizations to be added into existing codebases regardless of the system MPI install.

AMG↗

Multidisciplinary Optimization of a Transport Aircraft Wing using Particle Swarm Optimization

The purpose of this paper is to demonstrate the application of particle swarm optimization to a realistic multidisciplinary optimization test problem. The paper's new contributions to multidisciplinary optimization is the application of a new algorithm for dealing with the unique challenges associated with multidisciplinary optimization problems, and recommendations as to the utility of the algorithm in future multidisciplinary optimization applications. The selected example is a bi-level optimization problem that demonstrates severe numerical noise and has a combination of continuous and truly discrete design variables. The use of traditional gradient-based optimization algorithms is thus not practical. The numerical results presented indicate that the particle swarm optimization algorithm is able to reliably find the optimum design for the problem presented here. The algorithm is capable of dealing with the unique challenges posed by multidisciplinary optimization as well as the numerical noise and truly discrete variables present in the current example problem.

Sobieszczanski-Sobieski, Jaroslaw↗

Performing aggressive code optimization with an ability to rollback changes made by the aggressive optimizations

Mechanisms for aggressively optimizing computer code are provided. With these mechanisms, a compiler determines an optimization to apply to a portion of source code and determines if the optimization as applied to the portion of source code will result in unsafe optimized code that introduces a new source of exceptions being generated by the optimized code. In response to a determination that the optimization is an unsafe optimization, the compiler generates an aggressively compiled code version, in which the unsafe optimization is applied, and a conservatively compiled code version in which the unsafe optimization is not applied. The compiler stores both versions and provides them for execution. Mechanisms are provided for switching between these versions during execution in the event of a failure of the aggressively compiled code version. Moreover, predictive mechanisms are provided for predicting whether such a failure is likely.

97 MATHEMATICS AND COMPUTING↗