Simulation-Based Optimization Using Computational Intelligence

In many practical engineering design problems, the form of objective functions is not given explicitly in terms of design variables. Given the value of design variables, under this circumstance, the value of objective functions is obtained by some analysis such as structural analysis, fluidmechanic analysis, thermodynamic analysis, and so on. Usually, these analyses are considerably time consuming to obtain a value of objective functions. In order to make the number of analyses as few as possible, we suggest a method by which optimization is performed in parallel with predicting the form of objective functions. In this paper, radial basis function networks (RBFN) are employed in predicting the form of objective functions, and genetic algorithms (GA) are adopted in searching the optimal value of the predicted objective function. The effectiveness of the suggested method will be shown through some numerical examples.     

ADAPTIVE RESPONSE SURFACE METHOD - A GLOBAL OPTIMIZATION SCHEME FOR APPROXIMATION-BASED DESIGN PROBLEMS

For design problems involving computation-intensive analysis or simulation processes, approximation models are usually introduced to reduce computation lime. Most approximation-based optimization methods make step-by-step improvements to the approximation model by adjusting the limits of the design variables. In this work, a new approximation-based optimization method for computation-intensive design problems - the adaptive response surface method(ARSM), is presented. The ARSM creates quadratic approximation models for the computation-intensive design objective function in a gradually reduced design space. The ARSM was designed to avoid being trapped by local optima and to identify the global design optimum with a modest number of objective function evaluations. Extensive tests on the ARSM as a global optimization scheme using benchmark problems, as well as an industrial design application of the method, are presented. Advantages and limitations of the approach are also discussed     

The Design Space Root Finding method for efficient risk optimization by simulation

Reliability-Based Design Optimization (RBDO) is computationally expensive due to the nested optimization and reliability loops. Several shortcuts have been proposed in the literature to solve RBDO problems. However, these shortcuts only apply when failure probability is a design constraint. When failure probabilities are incorporated in the objective function, such as in total life-cycle cost or risk optimization, no shortcuts were available to this date, to the best of the authors knowledge. In this paper, a novel method is proposed for the solution of risk optimization problems. Risk optimization allows one to address the apparently conflicting goals of safety and economy in structural design. In the conventional solution of risk optimization by Monte Carlo simulation, information concerning limit state function behavior over the design space is usually disregarded. The method proposed herein consists in finding the roots of the limit state function in the design space, for all Monte Carlo samples of random variables. The proposed method is compared to the usual method in application to one and n-dimensional optimization problems, considering various degrees of limit state and cost function nonlinearities. Results show that the proposed method is almost twenty times more efficient than the usual method, when applied to one-dimensional problems. Efficiency is reduced for higher dimensional problems, but the proposed method is still at least two times more efficient than the usual method for twenty design variables. As the efficiency of the proposed method for higher-dimensional problems is directly related to derivative evaluations, further investigation is necessary to improve its efficiency in application to multi-dimensional problems.     

An uncertain multidisciplinary design optimization method using interval convex models

This article proposes an uncertain multi-objective multidisciplinary design optimization methodology, which employs the interval model to represent the uncertainties of uncertain-but-bounded parameters. The interval number programming method is applied to transform each uncertain objective function into two deterministic objective functions, and a satisfaction degree of intervals is used to convert both the uncertain inequality and equality constraints to deterministic inequality constraints. In doing so, an unconstrained deterministic optimization problem will be constructed in association with the penalty function method. The design will be finally formulated as a nested three-loop optimization, a class of highly challenging problems in the area of engineering design optimization. An advanced hierarchical optimization scheme is developed to solve the proposed optimization problem based on the multidisciplinary feasible strategy, which is a well-studied method able to reduce the dimensions of multidisciplinary design optimization problems by using the design variables as independent optimization variables. In the hierarchical optimization system, the non-dominated sorting genetic algorithm II, sequential quadratic programming method and Gauss–Seidel iterative approach are applied to the outer, middle and inner loops of the optimization problem, respectively. Typical numerical examples are used to demonstrate the effectiveness of the proposed methodology.     

Optimal design and optimal control of structures undergoing finite rotations and elastic deformations

In this work, we deal with the optimal design and optimal control of structures undergoing large rotations and large elastic deformations. In other words, we show how to find the corresponding initial configuration through optimal design or the corresponding set of multiple load parameters through optimal control, in order to recover a desired deformed configuration or some desirable features of the deformed configuration as specified more precisely by the objective or cost function. The model problem chosen to illustrate the proposed optimal design and optimal control methodologies is the one of geometrically exact beam. First, we present a non‐standard formulation of the optimal design and optimal control problems, relying on the method of Lagrange multipliers in order to make the mechanics state variables independent from either design or control variables and thus provide the most general basis for developing the best possible solution procedure. Two different solution procedures are then explored, one based on the diffuse approximation of response function and gradient method and the other one based on genetic algorithm. A number of numerical examples are given in order to illustrate both the advantages and potential drawbacks of each of the presented procedures. Copyright © 2004 John Wiley & Sons, Ltd.     

An optimization design of vehicle axle system based on multiobjective cooperative optimization algorithm

ABSTRACT

To address multiobjective, multi constraint and time-consuming structural optimization problems in a vehicle axle system, a multiobjective cooperative optimization model of a vehicle axle structure is established. In light of the difficulty in the nondominated sorting of the NSGA-II algorithm caused by inconsistent effects of the uniformity objective function and physical objective function, this paper combines a multiobjective genetic algorithm with cooperative optimization and presents a strategy for handling the optimization of a vehicle axle structure. The uniformity objective function of the sub discipline is transformed to its self-constraint. Taking the multiobjective optimization of a vehicle axle system as an example, a multiobjective cooperative optimization design for the system is carried out in ISIGHT. The results show that the multiobjective cooperative optimization strategy can simplify the complexity of optimization problems and that the multiobjective cooperative optimization method based on an approximate model is favorable for accuracy and efficiency, thereby providing a theoretical basis for the optimization of similar complex structures in practical engineering.     

Global Optimization of Costly Nonconvex Functions Using Radial Basis Functions

The paper considers global optimization of costly objective functions, i.e. the problem of finding the global minimum when there are several local minima and each function value takes considerable CPU time to compute. Such problems often arise in industrial and financial applications, where a function value could be a result of a time-consuming computer simulation or optimization. Derivatives are most often hard to obtain, and the algorithms presented make no use of such information.Several algorithms to handle the global optimization problem are described, but the emphasis is on a new method by Gutmann and Powell, A radial basis function method for global optimization. This method is a response surface method, similar to the Efficient Global Optimization (EGO) method of Jones. Our Matlab implementation of the Radial Basis Function (RBF) method is described in detail and we analyze its efficiency on the standard test problem set of Dixon-Szegö, as well as its applicability on a real life industrial problem from train design optimization. The results show that our implementation of the RBF algorithm is very efficient on the standard test problems compared to other known solvers, but even more interesting, it performs extremely well on the train design optimization problem.     

AN OPTIMIZATION METHOD FOR THE DESIGN OF LARGE,HIGHLY CONSTRAINED COMPLEX SYSTEMS

A practical and efficient optimization method for the rational design of large, highly constrained complex systems is presented. The design of such systems is iterative and requires the repeated formulation and solution of an analysis model, followed by the formulation and solution of a redesign model. The latter constitutes an optimization problem. The versatility and efficiency of the method for solving the optimization problem is of fundamental importance for a successful implementation of any rational design procedure.

In this paper, a method is presented for solving optimization problems formulated in terms of continuous design variables. The objective function may be linear or non-linear, single or multiple. The constraints may be any mix of linear or non-linear functions, and these may be any mix of inequalities and equalities. These features permit the solution of a wide spectrum of optimization problems, ranging from the standard linear and non-linear problems to a non-linear problem with multiple objective functions (goal programming). The algorithm for implementing the method is presented in sufficient detail so that a computer program, in any computing language, can be written.     

A mixed-integer simulation-based optimization approach with surrogate functions in water resources management

Efficient and powerful methods are needed to overcome the inherent difficulties in the numerical solution of many simulation-based engineering design problems. Typically, expensive simulation codes are included as black-box function generators; therefore, gradient information that is required by mathematical optimization methods is entirely unavailable. Furthermore, the simulation code may contain iterative or heuristic methods, low-order approximations of tabular data, or other numerical methods which contribute noise to the objective function. This further rules out the application of Newton-type or other gradient-based methods that use traditional finite difference approximations. In addition, if the optimization formulation includes integer variables the complexity grows even further. In this paper we consider three different modeling approaches for a mixed-integer nonlinear optimization problem taken from a set of water resources benchmarking problems. Within this context, we compare the performance of a genetic algorithm, the implicit filtering algorithm, and a branch-and-bound approach that uses sequential surrogate functions. We show that the surrogate approach can greatly improve computational efficiency while locating a comparable, sometimes better, design point than the other approaches.     

Practical solutions for multi-objective optimization: An application to system reliability design problems

For multiple-objective optimization problems, a common solution methodology is to determine a Pareto optimal set. Unfortunately, these sets are often large and can become difficult to comprehend and consider. Two methods are presented as practical approaches to reduce the size of the Pareto optimal set for multiple-objective system reliability design problems. The first method is a pseudo-ranking scheme that helps the decision maker select solutions that reflect his/her objective function priorities. In the second approach, we used data mining clustering techniques to group the data by using the k-means algorithm to find clusters of similar solutions. This provides the decision maker with just k general solutions to choose from. With this second method, from the clustered Pareto optimal set, we attempted to find solutions which are likely to be more relevant to the decision maker. These are solutions where a small improvement in one objective would lead to a large deterioration in at least one other objective. To demonstrate how these methods work, the well-known redundancy allocation problem was solved as a multiple objective problem by using the NSGA genetic algorithm to initially find the Pareto optimal solutions, and then, the two proposed methods are applied to prune the Pareto set.     

Shape optimization using time evolution equations

In this study, we deal with a numerical solution based on time evolution equations to solve the optimization problem for finding the shape that minimizes the objective function under given constraints. The design variables of the shape optimization problem are defined on a given original domain on which the boundary value problems of partial differential equations are defined. The variations of the domain are obtained by the time integration of the solution to derive the time evolution equations defined in the original domain. The shape gradient with respect to the domain variations are given as the Neumann boundary condition defined on the original domain boundary. When the constraints are satisfied, the decreasing property of the objective function is guaranteed by the proposed method. Furthermore, the proposed method is used to minimize the heat resistance under a total volume constraint and to solve the minimization problem of mean compliance under a total volume constraint.     

Swarm algorithms for single- and multi-objective optimization problems incorporating sensitivity analysis

Swarm algorithms such as particle swarm optimization (PSO) are non-gradient probabilistic optimization algorithms that have been successfully applied for global searches in complex problems such as multi-peak problems. However, application of these algorithms to structural and mechanical optimization problems still remains a complex matter since local optimization capability is still inferior to general numerical optimization methods. This article discusses new swarm metaphors that incorporate design sensitivities concerning objective and constraint functions and are applicable to structural and mechanical design optimization problems. Single- and multi-objective optimization techniques using swarm algorithms are combined with a gradient-based method. In the proposed techniques, swarm optimization algorithms and a sequential linear programming (SLP) method are conducted simultaneously. Finally, truss structure design optimization problems are solved by the proposed hybrid method to verify the optimization efficiency.     

Novel orthogonal simulated annealing with fractional factorial analysis to solve global optimization problems

A classical simulated annealing (SA) method is a generic probabilistic and heuristic approach to solving global optimization problems. It uses a stochastic process based on probability, rather than a deterministic procedure, to seek the minima or maxima in the solution space. Although the classical SA method can find the optimal solution to most linear and nonlinear optimization problems, the algorithm always requires numerous numerical iterations to yield a good solution. The method also usually fails to achieve optimal solutions to large parameter optimization problems. This study incorporates well-known fractional factorial analysis, which involves several factorial experiments based on orthogonal tables to extract intelligently the best combination of factors, with the classical SA to enhance the numerical convergence and optimal solution. The novel combination of the classical SA and fractional factorial analysis is termed the orthogonal SA herein. This study also introduces a dynamic penalty function to handle constrained optimization problems. The performance of the proposed orthogonal SA method is evaluated by computing several representative global optimization problems such as multi-modal functions, noise-corrupted data fitting, nonlinear dynamic control, and large parameter optimization problems. The numerical results show that the proposed orthogonal SA method markedly outperforms the classical SA in solving global optimization problems with linear or nonlinear objective functions. Additionally, this study addressed two widely used nonlinear functions, proposed by Keane and Himmelblau to examine the effectiveness of the orthogonal SA method and the presented penalty function when applied to the constrained problems. Moreover, the orthogonal SA method is applied to two engineering optimization design problems, including the designs of a welded beam and a coil compression spring, to evaluate the capacity of the method for practical engineering design. The computational results show that the proposed orthogonal SA method is effective in determining the optimal design variables and the value of objective function.     

Using Krylov‐Padé model order reduction for accelerating design optimization of structures and vibrations in the frequency domain

In many engineering problems, the behavior of dynamical systems depends on physical parameters. In design optimization, these parameters are determined so that an objective function is minimized. For applications in vibrations and structures, the objective function depends on the frequency response function over a given frequency range, and we optimize it in the parameter space. Because of the large size of the system, numerical optimization is expensive. In this paper, we propose the combination of Quasi‐Newton type line search optimization methods and Krylov‐Padé type algebraic model order reduction techniques to speed up numerical optimization of dynamical systems. We prove that Krylov‐Padé type model order reduction allows for fast evaluation of the objective function and its gradient, thanks to the moment matching property for both the objective function and the derivatives towards the parameters. We show that reduced models for the frequency alone lead to significant speed ups. In addition, we show that reduced models valid for both the frequency range and a line in the parameter space can further reduce the optimization time. Copyright © 2012 John Wiley & Sons, Ltd.     

APPROXIMATE DISCRETE VARIABLE OPTIMIZATION OF FRAME STRUCTURES WITH DUAL METHODS

The purpose of this work is to present an efficient method for optimum design of frame structures, using approximation concepts. A dual strategy in which the design variables can be considered as discrete variables is used. A two-level approximation concept is used. In the first level, all the structural response quantities such as forces and displacements are approximated as functions of some intermediate variables. Then the second level approximation is employed to convert the first-level approximation problem into a series of problems of separable forms, which can be solved easily by dual methods with discrete variables. In the second-level approximation, the objective function and the approximate constraints are linearized. The objective of the first-level approximation is to reduce the number of structural analyses required in the optimization problem and the second level approximation reduces the computational cost of the optimization technique. A portal frame and a single layer grid are used as design examples to demonstrate the efficiency of the proposed method.     

An improved weighting method with multibounds formulation and convex programming for multicriteria structural optimization

This paper presents an improved weighting method for multicriteria structural optimization. By introducing artificial design variables, here called as multibounds formulation (MBF), we demonstrate mathematically that the weighting combination of criteria can be transformed into a simplified problem with a linear objective function. This is a unified formulation for one criterion and multicriteria problems. Due to the uncoupling of involved criteria after the transformation, the extension and the adaptation of monotonic approximation‐based convex programming methods such as the convex linearization (CONLIN) or the method of moving asymptotes (MMA) are made possible to solve multicriteria problems as efficiently as for one criterion problems. In this work, a multicriteria optimization tool is developed by integrating the multibounds formulation with the CONLIN optimizer and the ABAQUS finite element analysis system. Some numerical examples are taken into account to show the efficiency of this approach. Copyright © 2001 John Wiley & Sons, Ltd.     

Multicriteria fuzzy optimization of structural systems

This paper proposes an efficient, systematic and generalized multicriteria fuzzy optimum design method for the structural systems, using the suboptimization concept, introduction of measure membership functions and fuzzy decision‐making techniques. Each objective function is suboptimized first for all discrete sets of common design variables and design parameters. In order to make the relative evaluation of suboptimized data of objective functions rationally and systematically, and involve the fuzziness or tolerance in the decision‐making process and design emphases, the measure membership functions are introduced for all objective functions. The membership functions of the suboptimized objective functions are determined systematically using the corresponding measure membership functions as datum. A hybrid decision‐making process is developed combining the weighted operator method, comparison processes of maximum membership values and backward interpolation processes for the determination of the global optimum solution. The weighted operator method can also involve the relative emphases of each objective function simply. A design example of a practical prestressed concrete bridge system, in which the total expected cost after an earthquake and the aesthetics of the bridge system are the primary objectives, clarifies the applicability to any convex and non‐convex design problems, rationality, systematic design process and efficiency of the proposed design method. Copyright © 1999 John Wiley & Sons, Ltd.     

Sensitivity analysis of viscoplastic deformation process with application to metal preform design optimization

The sensitivity analysis of rigid viscoplastic deformation processes with application to metal preform design optimization is investigated. For viscoplastic constitutive models, the deformation process is path-dependent in nature and thus the sensitivity analysis of the deformation history is formulated in an incremental procedure. To this end, an algorithm is derived on the basis of the time integration scheme used in the primary finite element analysis, where the contact conditions are treated with the penalty method. The discretized equilibrium equations, as well as the time integration equations, are directly differentiated with respect to the design variables. The discrete form of the sensitivity equations is then solved with procedures similar to those used in the direct analysis, where the secant matrix decomposed in the direct analysis can also be utilized at each time instant. Thus the sensitivity of the deformation history is evaluated in a step-wise procedure. The present algorithm can be employed for the optimization of metal forming processes. The accuracy of the proposed sensitivity analysis as well as its applicability are demonstrated by numerical examples with reference to preform design optimization problems, where the aggregate function method is employed for converting the non-smooth Min–max type objective function into a numerically tractable one.     

Constrained optimization using a multipoint type chaotic Lagrangian method with a coupling structure

This article proposes a new constrained optimization method using a multipoint type chaotic Lagrangian method that utilizes chaotic search trajectories generated by Lagrangian gradient dynamics with a coupling structure. In the proposed method, multiple search points autonomously implement global search using the chaotic search trajectory generated by the coupled Lagrangian gradient dynamics. These points are advected to elite points (which are chosen by considering their objective function values and their feasibility) by the coupling in order to explore promising regions intensively. In this way, the proposed method successfully provides diversification and intensification for constrained optimization problems. The effectiveness of the proposed method is confirmed through application to various types of benchmark problem, including the coil spring design problem, the benchmark problems used in the special session on constrained real parameter optimization in CEC2006, and a high-dimensional and multi-peaked constrained optimization problem.     

基于粒子群算法多目标优化液压支架四连杆

针对煤矿液压支架四连杆受力计算较为复杂,简化计算时易出现较大误差且稳定性较差的问题,提出从四连杆机构的空间受力出发并结合支架的运动轨迹,采用粒子群优化算法对四连杆机构展开优化研究。首先建立了四连杆优化模型,在优化模型中选取对结果影响较大的参数作为优化变量,以轨迹偏差、连杆长、连杆力之和作为目标函数,根据液压支架设计规范确定约束条件。然后使用粒子群算法对目标函数进行迭代求解并在求解过程中采用惩罚函数法解决优化模型中不等式约束问题。对比优化前后连杆的杆长、受力和稳定性数据,发现优化后的四连杆实现了轻量化,且受力较小,稳定性提高。研究结果对四连杆的设计有实际参考价值。