The construction of saturated 2Rk-p designs
Combinatorial and sequential analyses for optimization of saturated designs
OPTIMIZATION↗
SEARCH · Engineering Papers
Results for “combinatorial optimization”
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.
Sensitivity studies of 4D descent strategies in an advanced metering environment
An investigation of utilizing various 4D airplane descent strategies in an advanced time-based metering environment was conducted. The three strategies considered were clean-idle Mach/CAS, constant flight path angle (CFPA) Mach/CAS, and fuel-optimal. Traffic inputs consisted of all combinatory pairs of three types of commercial turbojets (B737-300, B747-200, and B767-200) and two weight classes for each airplane type. Sensitivities of traffic throughput and fleet fuel to descent strategies, both among themselves and in combination, for different assigned meter fix times and traffic pairings were studied under controlled initial conditions.
Izumi, K. H.↗
Flight Test of ASAC Aircraft Interior Noise Control System
A flight test is described in which an active structural/acoustic control system reduces turboprop induced interior noise on a Raytheon Aircraft Company 1900D airliner. Control inputs to 21 inertial force actuators were computed adaptively using a transform domain version of the multichannel filtered-X LMS algorithm to minimize the mean square response of 32 microphones. A combinatorial search algorithm was employed to optimize placement of the force actuators on the aircraft frame. Both single frequency and multi-frequency results are presented. Reductions of up to 15 dB were obtained at the blade passage frequency (BPF) during single frequency control tests. Simultaneous reductions of the BPF and next 2 harmonics of 10 dB, 2.5 dB and 3.0 dB, were obtained in a multi-frequency test.
Palumbo, Dan↗
Optimizing Sensor and Actuator Arrays for ASAC Noise Control
This paper summarizes the development of an approach to optimizing the locations for arrays of sensors and actuators in active noise control systems. A type of directed combinatorial search, called Tabu Search, is used to select an optimal configuration from a much larger set of candidate locations. The benefit of using an optimized set is demonstrated. The importance of limiting actuator forces to realistic levels when evaluating the cost function is discussed. Results of flight testing an optimized system are presented. Although the technique has been applied primarily to Active Structural Acoustic Control systems, it can be adapted for use in other active noise control implementations.
Palumbo, Dan↗
Optimal Control Surface Layout for an Aeroservoelastic Wingbox
This paper demonstrates a technique for locating the optimal control surface layout of an aeroservoelastic Common Research Model wingbox, in the context of maneuver load alleviation and active utter suppression. The combinatorial actuator layout design is solved using ideas borrowed from topology optimization, where the effectiveness of a given control surface is tied to a layout design variable, which varies from zero (the actuator is removed) to one (the actuator is retained). These layout design variables are optimized concurrently with a large number of structural wingbox sizing variables and control surface actuation variables, in order to minimize the sum of structural weight and actuator weight. Results are presented that demonstrate interdependencies between structural sizing patterns and optimal control surface layouts, for both static and dynamic aeroelastic physics.
Stanford, Bret K.↗
Aspects of job scheduling
A mathematical model for job scheduling in a specified context is presented. The model uses both linear programming and combinatorial methods. While designed with a view toward optimization of scheduling of facility and plant operations at the Deep Space Communications Complex, the context is sufficiently general to be widely applicable. The general scheduling problem including options for scheduling objectives is discussed and fundamental parameters identified. Mathematical algorithms for partitioning problems germane to scheduling are presented.
Phillips, K.↗
Optimal placement of actuators and sensors in control augmented structural optimization
A control-augmented structural synthesis methodology is presented in which actuator and sensor placement is treated in terms of (0,1) variables. Structural member sizes and control variables are treated simultaneously as design variables. A multiobjective utopian approach is used to obtain a compromise solution for inherently conflicting objective functions such as strucutal mass control effort and number of actuators. Constraints are imposed on transient displacements, natural frequencies, actuator forces and dynamic stability as well as controllability and observability of the system. The combinatorial aspects of the mixed - (0,1) continuous variable design optimization problem are made tractable by combining approximation concepts with branch and bound techniques. Some numerical results for example problems are presented to illustrate the efficacy of the design procedure set forth.
Sepulveda, A. E.↗
Uncertainty management by relaxation of conflicting constraints in production process scheduling
Mathematical-analytical methods as used in Operations Research approaches are often insufficient for scheduling problems. This is due to three reasons: the combinatorial complexity of the search space, conflicting objectives for production optimization, and the uncertainty in the production process. Knowledge-based techniques, especially approximate reasoning and constraint relaxation, are promising ways to overcome these problems. A case study from an industrial CIM environment, namely high-grade steel production, is presented to demonstrate how knowledge-based scheduling with the desired capabilities could work. By using fuzzy set theory, the applied knowledge representation technique covers the uncertainty inherent in the problem domain. Based on this knowledge representation, a classification of jobs according to their importance is defined which is then used for the straightforward generation of a schedule. A control strategy which comprises organizational, spatial, temporal, and chemical constraints is introduced. The strategy supports the dynamic relaxation of conflicting constraints in order to improve tentative schedules.
Dorn, Juergen↗
Three-dimensional unstructured grid generation via incremental insertion and local optimization
Algorithms for the generation of 3D unstructured surface and volume grids are discussed. These algorithms are based on incremental insertion and local optimization. The present algorithms are very general and permit local grid optimization based on various measures of grid quality. This is very important; unlike the 2D Delaunay triangulation, the 3D Delaunay triangulation appears not to have a lexicographic characterization of angularity. (The Delaunay triangulation is known to minimize that maximum containment sphere, but unfortunately this is not true lexicographically). Consequently, Delaunay triangulations in three-space can result in poorly shaped tetrahedral elements. Using the present algorithms, 3D meshes can be constructed which optimize a certain angle measure, albeit locally. We also discuss the combinatorial aspects of the algorithm as well as implementational details.
Barth, Timothy J.↗
Recursive Branching Simulated Annealing Algorithm
This innovation is a variation of a simulated-annealing optimization algorithm that uses a recursive-branching structure to parallelize the search of a parameter space for the globally optimal solution to an objective. The algorithm has been demonstrated to be more effective at searching a parameter space than traditional simulated-annealing methods for a particular problem of interest, and it can readily be applied to a wide variety of optimization problems, including those with a parameter space having both discrete-value parameters (combinatorial) and continuous-variable parameters. It can take the place of a conventional simulated- annealing, Monte-Carlo, or random- walk algorithm. In a conventional simulated-annealing (SA) algorithm, a starting configuration is randomly selected within the parameter space. The algorithm randomly selects another configuration from the parameter space and evaluates the objective function for that configuration. If the objective function value is better than the previous value, the new configuration is adopted as the new point of interest in the parameter space. If the objective function value is worse than the previous value, the new configuration may be adopted, with a probability determined by a temperature parameter, used in analogy to annealing in metals. As the optimization continues, the region of the parameter space from which new configurations can be selected shrinks, and in conjunction with lowering the annealing temperature (and thus lowering the probability for adopting configurations in parameter space with worse objective functions), the algorithm can converge on the globally optimal configuration. The Recursive Branching Simulated Annealing (RBSA) algorithm shares some features with the SA algorithm, notably including the basic principles that a starting configuration is randomly selected from within the parameter space, the algorithm tests other configurations with the goal of finding the globally optimal solution, and the region from which new configurations can be selected shrinks as the search continues. The key difference between these algorithms is that in the SA algorithm, a single path, or trajectory, is taken in parameter space, from the starting point to the globally optimal solution, while in the RBSA algorithm, many trajectories are taken; by exploring multiple regions of the parameter space simultaneously, the algorithm has been shown to converge on the globally optimal solution about an order of magnitude faster than when using conventional algorithms. Novel features of the RBSA algorithm include: 1. More efficient searching of the parameter space due to the branching structure, in which multiple random configurations are generated and multiple promising regions of the parameter space are explored; 2. The implementation of a trust region for each parameter in the parameter space, which provides a natural way of enforcing upper- and lower-bound constraints on the parameters; and 3. The optional use of a constrained gradient- search optimization, performed on the continuous variables around each branch s configuration in parameter space to improve search efficiency by allowing for fast fine-tuning of the continuous variables within the trust region at that configuration point.
Bolcar, Matthew↗
Nonlinear optimal control with tensors - Some computational issues
Some computational issues associated with the calcualtion of optimal feedback controls for nonlinear systems in a tensor setting are described. The specific issues addressed pertain to the combinatorial nature of the loading of the elements into tensors used to represent the system, cost, and feedback, and the subsequent calculations involving these elements. Particular attention is given to: the symmetric tensor algebra which is a natural setting for representing polynomials; the conversions between symmetric and nonsymmetric tensors; the general nature of the calculations required; and the solution equation for nonlinear optimal feedback control. It is concluded that nonlinear tensor feedback can improve performance both in terms of system responses and in terms of system stability region.
Osullivan, J. A.↗
Methodologies for optimal resource allocation to the national space program and new space utilizations. Volume 1: Technical description
The optimal allocation of resources to the national space program over an extended time period requires the solution of a large combinatorial problem in which the program elements are interdependent. The computer model uses an accelerated search technique to solve this problem. The model contains a large number of options selectable by the user to provide flexible input and a broad range of output for use in sensitivity analyses of all entering elements. Examples of these options are budget smoothing under varied appropriation levels, entry of inflation and discount effects, and probabilistic output which provides quantified degrees of certainty that program costs will remain within planned budget. Criteria and related analytic procedures were established for identifying potential new space program directions. Used in combination with the optimal resource allocation model, new space applications can be analyzed in realistic perspective, including the advantage gain from existing space program plant and on-going programs such as the space transportation system.
Source record↗
Test vectors development and optimization for a microprocessor
This paper describes a method for generating and optimizing test vectors for a microprocessor, with the aid of a fault simulator implemented entirely by hardware. The development and optimization of test vectors has been done on a tester, with the fault simulator plugged directly into the test head. The fault simulator is capable of automatically injecting over a thousand single or multiple stuck faults in the sequential and combinatorial parts of the microprocessor. The test vectors developed by a programmer working interactively with the tester were applied through the tester to the fault simulator, and the percent of faults detected was measured. The vectors were developed and optimized for the 1802 microprocessor, with the objective of detecting 100% of the single stuck faults with a minimum set of vectors. Experimental results show that 99.7% of the single stuck faults are being detected with approximately 14,000 vectors.
Timoc, C. C.↗
Optimizing an Actuator Array for the Control of Multi-Frequency Noise in Aircraft Interiors
Techniques developed for selecting an optimized actuator array for interior noise reduction at a single frequency are extended to the multi-frequency case. Transfer functions for 64 actuators were obtained at 5 frequencies from ground testing the rear section of a fully trimmed DC-9 fuselage. A single loudspeaker facing the left side of the aircraft was the primary source. A combinatorial search procedure (tabu search) was employed to find optimum actuator subsets of from 2 to 16 actuators. Noise reduction predictions derived from the transfer functions were used as a basis for evaluating actuator subsets during optimization. Results indicate that it is necessary to constrain actuator forces during optimization. Unconstrained optimizations selected actuators which require unrealistically large forces. Two methods of constraint are evaluated. It is shown that a fast, but approximate, method yields results equivalent to an accurate, but computationally expensive, method.
Palumbo, D. L.↗
Initial Results of Heuristic Guided Orbit Selection for a Low Frequency Radio Interferometric Spacecraft Constellation
A constellation of radio telescope spacecraft can leverage interferometry to accurately image distant objects throughout the universe, but mission design must balance among many interrelated constraints. In particular, the number of craft and the selection of time-varying orbital parameters play a pivotal role in determining what interferometric baselines are feasible with respect to different targets, and thus drives the breadth and quality of data available to the constellation. The large combinatorial orbit configuration space and competing concerns present a challenging problem that is not well addressed by traditional mission design processes. This paper describes application of automated optimization methods to help direct mission design effort to the most promising dynamic constellation geometries: those that achieve broad interferometric coverage but remain cost-effective and resilient to failures. Several automatic heuristic-driven optimization algorithms representing complementary search strategies were created to explore among concrete constellation configuration plans. Evaluation of each candidate constellation plan was accelerated by efficiently combining precomputed caches of orbital and interferometric data. Results indicate that leveraging automated optimization for constellation mission design is both practical and illuminating: generated solutions provided both evidence for existing design intuitions as well as fresh insights into novel configurations.
Hernandez, Sonia↗
A prototype combinatorial scheduler for space-borne observational instruments
A prototype scheduler has been developed for observations to be carried out by the NASA Gamma Ray Observatory. The purpose of the scheduling system is to provide an automated method to determine optimized schedules conforming to all scheduling guidelines. Strategies used in creating COMPTEL/EGRET schedules and in scheduling OSSE targets are examined. It is concluded that the hybrid scheduler creates optimal schedules, or very nearly optimal schedules, and reduces the estimated scheduling time by 18 or 19 orders of magnitude, from about 10 to the 14th years to as few as 561 seconds.
Gilstrap, Lewey O.↗
Optimizing Muscle Parameters in Musculoskeletal Modeling Using Monte Carlo Simulations
Astronauts assigned to long-duration missions experience bone and muscle atrophy in the lower limbs. The use of musculoskeletal simulation software has become a useful tool for modeling joint and muscle forces during human activity in reduced gravity as access to direct experimentation is limited. Knowledge of muscle and joint loads can better inform the design of exercise protocols and exercise countermeasure equipment. In this study, the LifeModeler(TM) (San Clemente, CA) biomechanics simulation software was used to model a squat exercise. The initial model using default parameters yielded physiologically reasonable hip-joint forces. However, no activation was predicted in some large muscles such as rectus femoris, which have been shown to be active in 1-g performance of the activity. Parametric testing was conducted using Monte Carlo methods and combinatorial reduction to find a muscle parameter set that more closely matched physiologically observed activation patterns during the squat exercise. Peak hip joint force using the default parameters was 2.96 times body weight (BW) and increased to 3.21 BW in an optimized, feature-selected test case. The rectus femoris was predicted to peak at 60.1% activation following muscle recruitment optimization, compared to 19.2% activation with default parameters. These results indicate the critical role that muscle parameters play in joint force estimation and the need for exploration of the solution space to achieve physiologically realistic muscle activation.
Hanson, Andrea↗
A Method for Aircraft Concept Selection Using Multicriteria Interactive Genetic Algorithms
The problem of aircraft concept selection has become increasingly difficult in recent years as a result of a change from performance as the primary evaluation criteria of aircraft concepts to the current situation in which environmental effects, economics, and aesthetics must also be evaluated and considered in the earliest stages of the decision-making process. This has prompted a shift from design using historical data regression techniques for metric prediction to the use of physics-based analysis tools that are capable of analyzing designs outside of the historical database. The use of optimization methods with these physics-based tools, however, has proven difficult because of the tendency of optimizers to exploit assumptions present in the models and drive the design towards a solution which, while promising to the computer, may be infeasible due to factors not considered by the computer codes. In addition to this difficulty, the number of discrete options available at this stage may be unmanageable due to the combinatorial nature of the concept selection problem, leading the analyst to arbitrarily choose a sub-optimum baseline vehicle. These concept decisions such as the type of control surface scheme to use, though extremely important, are frequently made without sufficient understanding of their impact on the important system metrics because of a lack of computational resources or analysis tools. This paper describes a hybrid subjective/quantitative optimization method and its application to the concept selection of a Small Supersonic Transport. The method uses Genetic Algorithms to operate on a population of designs and promote improvement by varying more than sixty parameters governing the vehicle geometry, mission, and requirements. In addition to using computer codes for evaluation of quantitative criteria such as gross weight, expert input is also considered to account for criteria such as aeroelasticity or manufacturability which may be impossible or too computationally expensive to consider explicitly in the analysis. Results indicate that concepts resulting from the use of this method represent designs which are promising to both the computer and the analyst, and that a mapping between concepts and requirements that would not otherwise be apparent is revealed.
Buonanno, Michael↗