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 1,225 records · Page 68

An application of different dioids in public key cryptography

Dioids provide a natural framework for analyzing a broad class of discrete event dynamical systems such as the design and analysis of bus and railway timetables, scheduling of high-throughput industrial processes, solution of combinatorial optimization problems, the analysis and improvement of flow systems in communication networks. They have appeared in several branches of mathematics such as functional analysis, optimization, stochastic systems and dynamic programming, tropical geometry, fuzzy logic. In this paper we show how to involve dioids in public key cryptography. The main goal is to create key – exchange protocols based on dioids. Additionally the digital signature scheme is presented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SU-E-T-500: Initial Implementation of GPU-Based Particle Swarm Optimization for 4D IMRT Planning in Lung SBRT

Purpose 4D-IMRT planning, combined with dynamic MLC tracking delivery, utilizes the temporal dimension as an additional degree of freedom to achieve improved OAR-sparing. The computational complexity for such optimization increases exponentially with increase in dimensionality. In order to accomplish this task in a clinically-feasible time frame, we present an initial implementation of GPU-based 4D-IMRT planning based on particle swarm optimization (PSO). Methods The target and normal structures were manually contoured on ten phases of a 4DCT scan of a NSCLC patient with a 54cm3 right-lower-lobe tumor (1.5cm motion). Corresponding ten 3D-IMRT plans were created in the Eclipse treatment planning system (Ver-13.6). A vendor-provided scripting interface was used to export 3D-dose matrices corresponding to each control point (10 phases × 9 beams × 166 control points = 14,940), which served as input to PSO. The optimization task was to iteratively adjust the weights of each control point and scale the corresponding dose matrices. In order to handle the large amount of data in GPU memory, dose matrices were sparsified and placed in contiguous memory blocks with the 14,940 weight-variables. PSO was implemented on CPU (dual-Xeon, 3.1GHz) and GPU (dual-K20 Tesla, 2496 cores, 3.52Tflops, each) platforms. NiftyReg, an open-source deformable image registration package, was used to calculate the summed dose. Results The 4D-PSO plan yielded PTV coverage comparable to the clinical ITV-based plan and significantly higher OAR-sparing, as follows: lung Dmean=33%; lung V20=27%; spinal cord Dmax=26%; esophagus Dmax=42%; heart Dmax=0%; heart Dmean=47%. The GPU-PSO processing time for 14940 variables and 7 PSO-particles was 41% that of CPU-PSO (199 vs. 488 minutes). Conclusion Truly 4D-IMRT planning can yield significant OAR dose-sparing while preserving PTV coverage. The corresponding optimization problem is large-scale, non-convex and computationally rigorous. Our initial results indicate that GPU-based PSO with further software optimization can make such planning clinically feasible. This work was supported through funding from the National Institutes of Health and Varian Medical Systems.

60 APPLIED LIFE SCIENCES↗

Dose optimization of an adjuvanted peptide-based personalized neoantigen melanoma vaccine

The advancements in next-generation sequencing have made it possible to effectively detect somatic mutations, which has led to the development of personalized neoantigen cancer vaccines that are tailored to the unique variants found in a patient’s cancer. These vaccines can provide significant clinical benefit by leveraging the patient’s immune response to eliminate malignant cells. However, determining the optimal vaccine dose for each patient is a challenge due to the heterogeneity of tumors. To address this challenge, we formulate a mathematical dose optimization problem based on a previous mathematical model that encompasses the immune response cascade produced by the vaccine in a patient. We propose an optimization approach to identify the optimal personalized vaccine doses, considering a fixed vaccination schedule, while simultaneously minimizing the overall number of tumor and activated T cells. To validate our approach, we perform in silico experiments on six real-world clinical trial patients with advanced melanoma. We compare the results of applying an optimal vaccine dose to those of a suboptimal dose (the dose used in the clinical trial and its deviations). Our simulations reveal that an optimal vaccine regimen of higher initial doses and lower final doses may lead to a reduction in tumor size for certain patients. Our mathematical dose optimization offers a promising approach to determining an optimal vaccine dose for each patient and improving clinical outcomes.

59 BASIC BIOLOGICAL SCIENCES↗

Progressive Hedging Decomposition for Solutions of Large-Scale Process Family Design Problems

In previous work, we have introduced a mathematical model for solving a discretized version of the process family design problem. This involves two sets of decision variables. One set selects which unit module designs are included in the process platform out of a candidate set of options; the other set determines which of these unit module designs are assigned to each variant. In this work, we exploit a parallelized Progressive Hedging (PH) algorithm to solve even larger scale design problems. PH is a well-known algorithm traditionally used to solve stochastic programming problems. While our problem is not a two-stage stochastic programming problem, the structure is similar, and it can be directly mapped to the PH approach, which we employ here to solve this deterministic optimization problem. We decompose our problem by process variant. We treat the platform unit module design variables as first-stage and the assignment of unit module designs to variants as second-stage, solving the problem using mpi-sppy. We demonstrate this approach on case studies of CC, water desalination, and refrigeration.

Stinchfield, Georgia↗

Intrusive Uncertainty Quantification and Optimal Experiment Design in the Open-Source Pyomo Ecosystem

This contribution describes ParmEst and Pyomo.DoE, two pillars of the open-source Python-based Pyomo ecosystem for computational optimization with (partial differential) algebraic equation mathematical models. Specifically, ParmEst facilitates intrusive frequentist parameter estimation (PE) and uncertainty quantification (UQ) through built-in features, such as covariance matrix estimation, bootstrapping, and likelihood ratio tests. Complementary, Pyomo.DoE enables optimal experiment design by maximizing various metrics of the Fisher information matrix, such as A-optimality (trace), D-optimality (determinant), E-optimality (minimum eigenvalue), and ME-optimality (condition number). ParmEst and Pyomo.DoE can solve high-dimensional optimization problems by leveraging the model structure and exact derivative information. Finally, we will discuss future opportunities to integrate PE and UQ capabilities with optimization under uncertainty, including robust optimization with non-convex models via PyROS.

97 MATHEMATICS AND COMPUTING↗

Urine sampling and collection system optimization and testing

A Urine Sampling and Collection System (USCS) engineering model was developed to provide for the automatic collection, volume sensing and sampling of urine from each micturition. The purpose of the engineering model was to demonstrate verification of the system concept. The objective of the optimization and testing program was to update the engineering model, to provide additional performance features and to conduct system testing to determine operational problems. Optimization tasks were defined as modifications to minimize system fluid residual and addition of thermoelectric cooling.

Fogal, G. L.↗

Modified SUMT for structural synthesis

The concepts of the singular perturbation theory are employed to modify the SUMT (Sequential Unconstrained Minimization Technique) algorithm of Fiacco-McCormick (1968) in order to make it more robust and reliable. The algorithm, which uses a sequence of penalty parameters to convert a constrained problem into a sequence of unconstrained problems, suffers from the need to minimize an ill-conditioned penalty function. By using the modified SUMT algorithm on two different structural optimization problems, it is shown that the singular perturbation SUMT easily converges to accurate solutions.

Kamat, M. P.↗

Reduced Uncertainties in the Flutter Analysis of the Aerostructures Test Wing

Tuning the finite element model using measured data to minimize the model uncertainties is a challenging task in the area of structural dynamics. A test validated finite element model can provide a reliable flutter analysis to define the flutter placard speed to which the aircraft can be flown prior to flight flutter testing. Minimizing the difference between numerical and experimental results is a type of optimization problem. Through the use of the National Aeronautics and Space Administration Dryden Flight Research Center s (Edwards, California, USA) multidisciplinary design, analysis, and optimization tool to optimize the objective function and constraints; the mass properties, the natural frequencies, and the mode shapes are matched to the target data and the mass matrix orthogonality is retained. The approach in this study has been applied to minimize the model uncertainties for the structural dynamic model of the aerostructures test wing, which was designed, built, and tested at the National Aeronautics and Space Administration Dryden Flight Research Center. A 25-percent change in flutter speed has been shown after reducing the uncertainties

Pak, Chan-gi↗

Model Predictive Control in the Three-body Problem Using Invariant Funnels As Terminal Sets

This paper describes a method for augmenting Model Predictive Control techniques using invariant funnels computed in the Circular Restricted Three-Body Problem. We use ellipsoids that roughly approximate the boundary of the invariant funnel as convex terminal sets for a short look-ahead optimization problem at each time step. We apply this method to a hypothetical low-thrust mission to land on Jupiter’s mooon Europa and show that including the invariant funnels as terminal sets reduces the amount of control effort required by almost an order of magnitude.

Close, Sigrid↗

Generation and transmission expansion planning for renewable energy integration

In recent years the expansion planning problem has become increasingly complex. As expansion planning (sometimes called composite or integrated resource planning) is a non-linear and non-convex optimization problem, researchers have traditionally focused on approximate models of power flows to solve the problem. The problem has also been split into generation expansion planning (GEP) and transmission network expansion planning (TNEP) to improve computational tractability. Until recently these approximations have produced results that are straight-forward to combine and adapt to the more complex and complete problem. However, the power grid is evolving towards a state where the adaptations are no longer easy (e.g. large amounts of limited control, renewable generation, comparable generation and transmission construction costs) and necessitates new approaches. Recent work on deterministic Discrepancy Bounded Local Search (DBLS) has shown it to be quite effective in addressing the TNEP. In this paper, we propose a generalization of DBLS to handle simultaneous generation and transmission planning.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Applicability study of Bayesian optimization in core neutronic design using a toy model

At the Japan Atomic Energy Agency (JAEA), an innovative design approach named ARKADIA (Advanced Reactor Knowledge- and AI-aided Design Integration Approach through the whole plant life cycle) for advanced nuclear reactors is currently under development. One task in ARKADIA is to build a system that automatically optimizes core and fuel designs by conducting core neutronic and thermal-hydraulic calculations, fuel integrity evaluations, and plant dynamic analyses. This system will be implemented to automatically find an optimal design that minimizes (or maximizes) objective function defined by core performance while varying the core and fuel design parameters such as fuel pin diameter, core height and diameter. In this study, as the first step of system development, we focused only on core neutronic design and conducted a study of automatic optimization. As the optimization algorithm, Bayesian optimization (BO), an effective method for optimization problems with expensive computational cost of objective function, was utilized. The applicability of BO was studied based on single- and two-objective optimization examples of core neutronic design in a toy model. As a result, in the former, it was shown that BO can give the optimal solution, which matches the reference solution calculated by a brute force calculation well, with a small number of required calculations. Usability on core neutronic designs, where the computational cost per case is high, was confirmed. In the latter, it was found that BO can give a Pareto solutions-set that shows good agreement with the reference solution. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Application of A Dual-Quaternion Six Degree-of-Freedom Guidance to Human-Scale Mars Entry, Descent, and Landing

Landing humans on Mars comes with many challenges, including the execution of a safe and precise entry, descent, and landing (EDL) sequence. Various NASA studies have shown that there are a variety of EDL guidance methods that potentially offer solutions to the human-scale EDL precision landing problem and work is ongoing to assess new and novel methods. As part of these ongoing studies, a dual-quaternion-based six degree-of-freedom guidance algorithm was implemented in the Program to Optimize Simulated Trajectories II (POST2), a NASA-and industry-standard spacecraft trajectory and vehicle design tool. This algorithm considers both translational and rotational dynamics and casts the trajectory optimization problem as a quadratically constrained quadratic program (QCQP) with various constraints at discrete nodes throughout the trajectory. The QCQP problem is solved via an alternating direction method of multipliers (ADMM) approach, and the output is a discretized optimal trajectory. The guidance is applied to a NASA reference human-scale Mars EDL system, and results are compared and discussed.

Optimization↗

Application of A Dual-Quaternion Six Degree-of-Freedom Guidance to Human-Scale Mars Entry, Descent, and Landing

Landing humans on Mars comes with many challenges, including the execution of a safe and precise entry, descent, and landing (EDL) sequence. Various NASA studies have shown that there are a variety of EDL guidance methods that potentially offer solutions to the human-scale EDL precision landing problem and work is ongoing to assess new and novel methods. As part of these ongoing studies, a dual-quaternion-based six degree-of-freedom guidance algorithm was implemented in the Program to Optimize Simulated Trajectories II (POST2), a NASA-and industry-standard spacecraft trajectory and vehicle design tool. This algorithm considers both translational and rotational dynamics and casts the trajectory optimization problem as a quadratically constrained quadratic program (QCQP) with various constraints at discrete nodes throughout the trajectory. The QCQP problem is solved via an alternating direction method of multipliers (ADMM) approach, and the output is a discretized optimal trajectory. The guidance is applied to a NASA reference human-scale Mars EDL system, and results are compared and discussed.

Optimization↗

Guidance and flight control law development for hypersonic vehicles

During the third reporting period our efforts were focused on a reformulation of the optimal control problem involving active state-variable inequality constraints. In the reformulated problem the optimization is carried out not with respect to all controllers, but only with respect to asymptotic controllers leading to the state constraint boundary. Intimately connected with the traditional formulation is the fact that when the reduced solution for such problems lies on a state constraint boundary, the corresponding boundary layer transitions are of finite time in the stretched time scale. Thus, it has been impossible so far to apply the classical asymptotic boundary layer theory to such problems. Moreover, the traditional formulation leads to optimal controllers that are one-sided, that is, they break down when a disturbance throws the system on the prohibited side of the state constraint boundary.

Calise, A. J.↗

Capacitated p -hub approach for park-and-ride facility location problem under nested logit demand function: polyhedral approaches

By generalizing the unconstrained p-hub approach for the park-and-ride (P&R) facility location problem under the multinomial logit demand function, the capacitated p-hub approach for the problem under the nested logit demand function captures a broader range of real-world cases. To solve this problem optimally, we introduce a mixed-integer linear program and accelerate its solution by enhancing the branch-and-cut procedure. To address the problem at a large scale, we introduce two other polyhedral approaches: variable neighborhood search (VNS) and adaptive randomized rounding (ARR). Downtown areas in Seoul have a high modal share of public transportation and congested road traffic, yet P&R has not been widely implemented. Therefore, we apply the ARR procedure to solve a real-world problem using traffic and geographic data from the Seoul metropolitan area. ARR performs better than VNS and addresses real-world cases. The solutions obtained by ARR present a phased expansion plan that encourages policymakers to start installing a small number of P&Rs immediately.

Capacitated p-hub approach↗

Architecture for Quantum-in-the Loop Real-Time Simulations for Designing Resilient Smart Grids

With the power grid growing more complex every day with the inclusion of new sensors and regulatory approvals that enable end-users and small local developers to participate in the grid, it is becoming challenging for conventional smart grid simulation, emulation, and testing technologies to keep up. In this work, we propose that quantum-encoded real-time simulations can be helpful under the new paradigm and operational circumstances to solve optimization problems for power grids. By leveraging the principles of quantum mechanics, the proposed quantum-in-loop (QIL) framework will enable better and faster optimization solutions based on real-world, real-time data streams, facilitating the real-time planning and operations of electrical grids that rely on millions of distributed sensors and controllers. Furthermore, QIL will allow researchers and engineers to assist utilities in designing, developing, and de-risking algorithms to optimize power grid operation and resilience by considering inputs from millions of grid-connected devices. QIL framework is being developed to have a self-limiting triage mechanism, which will help engineers and practitioners identify fundamental physical limits on quantum processors, revealing what quantum algorithms can and cannot do in utility-specific use cases and must continue to count on classical high-performance computing infrastructure.

digital real-time simulation↗

Algebraic distance on graphs.

Measuring the connection strength between a pair of vertices in a graph is one of the most important concerns in many graph applications. Simple measures such as edge weights may not be sufficient for capturing the effects associated with short paths of lengths greater than one. In this paper, we consider an iterative process that smooths an associated value for nearby vertices, and we present a measure of the local connection strength (called the algebraic distance; see [D. Ron, I. Safro, and A. Brandt, Multiscale Model. Simul., 9 (2011), pp. 407-423]) based on this process. The proposed measure is attractive in that the process is simple, linear, and easily parallelized. An analysis of the convergence property of the process reveals that the local neighborhoods play an important role in determining the connectivity between vertices. We demonstrate the practical effectiveness of the proposed measure through several combinatorial optimization problems on graphs and hypergraphs.

99 GENERAL AND MISCELLANEOUS↗

Communication Lower Bounds and Optimal Algorithms for Symmetric Matrix Computations

In this article, we focus on the communication costs of three symmetric matrix computations: (i) multiplying a matrix with its transpose, known as a symmetric rank-k update (SYRK) (ii) adding the result of the multiplication of a matrix with the transpose of another matrix and the transpose of that result, known as a symmetric rank-2k update (SYR2K) (iii) performing matrix multiplication with a symmetric input matrix (SYMM). All three computations appear in the Level 3 Basic Linear Algebra Subroutines (BLAS) and have wide use in applications involving symmetric matrices. We establish communication lower bounds for these kernels using sequential and distributed-memory parallel computational models, and we show that our bounds are tight by presenting communication-optimal algorithms for each setting. Our lower bound proofs rely on applying a geometric inequality for symmetric computations and analytically solving constrained nonlinear optimization problems. As a result, the symmetric matrix and its corresponding computations are accessed and performed according to a triangular block partitioning scheme in the optimal algorithms.

Al Daas, Hussam [Rutherford Appleton Laboratory, D↗