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,711 records · Page 95

Selection of active member locations in adaptive structures

The effective use of multiple passive and active members in adaptive structures necessitates that these members be optimally distributed throughout the structure. In truss structures, the problem falls into the class of combinatorial optimization for which the solution becomes exceedingly intractable as the problem size increases. This is overcome by using the simulated annealing algorithm to obtain near optimal locations for passive and/or active members. The maximization of the rate of energy dissipation over a finite time period as the measure of optimality is adopted. The selection of optimal locations for both passive and active members is consistently treated through the use of the energy dissipation rate criterion within the simulated annealing algorithm. Numerical examples are used to illustrate the effectiveness of the methodology for large truss structures.

Chen, G.-S.↗

TPSAS-NF1676L-12321-DND

The operation of some networks, such as air transportation networks, can be complicated by congestion through a small subset of nodes. The congestion may be influenced by the connectivity of the network, or by the presence of constraints restricting the flow through particular nodes. This work investigates the effects of both connectivity and node flow constraints on the operation of a network. We develop the Minimax Node Load Problem (MNLP), a multicommodity flow model which minimizes the worst-case flow through any node in a given input network. The optimal solution to this problem provides us with the minimax node load, which we propose as a measure of network congestion. Keeping the number of nodes fixed, we first increase connectivity in a series of networks, and observe that topologies with more distributed connections result in a reduction in the minimax node load. However, when connectivity is increased further, the reductions diminish and are accompanied by solutions with undesirable qualities such as longer commodity paths. We then perform a second set of experiments over the same network, constraining flow through different subsets of nodes at different magnitudes of flow restriction, finding that (1) more constrained nodes lead to the largest increases in minimax node load and (2) constraints on the most connected nodes have the greatest effect on both congestion and commodity path length.

Douglas W Lee↗

TPSAS-NF1676L-12264-DND

The operation of some networks, such as air transportation networks, can be complicated by congestion through a small subset of nodes. The congestion may be influenced by the connectivity of the network, or by the presence of constraints restricting the flow through particular nodes. This work investigates the effects of both connectivity and node flow constraints on the operation of a network. We develop the Minimax Node Load Problem (MNLP), a multicommodity flow model which minimizes the worst-case flow through any node in a given input network. The optimal solution to this problem provides us with the minimax node load, which we propose as a measure of network congestion. Keeping the number of nodes fixed, we first increase connectivity in a series of networks, and observe that topologies with more distributed connections result in a reduction in the minimax node load. However, when connectivity is increased further, the reductions diminish and are accompanied by solutions with undesirable qualities such as longer commodity paths. We then perform a second set of experiments over the same network, constraining flow through different subsets of nodes at different magnitudes of flow restriction, finding that (1) more constrained nodes lead to the largest increases in minimax node load and (2) constraints on the most connected nodes have the greatest effect on both congestion and commodity path length.

Douglas Lee↗

Optimization of coupled systems: A critical overview of approaches

A unified overview is given of problem formulation approaches for the optimization of multidisciplinary coupled systems. The overview includes six fundamental approaches upon which a large number of variations may be made. Consistent approach names and a compact approach notation are given. The approaches are formulated to apply to general nonhierarchic systems. The approaches are compared both from a computational viewpoint and a managerial viewpoint. Opportunities for parallelism of both computation and manpower resources are discussed. Recommendations regarding the need for future research are advanced.

Balling, R. J.↗

An investigation of design optimization using a 2-D viscous flow code with multigrid

Computational fluid dynamics (CFD) codes have advanced to the point where they are effective analytical tools for solving flow fields around complex geometries. There is also a need for their use as a design tool to find optimum aerodynamic shapes. In the area of design, however, a difficulty arises due to the large amount of computer resources required by these codes. It is desired to streamline the design process so that a large number of design options and constraints can be investigated without overloading the system. There are several techniques which have been proposed to help streamline the design process. The feasibility of one of these techniques is investigated. The technique under consideration is the interaction of the geometry change with the flow calculation. The problem of finding the value of camber which maximizes the ratio of lift over drag for a particular airfoil is considered. In order to test out this technique, a particular optimization problem was tried. A NACA 0012 airfoil was considered at free stream Mach number of 0.5 with a zero angle of attack. Camber was added to the mean line of the airfoil. The goal was to find the value of camber for which the ratio of lift over drag is a maximum. The flow code used was FLOMGE which is a two dimensional viscous flow solver which uses multigrid to speed up convergence. A hyperbolic grid generation program was used to construct the grid for each value of camber.

Doria, Michael L.↗

Turbopump Performance Improved by Evolutionary Algorithms

The development of design optimization technology for turbomachinery has been initiated using the multiobjective evolutionary algorithm under NASA's Intelligent Synthesis Environment and Revolutionary Aeropropulsion Concepts programs. As an alternative to the traditional gradient-based methods, evolutionary algorithms (EA's) are emergent design-optimization algorithms modeled after the mechanisms found in natural evolution. EA's search from multiple points, instead of moving from a single point. In addition, they require no derivatives or gradients of the objective function, leading to robustness and simplicity in coupling any evaluation codes. Parallel efficiency also becomes very high by using a simple master-slave concept for function evaluations, since such evaluations often consume the most CPU time, such as computational fluid dynamics. Application of EA's to multiobjective design problems is also straightforward because EA's maintain a population of design candidates in parallel. Because of these advantages, EA's are a unique and attractive approach to real-world design optimization problems.

Oyama, Akira↗

Near Real-Time Optimal Prediction of Adverse Events in Aviation Data

The prediction of anomalies or adverse events is a challenging task, and there are a variety of methods which can be used to address the problem. In this paper, we demonstrate how to recast the anomaly prediction problem into a form whose solution is accessible as a level-crossing prediction problem. The level-crossing prediction problem has an elegant, optimal, yet untested solution under certain technical constraints, and only when the appropriate modeling assumptions are made. As such, we will thoroughly investigate the resilience of these modeling assumptions, and show how they affect final performance. Finally, the predictive capability of this method will be assessed by quantitative means, using both validation and test data containing anomalies or adverse events from real aviation data sets that have previously been identified as operationally significant by domain experts. It will be shown that the formulation proposed yields a lower false alarm rate on average than competing methods based on similarly advanced concepts, and a higher correct detection rate than a standard method based upon exceedances that is commonly used for prediction.

Martin, Rodney Alexander↗

Autorotation flight control system

The present invention provides computer implemented methodology that permits the safe landing and recovery of rotorcraft following engine failure. With this invention successful autorotations may be performed from well within the unsafe operating area of the height-velocity profile of a helicopter by employing the fast and robust real-time trajectory optimization algorithm that commands control motion through an intuitive pilot display, or directly in the case of autonomous rotorcraft. The algorithm generates optimal trajectories and control commands via the direct-collocation optimization method, solved using a nonlinear programming problem solver. The control inputs computed are collective pitch and aircraft pitch, which are easily tracked and manipulated by the pilot or converted to control actuator commands for automated operation during autorotation in the case of an autonomous rotorcraft. The formulation of the optimal control problem has been carefully tailored so the solutions resemble those of an expert pilot, accounting for the performance limitations of the rotorcraft and safety concerns.

Bachelder, Edward N.↗

Recursive multibody dynamics and discrete-time optimal control

A recursive algorithm is developed for the solution of the simulation dynamics problem for a chain of rigid bodies. Arbitrary joint constraints are permitted, that is, joints may allow translational and/or rotational degrees of freedom. The recursive procedure is shown to be identical to that encountered in a discrete-time optimal control problem. For each relevant quantity in the multibody dynamics problem, there exists an analog in the context of optimal control. The performance index that is minimized in the control problem is identified as Gibbs' function for the chain of bodies.

Deleuterio, G. M. T.↗

Aerodynamic shape optimization directed toward a supersonic transport using sensitivity analysis

This investigation was conducted from March 1994 to August 1995, primarily, to extend and implement the previously developed aerodynamic design optimization methodologies for the problems related to a supersonic transport design. These methods had demonstrated promise to improve the designs (more specifically, the shape) of aerodynamic surfaces, by coupling optimization algorithms (OA) with Computational Fluid Dynamics (CFD) algorithms via sensitivity analyses (SA) with surface definition methods from Computer Aided Design (CAD). The present extensions of this method and their supersonic implementations have produced wing section designs, delta wing designs, cranked-delta wing designs, and nacelle designs, all of which have been reported in the open literature. Despite the fact that these configurations were highly simplified to be of any practical or commercial use, they served the algorithmic and proof-of-concept objectives of the study very well. The primary cause for the configurational simplifications, other than the usual simplify-to-study the fundamentals reason, were the premature closing of the project. Only after the first of the originally intended three-year term, both the funds and the computer resources supporting the project were abruptly cut due to their severe shortages at the funding agency. Nonetheless, it was shown that the extended methodologies could be viable options in optimizing the design of not only an isolated single-component configuration, but also a multiple-component configuration in supersonic and viscous flow. This allowed designing with the mutual interference of the components being one of the constraints all along the evolution of the shapes.

Baysal, Oktay↗

Transport Aircraft Wing Camber Control: A Periodic Perturbation Approach

The possibilities of camber control are underscored by the relatively recent introduction of fly-by-wire technology in modem transport aircraft. To date, however, the issue of the algorithm for in-flight adaptive camber optimization has not been properly addressed. As such, the development of a robust and efficient algorithm to adjust, in flight, the aircraft control surfaces configuration is in order. This paper explores the applicability a periodic perturbation optimizing technique to this problem. The method is based on a direct measurement of the performance and, as such, it also includes the engines' contributions to the overall performance optimization. The actual performance improvement comes, thus, from the integrated effects of airframe and engine. The algorithm is demonstrated on a B720 flight simulator at NASA/Dryden Simulation Laboratory.

Espana, Martin↗

Neural networks in structural analysis and design - An overview

The present paper provides an overview of the state-of-the-art in the application of neural networks in problems of structural analysis and design, including a survey of published applications in structural engineering. Such applications have included, among others, the use of neural networks in modeling nonlinear analysis of structures, as a rapid reanalysis capability in optimal design, and in developing problem parameter sensitivity of optimal solutions for use in multilevel decomposition based design. While most of the applications reported in the literature have been restricted to the use of the multilayer perceptron architecture and minor variations thereof, other network architectures have also been successfully explored, including the ART network, the counterpropagation network and the Hopfield-Tank model.

Hajela, P.↗

Application of Simulated Annealing and Related Algorithms to TWTA Design

Simulated Annealing (SA) is a stochastic optimization algorithm used to search for global minima in complex design surfaces where exhaustive searches are not computationally feasible. The algorithm is derived by simulating the annealing process, whereby a solid is heated to a liquid state and then cooled slowly to reach thermodynamic equilibrium at each temperature. The idea is that atoms in the solid continually bond and re-bond at various quantum energy levels, and with sufficient cooling time they will rearrange at the minimum energy state to form a perfect crystal. The distribution of energy levels is given by the Boltzmann distribution: as temperature drops, the probability of the presence of high-energy bonds decreases. In searching for an optimal design, local minima and discontinuities are often present in a design surface. SA presents a distinct advantage over other optimization algorithms in its ability to escape from these local minima. Just as high-energy atomic configurations are visited in the actual annealing process in order to eventually reach the minimum energy state, in SA highly non-optimal configurations are visited in order to find otherwise inaccessible global minima. The SA algorithm produces a Markov chain of points in the design space at each temperature, with a monotonically decreasing temperature. A random point is started upon, and the objective function is evaluated at that point. A stochastic perturbation is then made to the parameters of the point to arrive at a proposed new point in the design space, at which the objection function is evaluated as well. If the change in objective function values (Delta)E is negative, the proposed new point is accepted. If (Delta)E is positive, the proposed new point is accepted according to the Metropolis criterion: rho((Delta)f) = exp((-Delta)E/T), where T is the temperature for the current Markov chain. The process then repeats for the remainder of the Markov chain, after which the temperature is decremented and the process repeats. Eventually (and hopefully), a near-globally optimal solution is attained as T approaches zero. Several exciting variants of SA have recently emerged, including Discrete-State Simulated Annealing (DSSA) and Simulated Tempering (ST). The DSSA algorithm takes the thermodynamic analogy one step further by categorizing objective function evaluations into discrete states. In doing so, many of the case-specific problems associated with fine-tuning the SA algorithm can be avoided; for example, theoretical approximations for the initial and final temperature can be derived independently of the case. In this manner, DSSA provides a scheme that is more robust with respect to widely differing design surfaces. ST differs from SA in that the temperature T becomes an additional random variable in the optimization. The system is also kept in equilibrium as the temperature changes, as opposed to the system being driven out of equilibrium as temperature changes in SA. ST is designed to overcome obstacles in design surfaces where numerous local minima are separated by high barriers. These algorithms are incorporated into the optimal design of the traveling-wave tube amplifier (TWTA). The area under scrutiny is the collector, in which it would be ideal to use negative potential to decelerate the spent electron beam to zero kinetic energy just as it reaches the collector surface. In reality this is not plausible due to a number of physical limitations, including repulsion and differing levels of kinetic energy among individual electrons. Instead, the collector is designed with multiple stages depressed below ground potential. The design of this multiple-stage collector is the optimization problem of interest. One remaining problem in SA and DSSA is the difficulty in determining when equilibrium has been reached so that the current Markov chain can be terminated. It has been suggested in recent literature that simulating the thermodynamic properties opecific heat, entropy, and internal energy from the Boltzmann distribution can provide good indicators of having reached equilibrium at a certain temperature. These properties are tested for their efficacy and implemented in SA and DSSA code with respect to TWTA collector optimization.

Radke, Eric M.↗

Welding As Science: Applying Basic Engineering Principles to the Discipline

This Technical Memorandum provides sample problems illustrating ways in which basic engineering science has been applied to the discipline of welding. Perhaps inferences may be drawn regarding optimal approaches to particular welding problems, as well as for the optimal education for welding engineers. Perhaps also some readers may be attracted to the science(s) of welding and may make worthwhile contributions to the discipline.

Nunes, A. C., Jr.↗

Formulations and applications of large structure actuator and sensor placements

A new approach based on the steady-state solutions of the optimal control and estimation problems is presented to study respectively the actuator and sensor locations for large flexible structures. A simple and computer-implementable formulation for minimizing the steady state optimal cost function and the state estimation error inherent in the estimation process is given. In conjunction with the new approach, two criteria are established relating the actuator and the sensor placement optimalities respectively to the minimums of the optimal cost function and the state estimation error. To illustrate the concepts of this paper, we present the results of some numerical and analytical studies on the actuator and the sensor locations of several simple flexible beam modes.

Juang, J.-N.↗

Intelligent perturbation algorithms to space scheduling optimization

The limited availability and high cost of crew time and scarce resources make optimization of space operations critical. Advances in computer technology coupled with new iterative search techniques permit the near optimization of complex scheduling problems that were previously considered computationally intractable. Described here is a class of search techniques called Intelligent Perturbation Algorithms. Several scheduling systems which use these algorithms to optimize the scheduling of space crew, payload, and resource operations are also discussed.

Kurtzman, Clifford R.↗

Parallel dynamic programming for on-line flight path optimization

Parallel systolic algorithms for dynamic programming(DP) and their respective hardware implementations are presented for a problem in on-line trajectory optimization. The method is applied to a model for helicopter flight path optimization through a complex constraint region. This problem has application to an air traffic control problem and also to a terrain following/threat avoidance problem.

Slater, G. L.↗