31 research outputs found
Minimizing distortion in truss structures via Tabu search
The shape control of large flexible space structures is of great interest to structural designers. A related problem is to seek ways to minimize the need for active controls by careful design and construction of the space structure. A tetrahedral truss structure that is used to support a precision segmented reflector or antenna surface is considered. The structure has a hexagonal platform and is characterized by the number of rings of members in the truss. For simplicity it is assumed that a flat truss geometry exists. Hence, all structural members and ball joints are required to have the same nominal length and diameter, respectively. Inaccuracies in the length of member or diameters of joints may produce unacceptable levels of surface distortion and internal forces. In the case of a truss structure supporting an antenna, surface distortions may cause unacceptable gain loss or pointing errors. The focus is solely on surface distortion, however, internal forces may be treated in a similar manner. To test the Tabu search code for DSQRMS the appropriate influence matrices are used for a flat, two-ring tetrahedral reflector truss generated by Green and Haftka (1989). In this example there are 102 members (NMEMB) and 31 ball joints (NJOINT) of the same nominal length, respectively. Hence, all the members may be interchanged and all the joints may be interchanged. In addition, 19 positions on the surface of the truss (NNODES) were used to measure error influences. After a variety of experiments a set of good parameters was choosen for Tabu search. The sample size at each iteration is 10*NMEMB and the short term memory size is 40. In addition four pruning rules were used to accelerate the search.
The damper placement problem for large flexible space structures
The damper placement problem for large flexible space truss structures is formulated as a combinatorial optimization problem. The objective is to determine the p truss members of the structure to replace with active (or passive) dampers so that the modal damping ratio is as large as possible for all significant modes of vibration. Equivalently, given a strain energy matrix with rows indexed on the modes and the columns indexed on the truss members, we seek to find the set of p columns such that the smallest row sum, over the p columns, is maximized. We develop a tabu search heuristic for the damper placement problems on the Controls Structures Interaction (CSI) Phase 1 Evolutionary Model (10 modes and 1507 truss members). The resulting solutions are shown to be of high quality
Minimizing distortion and internal forces in truss structures by simulated annealing
Inaccuracies in the length of members and the diameters of joints of large truss reflector backup structures may produce unacceptable levels of surface distortion and member forces. However, if the member lengths and joint diameters can be measured accurately it is possible to configure the members and joints so that root-mean-square (rms) surface error and/or rms member forces is minimized. Following Greene and Haftka (1989) it is assumed that the force vector f is linearly proportional to the member length errors e(sub M) of dimension NMEMB (the number of members) and joint errors e(sub J) of dimension NJOINT (the number of joints), and that the best-fit displacement vector d is a linear function of f. Let NNODES denote the number of positions on the surface of the truss where error influences are measured. The solution of the problem is discussed. To classify, this problem was compared to a similar combinatorial optimization problem. In particular, when only the member length errors are considered, minimizing d(sup 2)(sub rms) is equivalent to the quadratic assignment problem. The quadratic assignment problem is a well known NP-complete problem in operations research literature. Hence minimizing d(sup 2)(sub rms) is is also an NP-complete problem. The focus of the research is the development of a simulated annealing algorithm to reduce d(sup 2)(sub rms). The plausibility of this technique is its recent success on a variety of NP-complete combinatorial optimization problems including the quadratic assignment problem. A physical analogy for simulated annealing is the way liquids freeze and crystallize. All computational experiments were done on a MicroVAX. The two interchange heuristic is very fast but produces widely varying results. The two and three interchange heuristic provides less variability in the final objective function values but runs much more slowly. Simulated annealing produced the best objective function values for every starting configuration and was faster than the two and three interchange heuristic
The molecular matching problem
Molecular chemistry contains many difficult optimization problems that have begun to attract the attention of optimizers in the Operations Research community. Problems including protein folding, molecular conformation, molecular similarity, and molecular matching have been addressed. Minimum energy conformations for simple molecular structures such as water clusters, Lennard-Jones microclusters, and short polypeptides have dominated the literature to date. However, a variety of interesting problems exist and we focus here on a molecular structure matching (MSM) problem
Sensor/Actuator Selection for Gust and Turbulence Control
From aircraft fuselages and space stations to vacuum cleaners and automobiles, active control of noise and/or vibration has come of age. Determining the number of active control devices (e.g. actuators) to be placed and where they are to be placed is the prototypical location problem. However, unlike typical location problems, where the customer is readily identified and is actively engaged in the assessment of the performance of the chosen locations, the customers that active control devices serve are not so easily identified and their impact on system performance issues may be unclear. For example, consider the problem of where to locate actuators to attenuate cabin noise in a propeller driven aircraft. Clearly, the ultimate customers are the passengers who will travel in these aircraft. But to decide whether one set of actuator locations is better than another it is unlikely we will ask passengers to fly in the aircraft and fill out a questionnaire about noise levels. Instead a set of sensors (pseudo-customers) are placed and the system performance of the actuators, as measured by these sensors, is recorded. Hence, we have yet another location problem. How many sensors should there be and where should they be located? In many instances collocation of sensors and actuators is the answer but in other instances it is not. A variety of approaches have been taken to address these sensor/actuator location problems. With regard to damping vibrations in truss structures (space station prototypes) it was formulated a new noxious location problem and generated high-quality solutions with a combination of LP-relaxations and heuristic search procedures. Other related efforts are summarized the actuator location problem for a single frequency interior noise control problem was examined for an idealized aircraft cabin. A tabu search procedure was shown to generate better locations for the actuators than a modal decomposition approach. The model was extended to include multi-frequency information. The sensor location problem is addressed. In the latter article a reactive tabu search scheme was shown to dominate a static tabu search approach. Our focus here is to determine locations to control and/or sense vibrations on a truss structure. However, instead of using one of the earlier optimization models referenced in the above paragraph we adopt an experimental design approach
Algorithm and Complexity for a Network Assortativity Measure
We show that finding a graph realization with the minimum Randi\'c index for
a given degree sequence is solvable in polynomial time by formulating the
problem as a minimum weight perfect b-matching problem. However, the
realization found via this reduction is not guaranteed to be connected.
Approximating the minimum weight b-matching problem subject to a connectivity
constraint is shown to be NP-Hard. For instances in which the optimal solution
to the minimum Randi\'c index problem is not connected, we describe a heuristic
to connect the graph using pairwise edge exchanges that preserves the degree
sequence. In our computational experiments, the heuristic performs well and the
Randi\'c index of the realization after our heuristic is within 3% of the
unconstrained optimal value on average. Although we focus on minimizing the
Randi\'c index, our results extend to maximizing the Randi\'c index as well.
Applications of the Randi\'c index to synchronization of neuronal networks
controlling respiration in mammals and to normalizing cortical thickness
networks in diagnosing individuals with dementia are provided.Comment: Added additional section on application
Toward Optimal Transport Networks
Strictly evolutionary approaches to improving the air transport system a highly complex network of interacting systems no longer suffice in the face of demand that is projected to double or triple in the near future. Thus evolutionary approaches should be augmented with active design methods. The ability to actively design, optimize and control a system presupposes the existence of predictive modeling and reasonably well-defined functional dependences between the controllable variables of the system and objective and constraint functions for optimization. Following recent advances in the studies of the effects of network topology structure on dynamics, we investigate the performance of dynamic processes on transport networks as a function of the first nontrivial eigenvalue of the network's Laplacian, which, in turn, is a function of the network s connectivity and modularity. The last two characteristics can be controlled and tuned via optimization. We consider design optimization problem formulations. We have developed a flexible simulation of network topology coupled with flows on the network for use as a platform for computational experiments
An Investigation of Synchrony in Transport Networks
The cumulative degree distributions of transport networks, such as air transportation networks and respiratory neuronal networks, follow power laws. The significance of power laws with respect to other network performance measures, such as throughput and synchronization, remains an open question. Evolving methods for the analysis and design of air transportation networks must be able to address network performance in the face of increasing demands and the need to contain and control local network disturbances, such as congestion. Toward this end, we investigate functional relationships that govern the performance of transport networks; for example, the links between the first nontrivial eigenvalue, lambda(2), of a network\u27s Laplacian matrix-a quantitative measure of network synchronizability-and other global network parameters. In particular among networks with a fixed degree distribution and fixed network assortativity (a measure of a networks preference to attach nodes based on a similarity or difference), those with small lambda(2) are shown to be poor synchronizers, to have much longer shortest paths and to have greater clustering in comparison to those with large lambda(2). A simulation of a respiratory network adds data. to our investigation. This study is a beginning step in developing metrics and design variables for the analysis and active design of air transport networks. (C) 2008 Wiley Periodicals, Inc. Complexity 14:34-43,200
Quelling Cabin Noise in Turboprop Aircraft via Active Control
Cabin noise in turboprop aircraft causes passenger discomfort, airframe fatigue, and employee scheduling constraints due to OSHA standards for exposure to high levels of noise. The noise levels in the cabins of turboprop aircraft are typically 10 to 30 decibels louder than commercial jet noise levels. However. unlike jet noise the turboprop noise spectrum is dominated by a few low frequency tones. Active structural acoustic control is a method in which the control inputs (used to reduce interior noise) are applied directly to a vibrating structural acoustic system. The control concept modeled in this work is the application of in-plane force inputs to piezoceramic patches bonded to the wall of a vibrating cylinder. The goal is to determine the force inputs and locations for the piezoceramic actuators so that: (1) the interior noise is effectively damped; (2) the level of vibration of the cylinder shell is not increased; and (3) the power requirements needed to drive the actuators are not excessive. Computational experiments for data taken from a computer generated model and from a laboratory test article at NASA Langley Research Center are provided
A Minimax Network Flow Model for Characterizing the Impact of Slot Restrictions
This paper proposes a model for evaluating long-term measures to reduce congestion at airports in the National Airspace System (NAS). This model is constructed with the goal of assessing the global impacts of congestion management strategies, specifically slot restrictions. We develop the Minimax Node Throughput Problem (MINNTHRU), a multicommodity network flow model that provides insight into air traffic patterns when one minimizes the worst-case operation across all airports in a given network. MINNTHRU is thus formulated as a model where congestion arises from network topology. It reflects not market-driven airline objectives, but those of a regulatory authority seeking a distribution of air traffic beneficial to all airports, in response to congestion management measures. After discussing an algorithm for solving MINNTHRU for moderate-sized (30 nodes) and larger networks, we use this model to study the impacts of slot restrictions on the operation of an entire hub-spoke airport network. For both a small example network and a medium-sized network based on 30 airports in the NAS, we use MINNTHRU to demonstrate that increasing the severity of slot restrictions increases the traffic around unconstrained hub airports as well as the worst-case level of operation over all airports