Multiobjective design of actively controlled structures using a hybrid optimization method

A multiobjective approach to the combined structure and control optimization problem for flexible space structures is presented. The proposed formulation addresses robustness considerations for controller design, as well as a simultaneous determination of optimum actuator locations. The structural weight, controlled system energy, stability robustness index and damping augmentation provided by the active controller are considered as objective functions of the multiobjective problem which is solved using a cooperative game-theoretic approach. The actuator locations and the cross-sectional areas of structural members are treated as design variables. Since the actuator locations are spatially discrete, whereas the cross-sectional areas are continuous, the optimization problem has mixed discrete-continuous design variables. A solution approach to this problem based on a hybrid optimization scheme is presented. The hybrid optimizer is a synergetic blend of artificial genetic search and gradient-based search techniques. The computational procedure is demonstrated through the design of an ACOSS-FOUR space structure. The optimum solutions obtained using the hybrid optimizer are shown to outperform the optimum results obtained using gradient-based search techniques.     

A genetic algorithm approach to single and multiobjective structural optimization with discrete–continuous variables

A search procedure with a philosophical basis in molecular biology is adapted for solving single and multiobjective structural optimization problems. This procedure, known as a genetic algorithm (GA). utilizes a blending of the principles of natural genetics and natural selection. A lack of dependence on the gradient information makes GAs less susceptible to pitfalls of convergence to a local optimum. To model the multiple objective functions in the problem formulation, a co-operative game theoretic approach is proposed. Examples dealing with single and multiobjective geometrical design of structures with discrete–continuous design variables, and using artificial genetic search are presented. Simulation results indicate that GAs converge to optimum solutions by searching only a small fraction of the solution space. The optimum solutions obtained using GAs compare favourably with optimum solutions obtained using gradient-based search techniques. The results indicate that the efficiency and power of GAs can be effectively utilized to solve a broad spectrum of design optimization problems with discrete and continuous variables with similar efficiency.     

Single and multiobjective structural optimization in discrete-continuous variables using simulated annealing

A multivariable optimization technique based on the Monte-Carlo method used in statistical mechanics studies of condensed systems is adapted for solving single and multiobjective structural optimization problems. This procedure, known as simulated annealing, draws an analogy between energy minimization in physical systems and objective function minimization in structural systems. The search for a minimum is simulated by a relaxation of the statistical mechanical system where a probabilistic acceptance criterion is used to accept or reject candidate designs. To model the multiple objective functions in the problem formulation, a cooperative game theoretic approach is used. Numerical results obtained using three different annealing strategies for the single and multiobjective design of structures with discrete-continuous variables are presented. The influence of cooling schedule parameters on the optimum solutions obtained is discussed. Simulation results indicate that, in several instances, the optimum solutions obtained using simulated annealing outperform the optimum solutions obtained using some gradient-based and discrete optimization techniques. The results also indicate that simulated annealing has substantial potential for additional applications in optimization, especially for problems with mixed discrete-continuous variables.     

基于遗传算法的离散型结构拓扑优化设计

采用遗传算法求解包括桁架结构和框架结构的离散型结构拓扑优化问题。在遗传算法的基础上,通过引入拓扑变量并修改被删除杆件的材料弹性模量,提出了一个受多工况荷载作用,能同时考虑应力、稳定及位移等约束的离散型结构拓扑优化问题统一数学模型。该模型不但能同时适用于桁架结构和框架结构等离散型结构拓扑优化问题,而且还能解决奇异最优解问题。结合上述统一数学模型和遗传算法,给出了求解离散型结构拓扑优化问题的优化方法。算例结果表明,采用该文提出的拓扑优化方法可有效、方便地对桁架结构、框架结构等离散型结构进行拓扑优化设计。     

An implementation of the iterated tabu search algorithm for the quadratic assignment problem

In this paper, we describe an implementation of the iterated tabu search (ITS) algorithm for the quadratic assignment problem (QAP), which is one of the well-known problems in combinatorial optimization. The medium- and large-scale QAPs are not, to this date, practically solvable to optimality, therefore heuristic algorithms are widely used. In the proposed ITS approach, intensification and diversification mechanisms are combined in a proper way. The goal of intensification is to search for good solutions in the neighbourhood of a given solution, while diversification is responsible for escaping from local optima and moving towards new regions of the search space. In particular, the following enhancements were implemented: new formula for fast evaluation of the objective function and efficient data structure; extended intensification mechanisms (including randomized tabu criterion, combination of tabu search and local search, dynamic tabu list maintaining); enhanced diversification strategy using periodic tabu tenure and special mutation procedure. The ITS algorithm is tested on the different instances taken from the QAP library QAPLIB. The results from the experiments demonstrate promising efficiency of the proposed algorithm, especially for the random QAP instances.     

Applying multiple objective tabu search to continuous optimization problems with a simple neighbourhood strategy

One of the first multiple objective versions of the tabu search (TS) algorithm is proposed by the author. The idea of applying TS to multiple objective optimization is inspired from its solution structure. TS works with more than one solution (neighbourhood solutions) at a time and this situation gives the opportunity to evaluate multiple objectives simultaneously in one run. The selection and updating stages are modified to enable the original TS algorithm to work with more than one objective. In this paper, the multiple objective tabu search (MOTS) algorithm is applied to multiple objective non‐linear optimization problems with continuous variables using a simple neighbourhood strategy. The algorithm is applied to four mechanical components design problems. The results are compared with several other solution techniques including multiple objective genetic algorithms. It is observed that MOTS is able to find better and much wider spread of solutions than the reported ones. Copyright © 2005 John Wiley & Sons, Ltd.     

A new harmony search algorithm for solving mixed–discrete engineering optimization problems

In general design optimization problems, it is usually assumed that the design variables are continuous. However, many practical problems in engineering design require considering the design variables as integer or discrete values. The presence of discrete and integer variables along with continuous variables adds to the complexity of the optimization problem. Very few of the existing methods can yield a globally optimal solution when the objective functions are non-convex and non-differentiable. This article presents a mixed–discrete harmony search approach for solving these nonlinear optimization problems which contain integer, discrete and continuous variables. Some engineering design examples are also presented to demonstrate the effectiveness of the proposed method.     

Robust topology optimization under multiple independent uncertainties of loading positions

The topology optimization problem of a continuum structure is further investigated under the independent position uncertainties of multiple external loads, which are now described with an interval vector of uncertain-but-bounded variables. In this study, the structural compliance is formulated with the quadratic Taylor series expansion of multiple loading positions. As a result, the objective gradient information to the topological variables can be evaluated efficiently upon an explicit quadratic expression as the loads deviate from their ideal application points. Based on the minimum (largest absolute) value of design sensitivities, which corresponds to the most sensitive compliance to the load position variations, a two-level optimization algorithm within the non-probabilistic approach is developed upon a gradient-based optimization method. The proposed framework is then performed to achieve the robust optimal configurations of four benchmark examples, and the final designs are compared comprehensively with the traditional topology optimizations under the loading point fixation. It will be observed that the present methodology can provide a remarkably different structural layout with the auxiliary components in the design domain to counteract the load position uncertainties. The numerical results also show that the present robust topology optimization can effectively prevent the structural performance from a noticeable deterioration than the deterministic optimization in the presence of load position disturbances.     

Topology optimization of continuum structures with displacement constraints based on meshless method

In this paper, the element free Galerkin method (EFG) is applied to carry out the topology optimization of continuum structures with displacement constraints. In the EFG method, the matrices in the discretized system equations are assembled based on the quadrature points. In the sense, the relative density at Gauss quadrature point is employed as design variable. Considering the minimization of weight as an objective function, the mathematical formulation of the topology optimization subjected to displacement constraints is developed using the solid isotropic microstructures with penalization interpolation scheme. Moreover, the approximate explicit function expression between topological variables and displacement constraints are derived. Sensitivity of the objective function is derived based on the adjoint method. Three numerical examples are used to demonstrate the feasibility and effectiveness of the proposed method.     

Optimization of truss bridges within a specified design domain using evolution strategies

This article reports and investigates the application of evolution strategies (ESs) to optimize the design of truss bridges. This is a challenging optimization problem associated with mixed design variables, since it involves identification of the bridge’s shape and topology configurations in addition to the sizing of the structural members for minimum weight. A solution algorithm to this problem is developed by combining different variable-wise versions of adaptive ESs under a common optimization routine. In this regard, size and shape optimizations are implemented using discrete and continuous ESs, respectively, while topology optimization is achieved through a discrete version coupled with a particular methodology for generating topological variations. In the study, a design domain approach is employed in conjunction with ESs to seek the optimal shape and topology configuration of a bridge in a large and flexible design space. It is shown that the resulting algorithm performs very well and produces improved results for the problems of interest.     

A nodal variable method of structural topology optimization based on Shepard interpolant

A method for topology optimization of continuum structures based on nodal density variables and density field mapping technique is investigated. The original discrete‐valued topology optimization problem is stated as an optimization problem with continuous design variables by introducing a material density field into the design domain. With the use of the Shepard family of interpolants, this density field is mapped onto the design space defined by a finite number of nodal density variables. The employed interpolation scheme has an explicit form and satisfies range‐restricted properties that makes it applicable for physically meaningful density interpolation. Its ability to resolve more complex spatial distribution of the material density within an individual element, as compared with the conventional elementwise design variable approach, actually provides certain regularization to the topology optimization problem. Numerical examples demonstrate the validity and applicability of the proposed formulation and numerical techniques. Copyright © 2011 John Wiley & Sons, Ltd.     

Topology optimization of acoustic–structure interaction problems using a mixed finite element formulation

The paper presents a gradient‐based topology optimization formulation that allows to solve acoustic–structure (vibro‐acoustic) interaction problems without explicit boundary interface representation. In acoustic–structure interaction problems, the pressure and displacement fields are governed by Helmholtz equation and the elasticity equation, respectively. Normally, the two separate fields are coupled by surface‐coupling integrals, however, such a formulation does not allow for free material re‐distribution in connection with topology optimization schemes since the boundaries are not explicitly given during the optimization process. In this paper we circumvent the explicit boundary representation by using a mixed finite element formulation with displacements and pressure as primary variables (a u /p‐formulation). The Helmholtz equation is obtained as a special case of the mixed formulation for the elastic shear modulus equating to zero. Hence, by spatial variation of the mass density, shear and bulk moduli we are able to solve the coupled problem by the mixed formulation. Using this modelling approach, the topology optimization procedure is simply implemented as a standard density approach. Several two‐dimensional acoustic–structure problems are optimized in order to verify the proposed method. Copyright © 2006 John Wiley & Sons, Ltd.     

A mixed integer programming for robust truss topology optimization with stress constraints

This paper presents a mixed integer programming (MIP) formulation for robust topology optimization of trusses subjected to the stress constraints under the uncertain load. A design‐dependent uncertainty model of the external load is proposed for dealing with the variation of truss topology in the course of optimization. For a truss with the discrete member cross‐sectional areas, it is shown that the robust topology optimization problem can be reduced to an MIP problem, which is solved globally. Numerical examples illustrate that the robust optimal topology of a truss depends on the magnitude of uncertainty. Copyright © 2010 John Wiley & Sons, Ltd.     

Voigt–Reuss topology optimization for structures with linear elastic material behaviours

The desired results of variable topology material layout computations are stable and discrete material distributions that optimize the performance of structural systems. To achieve such material layout designs a continuous topology design framework based on hybrid combinations of classical Reuss (compliant) and Voigt (stiff) mixing rules is investigated. To avoid checkerboarding instabilities, the continuous topology optimization formulation is coupled with a novel spatial filtering procedure. The issue of obtaining globally optimal discrete layout designs with the proposed formulation is investigated using a continuation method which gradually transitions from the stiff Voigt formulation to the compliant Reuss formulation. The very good performance of the proposed methods is demonstrated on four structural topology design optimization problems from the literature. © 1997 John Wiley & sons, Ltd.     

Topology optimization of multi-material for the heat conduction problem based on the level set method

This article presents a numerical approach of topology optimization with multiple materials for the heat conduction problem. The multiphase level set model is used to implicitly describe the geometric boundaries of material regions with different conductivities. The model of multi-material representation has no emergence of the intermediate density. The optimization objective is to construct the optimal heat conductive paths which improve the efficiency of heat transfer. The dissipation of thermal transport potential capacity is taken as the objective function. The sensitivity analysis is implemented by the adjoint variable method, which is the foundation of constructing the velocity field of the level set equation. The optimal result is gradually realized by the evolution of multi-material boundaries, and the topological changes are naturally handled during the optimization process. Finally, the numerical examples are presented to demonstrate the feasibility and validity of the proposed method for topology optimization of the heat conduction problem.     

Robust topology optimization under load position uncertainty

The topology optimization problem of a continuum structure on the compliance minimization objective is investigated under consideration of the external load uncertainty in its application position with a nonprobabilistic approach. The load position is defined as the uncertain-but-bounded parameter and is represented by an interval variable with a nominal application point. The structural compliance due to the load position deviation is formulated with the quadratic Taylor series expansion. As a result, the objective gradient information to the topological variables can be evaluated efficiently in a quadratic expression. Based on the maximum design sensitivity value, which corresponds to the most sensitive compliance to the uncertain loading position, a single-level optimization approach is suggested by using a popular gradient-based optimality criteria method. The proposed optimization scheme is performed to gain the robust topology optimizations of three benchmark examples, and the final configuration designs are compared comprehensively with the conventional topology optimizations under the loading point fixation. It can be observed that the present method can provide remarkably different material layouts with auxiliary components to accommodate the load position disturbances. The numerical results of the representative examples also show that the structural performances of the robust topology optimizations appear less sensitive to the load position perturbations than the traditional designs.     

Robust compliance topology optimization based on the topological derivative concept

In this paper, we present an approach for robust compliance topology optimization under volume constraint. The compliance is evaluated considering a point‐wise worst‐case scenario. Analogously to sequential optimization and reliability assessment, the resulting robust optimization problem can be decoupled into a deterministic topology optimization step and a reliability analysis step. This procedure allows us to use topology optimization algorithms already developed with only small modifications. Here, the deterministic topology optimization problem is addressed with an efficient algorithm based on the topological derivative concept and a level‐set domain representation method. The reliability analysis step is handled as in the performance measure approach. Several numerical examples are presented showing the effectiveness of the proposed approach. Copyright © 2015 John Wiley & Sons, Ltd.     

A Benders-based heuristic for the robust capacitated international sourcing problem

A common assumption when solving optimization problems is that all parameters are certain; however, in the real world, key data are often uncertain. In this paper, we introduce a formulation of the robust capacitated international sourcing problem. The main contribution of this work is that the formulation assumes a finite capacity, as opposed to the infinite-capacity assumption made in related studies. The formulation also deals with the uncertainty of relevant parameters, such as demand and exchange rates, and uses an objective function that incorporates a measure of risk. A heuristic search method based on Benders decomposition and tabu search is proposed and tested. The computational experiments showed that this method yields acceptable results.     

An exact penalty function method for optimising QAP formulation in facility layout problem

A quadratic assignment problem (QAP), which is a combinatorial optimisation problem, is developed to model the problem of locating facilities with material flows between them. The aim of solving the QAP formulation for a facility layout problem (FLP) is to increase a system’s operating efficiency by reducing material handling costs, which can be measured by interdepartmental distances and flows. The QAP-formulated FLP can be viewed as a discrete optimisation problem, where the quadratic objective function is optimised with respect to discrete decision variables subject to linear equality constraints. The conventional approach for solving this discrete optimisation problem is to use the linearisation of the quadratic objective function whereby additional discrete variables and constraints are introduced. The adoption of the linearisation process can result in a significantly increased number of variables and constraints; solving the resulting problem can therefore be challenging. In this paper, a new approach is introduced to solve this discrete optimisation problem. First, the discrete optimisation problem is transformed into an equivalent nonlinear optimisation problem involving only continuous decision variables by introducing quadratic inequality constraints. The number of variables, however, remains the same as the original problem. Then, an exact penalty function method is applied to convert this transformed continuous optimisation problem into an unconstrained continuous optimisation problem. An improved backtracking search algorithm is then developed to solve the unconstrained optimisation problem. Numerical computation results demonstrate the effectiveness of the proposed new approach.