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 613 records · Page 34

SU-D-BRC-01: An Automatic Beam Model Commissioning Method for Monte Carlo Simulations in Pencil-Beam Scanning Proton Therapy

Purpose: Monte Carlo (MC) simulation is typically regarded as the most accurate dose calculation method for proton therapy. Yet for real clinical cases, the overall accuracy also depends on that of the MC beam model. Commissioning a beam model to faithfully represent a real beam requires finely tuning a set of model parameters, which could be tedious given the large number of pencil beams to commmission. This abstract reports an automatic beam-model commissioning method for pencil-beam scanning proton therapy via an optimization approach. Methods: We modeled a real pencil beam with energy and spatial spread following Gaussian distributions. Mean energy, and energy and spatial spread are model parameters. To commission against a real beam, we first performed MC simulations to calculate dose distributions of a set of ideal (monoenergetic, zero-size) pencil beams. Dose distribution for a real pencil beam is hence linear superposition of doses for those ideal pencil beams with weights in the Gaussian form. We formulated the commissioning task as an optimization problem, such that the calculated central axis depth dose and lateral profiles at several depths match corresponding measurements. An iterative algorithm combining conjugate gradient method and parameter fitting was employed to solve the optimization problem. We validated our method in simulation studies. Results: We calculated dose distributions for three real pencil beams with nominal energies 83, 147 and 199 MeV using realistic beam parameters. These data were regarded as measurements and used for commission. After commissioning, average difference in energy and beam spread between determined values and ground truth were 4.6% and 0.2%. With the commissioned model, we recomputed dose. Mean dose differences from measurements were 0.64%, 0.20% and 0.25%. Conclusion: The developed automatic MC beam-model commissioning method for pencil-beam scanning proton therapy can determine beam model parameters with satisfactory accuracy.

60 APPLIED LIFE SCIENCES↗

A connectionist model for diagnostic problem solving

A competition-based connectionist model for solving diagnostic problems is described. The problems considered are computationally difficult in that (1) multiple disorders may occur simultaneously and (2) a global optimum in the space exponential to the total number of possible disorders is sought as a solution. The diagnostic problem is treated as a nonlinear optimization problem, and global optimization criteria are decomposed into local criteria governing node activation updating in the connectionist model. Nodes representing disorders compete with each other to account for each individual manifestation, yet complement each other to account for all manifestations through parallel node interactions. When equilibrium is reached, the network settles into a locally optimal state. Three randomly generated examples of diagnostic problems, each of which has 1024 cases, were tested, and the decomposition plus competition plus resettling approach yielded very high accuracy.

Peng, Yun↗

Stacking-sequence optimization for buckling of laminated plates by integer programming

Integer-programming formulations for the design of symmetric and balanced laminated plates under biaxial compression are presented. Both maximization of buckling load for a given total thickness and the minimization of total thickness subject to a buckling constraint are formulated. The design variables that define the stacking sequence of the laminate are zero-one integers. It is shown that the formulation results in a linear optimization problem that can be solved on readily available software. This is in contrast to the continuous case, where the design variables are the thicknesses of layers with specified ply orientations, and the optimization problem is nonlinear. Constraints on the stacking sequence such as a limit on the number of contiguous plies of the same orientation and limits on in-plane stiffnesses are easily accommodated. Examples are presented for graphite-epoxy plates under uniaxial and biaxial compression using a commercial software package based on the branch-and-bound algorithm.

Haftka, Raphael T.↗

Direct leaf trajectory optimization for volumetric modulated arc therapy planning with sliding window delivery

Purpose: The authors propose a novel optimization model for volumetric modulated arc therapy (VMAT) planning that directly optimizes deliverable leaf trajectories in the treatment plan optimization problem, and eliminates the need for a separate arc-sequencing step. Methods: In this model, a 360° arc is divided into a given number of arc segments in which the leaves move unidirectionally. This facilitates an algorithm that determines the optimal piecewise linear leaf trajectories for each arc segment, which are deliverable in a given treatment time. Multileaf collimator constraints, including maximum leaf speed and interdigitation, are accounted for explicitly. The algorithm is customized to allow for VMAT delivery using constant gantry speed and dose rate, however, the algorithm generalizes to variable gantry speed if beneficial. Results: The authors demonstrate the method for three different tumor sites: a head-and-neck case, a prostate case, and a paraspinal case. The authors first obtain a reference plan for intensity modulated radiotherapy (IMRT) using fluence map optimization and 20 intensity-modulated fields in equally spaced beam directions, which is beyond the standard of care. Modeling the typical clinical setup for the treatment sites considered, IMRT plans using seven or nine beams are also computed. Subsequently, VMAT plans are optimized by dividing the 360° arc into 20 corresponding arc segments. Assuming typical machine parameters (a dose rate of 600 MU/min, and a maximum leaf speed of 3 cm/s), it is demonstrated that the optimized VMAT plans with 2–3 min delivery time are of noticeably better quality than the 7–9 beam IMRT plans. The VMAT plan quality approaches the quality of the 20-beam IMRT benchmark plan for delivery times between 3 and 4 min. Conclusions: The results indicate that high quality treatments can be delivered in a single arc with 20 arc segments if sufficient time is allowed for modulation in each segment.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

A geometric projection method for designing three-dimensional open lattices with inverse homogenization

Topology optimization is a methodology for assigning material or void to each point in a design domain in a way that extremizes some objective function, such as the compliance of a structure under given loads, subject to various imposed constraints, such as an upper bound on the mass of the structure. Geometry projection is a means to parameterize the topology optimization problem, by describing the design in a way that is independent of the mesh used for analysis of the design's performance; it results in many fewer design parameters, necessarily resolves the ill-posed nature of the topology optimization problem, and provides sharp descriptions of the material interfaces. We extend previous geometric projection work to 3 dimensions and design unit cells for lattice materials using inverse homogenization. We perform a sensitivity analysis of the geometric projection and show it has smooth derivatives, making it suitable for use with gradient-based optimization algorithms. The technique is demonstrated by designing unit cells comprised of a single constituent material plus void space to obtain light, stiff materials with cubic and isotropic material symmetry. Here, we also design a single-constituent isotropic material with negative Poisson's ratio and a light, stiff material comprised of 2 constituent solids plus void space.

42 ENGINEERING↗

Optimal Grouping and Matching for Network-Coded Cooperative Communications

Network-coded cooperative communications (NC-CC) is a new advance in wireless networking that exploits network coding (NC) to improve the performance of cooperative communications (CC). However, there remains very limited understanding of this new hybrid technology, particularly at the link layer and above. This paper fills in this gap by studying a network optimization problem that requires joint optimization of session grouping, relay node grouping, and matching of session/relay groups. After showing that this problem is NP-hard, we present a polynomial time heuristic algorithm to this problem. Using simulation results, we show that our algorithm is highly competitive and can produce near-optimal results.

97 MATHEMATICS AND COMPUTING↗

Flux Control in Networks of Diffusion Paths

A class of optimization problems in networks of intersecting diffusion domains of a special form of thin paths has been considered. The system of equations describing stationary solutions is equivalent to an electrical circuit built of intersecting conductors. The solution of an optimization problem has been obtained and extended to the analogous electrical circuit. The interest in this network arises from, among other applications, an application to wave-particle diffusion through resonant interactions in plasma.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Tsunami evacuation mathematical model for the city of Padang

Tsunami is a series of wave trains which travels with high speed on the sea surface. This traveling wave is caused by the displacement of a large volume of water after the occurrence of an underwater earthquake or volcano eruptions. The speed of tsunami decreases when it reaches the sea shore along with the increase of its amplitudes. Two large tsunamis had occurred in the last decades in Indonesia with huge casualties and large damages. Indonesian Tsunami Early Warning System has been installed along the west coast of Sumatra. This early warning system will give about 10-15 minutes to evacuate people from high risk regions to the safe areas. Here in this paper, a mathematical model for Tsunami evacuation is presented with the city of Padang as a study case. In the model, the safe areas are chosen from the existing and selected high rise buildings, low risk region with relatively high altitude and (proposed to be built) a flyover ring road. Each gathering points are located in the radius of approximately 1 km from the ring road. The model is formulated as an optimization problem with the total normalized evacuation time as the objective function. The constraints consist of maximum allowable evacuation time in each route, maximum capacity of each safe area, and the number of people to be evacuated. The optimization problem is solved numerically using linear programming method with Matlab. Numerical results are shown for various evacuation scenarios for the city of Padang.

54 ENVIRONMENTAL SCIENCES↗

Stochastic scheduling of generating units with weekly energy storage: A hybrid decomposition approach

We propose a solution method for the large-scale stochastic unit commitment (SUC) problem with weekly-dispatched energy storage and significant weather-dependent stochastic generating capacity. Weekly storage facilities that mostly charge during weekends and discharge during weekdays require a weekly scheduling of generating units, which result in a large-scale optimization problem. This SUC problem is formulated as a two-stage stochastic model and we use the conditional value-at-risk as a risk measure. Using a Benders framework, the proposed solution method decomposes the problem into a mixed-integer linear master problem and linear and continuous subproblems. The master problem corresponds to the first-stage decisions throughout the week and includes all the commitment (binary) variables and their corresponding constraints. The subproblems correspond to the actual dispatch of the generating units on a weekly basis. Based on the success of column-and-constraint generation algorithms to solve robust optimization problems, we improve the low communication between the master problem and the subproblems in the standard Benders decomposition by adding primal variables and constraints from the subproblems to the master problem, which provides a better approximation of the recourse function. Furthermore, our computational experiments demonstrate the effectiveness of the proposed decomposition method using an instance of the South Carolina synthetic system with 90 generating units under 40 scenarios.

25 ENERGY STORAGE↗

A non-iterative method for computing the infimum in H(infinity)-optimization

The authors, as an extension of their earlier work, present a simple noniterative procedure for the computation of the exact value of the infimum in the singular H(infinity)-optimization problem and is an extension of their earlier work. The problem formulation is general and does not place any restrictions on the direct feedthrough terms between the disturbance input and the measurement output variables. The method is applicable to a class of singular H(infinity)-optimization problems for which the transfer functions from the control input to the controlled output and from the disturbance input to the measurement output have no invariant zeros on the j-omega axis and also satisfy certain geometric conditions.

Chen, Ben M.↗

PDE-constrained Optimization under Uncertainty

Uncertainty is pervasive in all science and engineering applications. Incorporating uncertainty in physical models is therefore both natural and vital. In doing so, we often arrive at parametric systems of partial differential equations (PDEs). When passing from simulation to optimization, we obtain (typically nonconvex) infinite-dimensional optimization problems that, upon discretization, result in extremely large-scale nonlinear programs. For example, consider a linear elliptic PDE on a two- dimensional domain with a single random coeffcient. If we sampled the random input with 10,000 realizations of the coeffcient, the resulting optimization problem would have 10,000 PDE constraints. Furthermore, discretizing each PDE with piecewise linear finite elements on a 100X100 uni- form quadrilateral mesh results in 100,000,000 degrees of freedom. As a result, the critical components for ensuring mesh-independent performance of numerical optimization methods in the deterministic setting, for example, solution regularity and generalized differentiability, are even more critical in the stochastic setting.

42 ENGINEERING↗

Multifidelity Optimization with Transonic Flutter Constraints

This work considers static and dynamic aeroelastic optimization of a cantilevered platewing in transonic flow. Low- and high-fidelity aeroelastic predictions are fed into a standard trust region model management scheme in order to efficiently solve this expensive optimization problem with multifidelity methods. Differences in fidelity are entirely driven by different aerodynamic solvers: linear panel methods for the low-fidelity method, and inviscid CFD-based solvers for the high-fidelity response. The optimization problem utilizes shape, sizing, and trim variables to satisfy stress, trim, and flutter constraints, and is solved across a range of subsonic and transonic Mach numbers. The multifidelity method is able to provide a speed-up for all cases considered here, despite sizable inaccuracies in the low-fidelity response for transonic flows.

Bret K Stanford↗

Design of High-Accuracy Multiple Flyby Trajectories Using Constrained Optimization

The trajectory optimization technique described in this paper provides several distinct advantages over previous formulations. First, fully numerically integrated trajectory modeling is used. That is, no approximations to the trajectory are made and the inclusion of any level of complicated force models desired is allowed. Second, only trajectory propagation is used so there is no requirement for optimization. This is accomplished by the novel method of splitting the trajectory into independent legs, which are then subjected to constrained optimization. Third, each of the trajectory legs may be specified by any convenient set of parameters particularly useful for that leg. Any of these parameters may then be subject to constraints. Fourth, the nonlinear optimization problem is solved by solving a sequence of linear problems which converges to the optimal nonlinear solution. Fifth, the robustness of this formulation requires little or no user interaction with the optimization once a feasible problem has been posed.

flyby↗

Evaluation of low-exergy heating and cooling systems and topology optimization for deep energy savings at the urban district level

District energy systems have the potential to achieve deep energy savings by leveraging the density and diversity of loads in urban districts. However, planning and adoption of district thermal energy systems is hindered by the analytical burden and high infrastructure costs. It is hypothesized that network topology optimization would enable wider adoption of advanced (ambient temperature) district thermal energy systems, resulting in energy savings. In this study, energy modeling is used to compare the energy performance of “conventional” and “advanced” district thermal energy systems at the urban district level, and a partial exhaustive search is used to evaluate a heuristic for the topology optimization problem. For the prototypical district considered, advanced district thermal energy systems mated with low-exergy building heating and cooling systems achieved a source energy use intensity that was 49% lower than that of conventional systems. The minimal spanning tree heuristic was demonstrated to be effective for the network topology optimization problem in the context of a prototypical district, and contributes to mitigating the problem’s computational complexity. The work presented in this paper demonstrates the potential of advanced district thermal energy systems to achieve deep energy savings, and advances to addressing barriers to their adoption through topology optimization.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Efficient optimal minimum error discrimination of symmetric quantum states

This article deals with the quantum optimal discrimination among mixed quantum states enjoying geometrical uniform symmetry with respect to a reference density operator rho{sub 0}. It is well known that the minimal error probability is given by the positive operator-valued measure obtained as a solution of a convex optimization problem, namely a set of operators satisfying geometrical symmetry, with respect to a reference operator PI{sub 0} and maximizing Tr(rho{sub 0}PI{sub 0}). In this article, by resolving the dual problem, we show that the same result is obtained by minimizing the trace of a semidefinite positive operator X commuting with the symmetry operator and such that X>=rho{sub 0}. The new formulation gives a deeper insight into the optimization problem and allows to obtain closed-form analytical solutions, as shown by a simple but not trivial explanatory example. In addition to the theoretical interest, the result leads to semidefinite programming solutions of reduced complexity, allowing to extend the numerical performance evaluation to quantum communication systems modeled in Hilbert spaces of large dimension.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Modeling Power System Operation with Intermittent Resources

Electricity generating companies and power system operators face the need to minimize total fuel cost or maximize total profit over a given time period. These issues become optimization problems subject to a large number of constraints that must be satisfied simultaneously. The grid updates due to smart-grid technologies plus the penetration of intermittent re- sources in electrical grid introduce additional complexity to the optimization problem. The Renewable Integration Model (RIM) is a computer model of interconnected power system. It is intended to provide insight and advice on complex power systems management, as well as answers to integration of renewable energy questions. This paper describes RIM basic design concept, solution method, and the initial suite of modules that it supports.

Marinovici, Maria C.↗

Final Report---Optimization Under Nonconvexity and Uncertainty: Algorithms and Software

the goal of this work was to develop new algorithmic techniques for solving large-scale numerical optimization problems, focusing on problems classes that have proven to be among the most challenging for practitioners: those involving uncertainty and those involving nonconvexity. This research advanced the state-of-the-art in solving mixed integer linear programs containing symmetry, mixed integer nonlinear programs, and stochastic optimization problems. The focus of the work done in the continuation was on Mixed Integer Nonlinear Programs (MINLP)s and Mixed Integer Linear Programs (MILP)s, especially those containing a great deal of symmetry.

97 MATHEMATICS AND COMPUTING↗

Encoding trade-offs and design toolkits in quantum algorithms for discrete optimization: coloring, routing, scheduling, and other problems

Challenging combinatorial optimization problems are ubiquitous in science and engineering. Several quantum methods for optimization have recently been developed, in different settings including both exact and approximate solvers. Addressing this field of research, this manuscript has three distinct purposes. First, we present an intuitive method for synthesizing and analyzing discrete (i.e., integer-based) optimization problems, wherein the problem and corresponding algorithmic primitives are expressed using a discrete quantum intermediate representation (DQIR) that is encoding-independent. This compact representation often allows for more efficient problem compilation, automated analyses of different encoding choices, easier interpretability, more complex runtime procedures, and richer programmability, as compared to previous approaches, which we demonstrate with a number of examples. Second, we perform numerical studies comparing several qubit encodings; the results exhibit a number of preliminary trends that help guide the choice of encoding for a particular set of hardware and a particular problem and algorithm. Our study includes problems related to graph coloring, the traveling salesperson problem, factory/machine scheduling, financial portfolio rebalancing, and integer linear programming. Third, we design low-depth graph-derived partial mixers (GDPMs) up to 16-level quantum variables, demonstrating that compact (binary) encodings are more amenable to QAOA than previously understood. We expect this toolkit of programming abstractions and low-level building blocks to aid in designing quantum algorithms for discrete combinatorial problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗