Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimization problems”

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 937 records · Page 52

Network-Cognizant Time-Coupled Aggregate Flexibility of Distribution Systems Under Uncertainties

Increasing integration of distributed energy resources (DERs) within distribution feeders provides unprecedented flexibility at the distribution-transmission interconnection. To exploit this flexibility and to use the capacity potential of aggregate DERs, feasible substation power injection trajectories need to be efficiently characterized. This paper provides an ellipsoidal inner approximation of the set of feasible power injection trajectories at the substation such that for any point in the set, there exists a feasible disaggregation strategy of DERs for any load uncertainty realization. The problem is formulated as one of finding the robust maximum volume ellipsoid inside the flexibility region under uncertainty. Though the problem is NP-hard even in the deterministic case, this paper derives novel approximations of the resulting adaptive robust optimization problem based on optimal second-stage policies. The proposed approach yields less conservative flexibility characterization than existing flexibility region approximation formulations. The efficacy of the proposed method is demonstrated on a realistic distribution feeder.

adaptive robust optimization↗

Visualization for Hyper-Heuristics: Back-End Processing

Modern society is faced with increasingly complex problems, many of which can be formulated as generate-and-test optimization problems. Yet, general-purpose optimization algorithms may sometimes require too much computational time. In these instances, hyperheuristics may be used. Hyper-heuristics automate the design of algorithms to create a custom algorithm for a particular scenario, finding the solution significantly faster than its predecessor. However, it may be difficult to understand exactly how a design was derived and why it should be trusted. This project aims to address these issues by creating an easy-to-use graphical user interface (GUI) for hyper-heuristics and an easy-to-understand scientific visualization for the produced solutions. To support the development of this GUI, my portion of the research involved developing algorithms that would allow for parsing of the data produced by the hyper-heuristics. This data would then be sent to the front-end, where it would be displayed to the end user.

97 MATHEMATICS AND COMPUTING↗

Network-Cognizant Time-Coupled Aggregate Flexibility of Distribution Systems Under Uncertainties

Increasing integration of distributed energy resources (DERs) within distribution feeders provides unprecedented flexibility at the distribution-transmission interconnection. To exploit this flexibility and to use the capacity potential of aggregate DERs, feasible substation power injection trajectories need to be efficiently characterized. This paper provides an ellipsoidal inner approximation of the set of feasible power injection trajectories at the substation such that for any point in the set, there exists a feasible disaggregation strategy of DERs for any load uncertainty realization. The problem is formulated as one of finding the robust maximum volume ellipsoid inside the flexibility region under uncertainty. Though the problem is NP-hard even in the deterministic case, this paper derives novel approximations of the resulting adaptive robust optimization problem based on optimal second-stage policies. The proposed approach yields less conservative flexibility characterization than existing flexibility region approximation formulations. The efficacy of the proposed method is demonstrated on a realistic distribution feeder.

aggregates↗

A Library of Local Search Heuristics for the Vehicle Routing Problem

The vehicle routing problem (VRP) is a difficult and well-studied combinatorial optimization problem. Real-world instances of the VRP can contain hundreds and even thousands of customer locations and can involve many complicating constraints, necessitating the use of heuristic methods. We present a software library of local search heuristics that allow one to quickly generate good solutions to VRP instances. The code has a logical, object-oriented design and uses efficient data structures to store and modify solutions. The core of the library is the implementation of seven local search operators that share a similar interface and are designed to be extended to handle additional options with minimal code change. The code is well-documented, is straightforward to compile, and is freely available for download at http://sites.google.com/site/vrphlibrary/ . The distribution of the code contains several applications that can be used to generate solutions to instances of the capacitated VRP.

97 MATHEMATICS AND COMPUTING↗

The Fundamental Solution and Its Role in the Optimal Control of Infinite Dimensional Neutral Systems

In this work, we shall consider standard optimal control problems for a class of neutral functional differential equations in Banach spaces. As the basis of a systematic theory of neutral models, the fundamental solution is constructed and a variation of constants formula of mild solutions is established. We introduce a class of neutral resolvents and show that the Laplace transform of the fundamental solution is its neutral resolvent operator. Necessary conditions in terms of the solutions of neutral adjoint systems are established to deal with the fixed time integral convex cost problem of optimality. Based on optimality conditions, the maximum principle for time varying control domain is presented. Finally, the time optimal control problem to a target set is investigated.

97 MATHEMATICS AND COMPUTING↗

Design of optimally normal minimum gain controllers by continuation method

A measure of the departure from normality is investigated for system robustness. An attractive feature of the normality index is its simplicity for pole placement designs. To allow a tradeoff between system robustness and control effort, a cost function consisting of the sum of a norm of weighted gain matrix and a normality index is minimized. First- and second-order necessary conditions for the constrained optimization problem are derived and solved by a Newton-Raphson algorithm imbedded into a one-parameter family of neighboring zero problems. The method presented allows the direct computation of optimal gains in terms of robustness and control effort for pole placement problems.

Lim, K. B.↗

SU-C-204-04: Patient Specific Proton Stopping Powers Estimation by Combining Proton Radiography and Prior-Knowledge X-Ray CT Information

Purpose: The material relative stopping power (RSP) uncertainty is the highest contributor to the range uncertainty in proton therapy. The purpose of this work is to develop a robust and systematic method that yields accurate, patient specific, RSP by combining 1) pre-treatment x-ray CT and 2) daily proton radiograph of the patient. Methods: The method is formulated as a linear least-square optimization problem (min||Ax-B||2). The parameter A represents the pathlength crossed by the proton in each material. The RSPs for the materials (water equivalent thickness (WET)/physical thickness) are denoted by x. B is the proton radiograph expressed as WET crossed. The problem is minimized using a convex-conic optimization algorithm with xi<xi+1 constraint. The Gammex RMI-465 phantom, with 13 material inserts, is used to investigate the optimal RSPs. The proton radiograph (B) is produced using Geant4 simulation. The matrix A is computed by calculating proton trajectories through the CT with the cubic-spline approach. Geant4 RSPs are used as reference and the clinical HU-RSP calibration curve is used as comparison. The convergence is investigated as a function of the number of angles and protons used. The radiographs angle which yield the most accurate RSPs are investigated. Results: Optimization with 9 angles and 104 protons/angle yields precise RSP (<0.75%) for all materials, except plastic lung (1.5%). Average deviation relative to Geant4 RSP is 0.5% and 3.5% using HU-RSP. Using more than two angles or more than 4×103 proton does not further increase the RSP estimate accuracy. The insert distance to the beam initial plane is related to the RSP error for this insert material. Specific filters are applied on the proton angle and energy loss to remove nuclear interaction artefacts. Conclusion: The proposed formulation of the problem with prior knowledge x-ray CT demonstrates serious potential to increase the accuracy of present RSP estimates.

60 APPLIED LIFE SCIENCES↗

Efficient Optimization of Low-Thrust Spacecraft Trajectories

A paper describes a computationally efficient method of optimizing trajectories of spacecraft driven by propulsion systems that generate low thrusts and, hence, must be operated for long times. A common goal in trajectory-optimization problems is to find minimum-time, minimum-fuel, or Pareto-optimal trajectories (here, Pareto-optimality signifies that no other solutions are superior with respect to both flight time and fuel consumption). The present method utilizes genetic and simulated-annealing algorithms to search for globally Pareto-optimal solutions. These algorithms are implemented in parallel form to reduce computation time. These algorithms are coupled with either of two traditional trajectory- design approaches called "direct" and "indirect." In the direct approach, thrust control is discretized in either arc time or arc length, and the resulting discrete thrust vectors are optimized. The indirect approach involves the primer-vector theory (introduced in 1963), in which the thrust control problem is transformed into a co-state control problem and the initial values of the co-state vector are optimized. In application to two example orbit-transfer problems, this method was found to generate solutions comparable to those of other state-of-the-art trajectory-optimization methods while requiring much less computation time.

Lee, Seungwon↗

CometBoards Users Manual Release 1.0

Several nonlinear mathematical programming algorithms for structural design applications are available at present. These include the sequence of unconstrained minimizations technique, the method of feasible directions, and the sequential quadratic programming technique. The optimality criteria technique and the fully utilized design concept are two other structural design methods. A project was undertaken to bring all these design methods under a common computer environment so that a designer can select any one of these tools that may be suitable for his/her application. To facilitate selection of a design algorithm, to validate and check out the computer code, and to ascertain the relative merits of the design tools, modest finite element structural analysis programs based on the concept of stiffness and integrated force methods have been coupled to each design method. The code that contains both these design and analysis tools, by reading input information from analysis and design data files, can cast the design of a structure as a minimum-weight optimization problem. The code can then solve it with a user-specified optimization technique and a user-specified analysis method. This design code is called CometBoards, which is an acronym for Comparative Evaluation Test Bed of Optimization and Analysis Routines for the Design of Structures. This manual describes for the user a step-by-step procedure for setting up the input data files and executing CometBoards to solve a structural design problem. The manual includes the organization of CometBoards; instructions for preparing input data files; the procedure for submitting a problem; illustrative examples; and several demonstration problems. A set of 29 structural design problems have been solved by using all the optimization methods available in CometBoards. A summary of the optimum results obtained for these problems is appended to this users manual. CometBoards, at present, is available for Posix-based Cray and Convex computers, Iris and Sun workstations, and the VM/CMS system.

Guptill, James D.↗

Benders Decomposition Using Graph Modeling and Multi-Parametric Programming

Benders decomposition is a widely used method for solving large and structured optimization problems, but its performance is affected by the repeated solution of subproblems. We propose a flexible and modular algorithmic framework for accelerating Benders decomposition. Specifically, we express the problem structure by using a graph-theoretic modeling abstraction in which nodes represent optimization subproblems and edges represent connectivity between subproblems. A key innovation of our approach is that we embed multiparametric programming (mp) surrogates for node subproblems, which maps the exact analytical map of the subproblem solution space. The use of mp surrogates allows us to replace subproblem solves with fast look-ups and function evaluations for primal and dual variables during the iterative Benders process. We formally show the equivalence between classical Benders cuts and those derived from the mp solution. We implement our framework in the open-source PlasmoBenders.jl software package. To demonstrate the capabilities of the proposed framework, we apply it to a two-stage stochastic programming problem, which aims to make optimal capacity expansion decisions under market uncertainty. We evaluate both single-cut and multicut variants of Benders decomposition and show that the use of mp surrogates achieves substantial speedups in subproblem solve time, while preserving the convergence guarantees of Benders decomposition. We highlight advantages in solution analysis and interpretability that is enabled by mp critical region tracking; specifically, we show that these reveal how decisions evolve geometrically across the Benders search. Our results aim to demonstrate that combining surrogate modeling with graph modeling offers a promising and extensible foundation for structure-exploiting decomposition. In addition, by decomposing the problem into more tractable subproblems, the proposed approach also aims to overcome scalability issues of mp. Finally, the use of mp surrogates provides a unifying and modular optimization framework that enables the representation of heterogeneous node subproblems as modeling objects with a homogeneous structure.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

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↗

Enhancing the cooling performance of thermocouples: a power-constrained topology optimization procedure

Abstract Heat pumping through thermoelectric devices has many advantages over traditional cooling. However, their current efficiency is a limiting factor in their implementation. In this paper, we approach the non-convex topology optimization of thermoelectrical elements for cooling applications through the method of moving asymptotes (MMA) to improve their cooling capabilities per watt usage. The optimization problem is defined for a given power budget, aiming for the minimum temperature with a known heat pumping need. The introduction of power as a constraint justifies the introduction of the voltage gradient across the thermocouple as a design variable to maintain the thermoelectrical device in its optimum power-to-heat extraction ratio. To better understand the convergence of this non-convex problem, we present a two-variable analytical thermoelectric optimization model. This example provides information on how to select the penalty parameters used to scale the three material coefficients involved in the problem to obtain lower objective values and better convergence using MMA. The analytical model shows the non-convexity of the problem and provides the recommendation to use penalization coefficients of the form $$p_k=p_{\sigma }>p_{\alpha }=1$$ p k = p σ > p α = 1 for the thermal conductivity, electrical conductivity, and Seebeck coefficients. We tested these penalization coefficients through optimizations of a model based on the 1MC10-031 commercial thermoelectric-cooler (TEC) using the finite element method (FEM). These penalization coefficients provided local minima without the need for volume constraints. With this procedure, we found designs that provided temperatures close to 10 degrees lower using 60% less semiconductor material volume compared to the initial design.

Gutiérrez, G. Reales↗

Optimum rocket propulsion for energy-limited transfer

In order to effect large-scale return of extraterrestrial resources to Earth orbit, it is desirable to optimize the propulsion system to maximize the mass of payload returned per unit energy expended. This optimization problem is different from the conventional rocket propulsion optimization. A rocket propulsion system consists of an energy source plus reaction mass. In a conventional chemical rocket, the energy source and the reaction mass are the same. For the transportation system required, however, the best system performance is achieved if the reaction mass used is from a locally available source. In general, the energy source and the reaction mass will be separate. One such rocket system is the nuclear thermal rocket, in which the energy source is a reactor and the reaction mass a fluid which is heated by the reactor and exhausted. Another energy-limited rocket system is the hydrogen/oxygen rocket where H2/O2 fuel is produced by electrolysis of water using a solar array or a nuclear reactor. The problem is to choose the optimum specific impulse (or equivalently exhaust velocity) to minimize the amount of energy required to produce a given mission delta-v in the payload. The somewhat surprising result is that the optimum specific impulse is not the maximum possible value, but is proportional to the mission delta-v. In general terms, at the beginning of the mission it is optimum to use a very low specific impulse and expend a lot of reaction mass, since this is the most energy efficient way to transfer momentum. However, as the mission progresses, it becomes important to minimize the amount of reaction mass expelled, since energy is wasted moving the reaction mass. Thus, the optimum specific impulse will increase with the mission delta-v. Optimum I(sub sp) is derived for maximum payload return per energy expended for both the case of fixed and variable I(sub sp) engines. Sample missions analyzed include return of water payloads from the moons of Mars and of Saturn.

Zuppero, Anthony↗

Very Large Scale Optimization

The purpose of this research under the NASA Small Business Innovative Research program was to develop algorithms and associated software to solve very large nonlinear, constrained optimization tasks. Key issues included efficiency, reliability, memory, and gradient calculation requirements. This report describes the general optimization problem, ten candidate methods, and detailed evaluations of four candidates. The algorithm chosen for final development is a modern recreation of a 1960s external penalty function method that uses very limited computer memory and computational time. Although of lower efficiency, the new method can solve problems orders of magnitude larger than current methods. The resulting BIGDOT software has been demonstrated on problems with 50,000 variables and about 50,000 active constraints. For unconstrained optimization, it has solved a problem in excess of 135,000 variables. The method includes a technique for solving discrete variable problems that finds a "good" design, although a theoretical optimum cannot be guaranteed. It is very scalable in that the number of function and gradient evaluations does not change significantly with increased problem size. Test cases are provided to demonstrate the efficiency and reliability of the methods and software.

Vanderplaats, Garrett↗

MO-FG-204-06: A New Algorithm for Gold Nano-Particle Concentration Identification in Dual Energy CT

Purpose: Gold nano-particle (GNP) has recently attracted a lot of attentions due to its potential as an imaging contrast agent and radiotherapy sensitiser. Imaging the GNP at its low contraction is a challenging problem. We propose a new algorithm to improve the identification of GNP based on dual energy CT (DECT). Methods: We consider three base materials: water, bone, and gold. Determining three density images from two images in DECT is an under-determined problem. We propose to solve this problem by exploring image domain sparsity via an optimization approach. The objective function contains four terms. A data-fidelity term ensures the fidelity between the identified material densities and the DECT images, while the other three terms enforces the sparsity in the gradient domain of the three images corresponding to the density of the base materials by using total variation (TV) regularization. A primal-dual algorithm is applied to solve the proposed optimization problem. We have performed simulation studies to test this model. Results: Our digital phantom in the tests contains water, bone regions and gold inserts of different sizes and densities. The gold inserts contain mixed material consisting of water with 1g/cm3 and gold at a certain density. At a low gold density of 0.0008 g/cm3, the insert is hardly visible in DECT images, especially for those with small sizes. Our algorithm is able to decompose the DECT into three density images. Those gold inserts at a low density can be clearly visualized in the density image. Conclusion: We have developed a new algorithm to decompose DECT images into three different material density images, in particular, to retrieve density of gold. Numerical studies showed promising results.

60 APPLIED LIFE SCIENCES↗

Integration and Optimization of a Waste Heat Driven Organic Rankine Cycle for Power Generation in Wastewater Treatment Plants

The study focuses on achieving energy self-sufficiency in Wastewater Treatment Plants by proposing a comprehensive model for integrating, sizing, and optimizing an Organic Rankine Cycle system. The Organic Rankine Cycle system is designed to utilize waste heat from the gensets at As Samra Wastewater Treatment Plant in Jordan, where it will contribute to the overall electrical energy supply of the plant. Real data from As Samra Wastewater Treatment Plant is used to model and calculate the available waste heat using TRNSYS® software. The Organic Rankine Cycle model is then developed using ASPEN PLUS® software to explore the impact of operational parameters and determine their optimal values for maximizing the plant's energy profile. An economic analysis is conducted to assess the feasibility of the proposed model, considering system components, installation, operation, and maintenance costs. To optimize the Organic Rankine Cycle system, the study employs the Multi-Output Support Vector Regression technique to capture nonlinear relationships between independent variables (fluid type, turbine inlet pressure, turbine inlet temperature, turbine outlet pressure, and mass flow rate) and dependent variables (pump power input, waste heat input, and turbine specific work). The Osprey optimization algorithm is used to address the multi-objective optimization problem, with the proposed Pareto-based Osprey Optimization Algorithm and the Multi-Objective Particle Swarm Optimization technique being employed to evaluate critical performance and economic parameters such as system thermal efficiency, net power output, and the levelized cost of electricity. The results of the optimization strategies indicate that the M-SVR model's prediction accuracy is significantly improved after parameter optimization, with the model returning high R 2 and low Mean Square Error values of 0.991 and 0.00216, respectively. The Pareto-Based Osprey Optimization Algorithm optimizer identifies the best working fluid as Isobutane/Isopentane in a ratio of 66:34, with optimal turbine inlet pressure and temperature of 15 bars and 218 °C, respectively. In conclusion, the Organic Rankine Cycle model at these optimal conditions achieves a cycle efficiency of 19.93% and an Levelized Cost of Electricity value of 0.0353 USD/kWh.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Sparse Control Synthesis for Uncertain Responsive Loads With Stochastic Stability Guarantees

In this report, recent studies have demonstrated the potential of flexible loads in providing frequency response services, predominantly due to their availability and cost-effectiveness. However, uncertainty and variability in various weather-related and end-use behavioral factors often impact the reliability of demand-side control performance. This work addresses this problem with the design of a demand-side control to achieve frequency response under load uncertainties. Our approach involves modeling the load uncertainties via stochastic processes that appear as both multiplicative and additive in the power system dynamics. Recently developed mean square exponential stability (MSES) results for continuous-time linear stochastic systems are applied to pose the control synthesis problem which results in an LMI-based optimization problem. Additional costs and constraints are added to the LMI-based controller synthesis to ensure MSES, improve closed-loop transient performance, maximize tolerable uncertainties, and promote sparsity in the controller. Additionally, the fundamental limitations between the tolerable uncertainties and control efforts while ensuring MSES are discussed. Further, the control synthesis problem for the case of the full-state measurement is generalized to the case of partial-state measurements. The proposed control synthesis is illustrated on an IEEE 39 bus system with rigorous studies to demonstrate the role of sparsity, closed-loop transient performance, tolerable uncertainties, and control efforts while ensuring MSES and achieving frequency response.

42 ENGINEERING↗

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↗