Design of tensegrity structures using parametric analysis and stochastic search

Tensegrity structures are lightweight structures composed of cables in tension and struts in compression. Since tensegrity systems exhibit geometrically nonlinear behavior, finding optimal structural designs is difficult. This paper focuses on the use of stochastic search for the design of tensegrity systems. A pedestrian bridge made of square hollow-rope tensegrity ring modules is studied. Two design methods are compared in this paper. Both methods aim to find the minimal cost solution. The first method approximates current practice in design offices. More specifically, parametric analysis that is similar to a gradient-based optimization is used to identify good designs. Parametric studies are executed for each system parameter in order to identify its influence on response. The second method uses a stochastic search strategy called probabilistic global search Lausanne. Both methods provide feasible configurations that meet civil engineering criteria of safety and serviceability. Parametric studies also help in defining search parameters such as appropriate penalty costs to enforce constraints while optimizing using stochastic search. Traditional design methods are useful to gain an understanding of structural behavior. However, due to the many local minima in the solution space, stochastic search strategies find better solutions than parametric studie

Design of tensegrity structures using parametric analysis and stochastic search.

The final publication is available at Springer via http://dx.doi.org/10.1007/s00366-009-0154-1Tensegrity structures are lightweight structures composed of cables in tension and struts in compression. Since tensegrity systems exhibit geometrically nonlinear behavior, finding optimal structural designs is difficult. This paper focuses on the use of stochastic search for the design of tensegrity systems. A pedestrian bridge made of square hollow-rope tensegrity ring modules is studied. Two design methods are compared in this paper. Both methods aim to find the minimal cost solution. The first method approximates current practice in design offices. More specifically, parametric analysis that is similar to a gradient-based optimization is used to identify good designs. Parametric studies are executed for each system parameter in order to identify its influence on response. The second method uses a stochastic search strategy called probabilistic global search Lausanne. Both methods provide feasible configurations that meet civil engineering criteria of safety and serviceability. Parametric studies also help in defining search parameters such as appropriate penalty costs to enforce constraints while optimizing using stochastic search. Traditional design methods are useful to gain an understanding of structural behavior. However, due to the many local minima in the solution space, stochastic search strategies find better solutions than parametric studies.Swiss National Science Foundatio

Optimization of technological parameters when polishing sic materials by magnetic compound fluid with the straight electromagnetic yoke

Crystallized silicon carbide (SiC) wafers are widely used in the field of integrated circuits as well as essential in the epitaxial growth of graphene and are one of the promising materials for applications in electronics at future high capacity. The surface quality of the required ultra-fine crystalline silicon wafer is the most essential factor in achieving graphene's desired electronic properties. Aiming to produce superfine surface quality SiC wafers, in this study, a new algorithm is developed to solve optimization problems with many nonlinear factors in ultra-precision machining by magnetic liquid mixture. The presented algorithm is a collective global search inspired by artificial intelligence based on the coordination of nonlinear systems occurring in machining processes. A new algorithm based on the optimization collaborative of multiple nonlinear systems (OCMNO) with the same flexibility and high convergence was established in optimizing surface quality when polishing the SiC wafers. To show the effectiveness of the proposed OCMNO algorithm, the benchmark functions were analyzed together with the established SiC wafers polishing optimization process. To give the best-machined surface quality, polishing experiments were set to find the optimal technological parameters based on a new algorithm and straight electromagnetic yoke polishing method. From the analysis and experimental results when polishing SiC wafers in an electromagnetic yoke field when using a magnetic compound fluid (MCF) with technological parameters according to the OCMNO algorithm for ultra-smooth surface quality with Ra=2.306 nm. The study aims to provide an excellent reference value in optimizing surface polishing SiC wafers, semiconductor materials, and optical device

Meta-heuristic algorithms in car engine design: a literature survey

Meta-heuristic algorithms are often inspired by natural phenomena, including the evolution of species in Darwinian natural selection theory, ant behaviors in biology, flock behaviors of some birds, and annealing in metallurgy. Due to their great potential in solving difficult optimization problems, meta-heuristic algorithms have found their way into automobile engine design. There are different optimization problems arising in different areas of car engine management including calibration, control system, fault diagnosis, and modeling. In this paper we review the state-of-the-art applications of different meta-heuristic algorithms in engine management systems. The review covers a wide range of research, including the application of meta-heuristic algorithms in engine calibration, optimizing engine control systems, engine fault diagnosis, and optimizing different parts of engines and modeling. The meta-heuristic algorithms reviewed in this paper include evolutionary algorithms, evolution strategy, evolutionary programming, genetic programming, differential evolution, estimation of distribution algorithm, ant colony optimization, particle swarm optimization, memetic algorithms, and artificial immune system

Metaheuristic design of feedforward neural networks: a review of two decades of research

Over the past two decades, the feedforward neural network (FNN) optimization has been a key interest among the researchers and practitioners of multiple disciplines. The FNN optimization is often viewed from the various perspectives: the optimization of weights, network architecture, activation nodes, learning parameters, learning environment, etc. Researchers adopted such different viewpoints mainly to improve the FNN's generalization ability. The gradient-descent algorithm such as backpropagation has been widely applied to optimize the FNNs. Its success is evident from the FNN's application to numerous real-world problems. However, due to the limitations of the gradient-based optimization methods, the metaheuristic algorithms including the evolutionary algorithms, swarm intelligence, etc., are still being widely explored by the researchers aiming to obtain generalized FNN for a given problem. This article attempts to summarize a broad spectrum of FNN optimization methodologies including conventional and metaheuristic approaches. This article also tries to connect various research directions emerged out of the FNN optimization practices, such as evolving neural network (NN), cooperative coevolution NN, complex-valued NN, deep learning, extreme learning machine, quantum NN, etc. Additionally, it provides interesting research challenges for future research to cope-up with the present information processing era

Branch and bound method for regression-based controlled variable selection

Self-optimizing control is a promising method for selection of controlled variables (CVs) from available measurements. Recently, Ye, Cao, Li, and Song (2012) have proposed a globally optimal method for selection of self-optimizing CVs by converting the CV selection problem into a regression problem. In this approach, the necessary conditions of optimality (NCO) are approximated by linear combinations of available measurements over the entire operation region. In practice, it is desired that a subset of available measurements be combined as CVs to obtain a good trade-off between the economic performance and the complexity of control system. The subset selection problem, however, is combinatorial in nature, which makes the application of the globally optimal CV selection method to large-scale processes difficult. In this work, an efficient branch and bound (BAB) algorithm is developed to handle the computational complexity associated with the selection of globally optimal CVs. The proposed BAB algorithm identifies the best measurement subset such that the regression error in approximating NCO is minimized and is also applicable to the general regression problem. Numerical tests using randomly generated matrices and a binary distillation column case study demonstrate the computational efficiency of the proposed BAB algorithm

Design of tensegrity structures using parametric analysis and stochastic search

Tensegrity structures are lightweight structures composed of cables in tension and struts in compression. Since tensegrity systems exhibit geometrically nonlinear behavior, finding optimal structural designs is difficult. This paper focuses on the use of stochastic search for the design of tensegrity systems. A pedestrian bridge made of square hollow-rope tensegrity ring modules is studied. Two design methods are compared in this paper. Both methods aim to find the minimal cost solution. The first method approximates current practice in design offices. More specifically, parametric analysis that is similar to a gradient-based optimization is used to identify good designs. Parametric studies are executed for each system parameter in order to identify its influence on response. The second method uses a stochastic search strategy called probabilistic global search Lausanne. Both methods provide feasible configurations that meet civil engineering criteria of safety and serviceability. Parametric studies also help in defining search parameters such as appropriate penalty costs to enforce constraints while optimizing using stochastic search. Traditional design methods are useful to gain an understanding of structural behavior. However, due to the many local minima in the solution space, stochastic search strategies find better solutions than parametric studies

Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded

Decision trees usefully represent sparse, high dimensional and noisy data. Having learned a function from this data, we may want to thereafter integrate the function into a larger decision-making problem, e.g., for picking the best chemical process catalyst. We study a large-scale, industrially-relevant mixed-integer nonlinear nonconvex optimization problem involving both gradient-boosted trees and penalty functions mitigating risk. This mixed-integer optimization problem with convex penalty terms broadly applies to optimizing pre-trained regression tree models. Decision makers may wish to optimize discrete models to repurpose legacy predictive models, or they may wish to optimize a discrete model that particularly well-represents a data set. We develop several heuristic methods to find feasible solutions, and an exact, branch-and-bound algorithm leveraging structural properties of the gradient-boosted trees and penalty functions. We computationally test our methods on concrete mixture design instance and a chemical catalysis industrial instance