Multi-objective hierarchical genetic algorithms for multilevel redundancy allocation optimization

Multilevel redundancy allocation optimization problems (MRAOPs) occur frequently when attempting to maximize the system reliability of a hierarchical system, and almost all complex engineering systems are hierarchical. Despite their practical significance, limited research has been done concerning the solving of simple MRAOPs. These problems are not only NP hard but also involve hierarchical design variables. Genetic algorithms (GAs) have been applied in solving MRAOPs, since they are computationally efficient in solving such problems, unlike exact methods, but their applications has been confined to single-objective formulation of MRAOPs. This paper proposes a multi-objective formulation of MRAOPs and a methodology for solving such problems. In this methodology, a hierarchical GA framework for multi-objective optimization is proposed by introducing hierarchical genotype encoding for design variables. In addition, we implement the proposed approach by integrating the hierarchical genotype encoding scheme with two popular multi-objective genetic algorithms (MOGAs)—the strength Pareto evolutionary genetic algorithm (SPEA2) and the non-dominated sorting genetic algorithm (NSGA-II). In the provided numerical examples, the proposed multi-objective hierarchical approach is applied to solve two hierarchical MRAOPs, a 4- and a 3-level problems. The proposed method is compared with a single-objective optimization method that uses a hierarchical genetic algorithm (HGA), also applied to solve the 3- and 4-level problems. The results show that a multi-objective hierarchical GA (MOHGA) that includes elitism and mechanism for diversity preserving performed better than a single-objective GA that only uses elitism, when solving large-scale MRAOPs. Additionally, the experimental results show that the proposed method with NSGA-II outperformed the proposed method with SPEA2 in finding useful Pareto optimal solution sets.     

A hybrid cellular automaton–bi-directional evolutionary optimization algorithm for topological optimization of crashworthiness

This article proposes a new algorithm for topological optimization under dynamic loading which combines cellular automata with bi-directional evolutionary structural optimization (BESO). The local rules of cellular automata are used to update the design variables, which avoids the difficulty of obtaining gradient information under nonlinear collision conditions. The intermediate-density design problem of hybrid cellular automata is solved using the BESO concept of 0–1 binary discrete variables. Some improvement strategies are also proposed for the hybrid algorithm to solve certain problems in nonlinear topological optimization, e.g. numerical oscillation. Some typical examples of crashworthiness problems are provided to illustrate the efficiency of the proposed method and its ability to find the final optimal solution. Finally, numerical results obtained using the proposed algorithms are compared with reference examples taken from the literature. The results show that the hybrid method is computationally efficient and stable.     

基于演化算法的带频率约束的桁架结构形状和尺寸优化

具有频率约束的桁架结构形状和尺寸优化设计是一个难度大的非线性动力优化问题。形状和尺寸变量的耦合通常导致收敛困难,而频率约束则使得动力灵敏度分析困难,传统的优化准则法和数学规划法难于求解。将单纯形算法、子空间变维技术、均匀变异有机融入郭涛算法,提出一种混合演化算法,避开繁琐的动力灵敏度分析,简单、有效地求解这类桁架形状和尺寸优化问题。典型的桁架算例验证了算法的有效性和可靠性。     

Multiscale multiresolution genetic algorithm with a golden sectioned population composition

A new genetic algorithm (GA) strategy called the multiscale multiresolution GA is proposed for expediting solution convergence by orders of magnitude. The motivation for this development was to apply GAs to a certain class of large optimization problems, which are otherwise nearly impossible to solve. For the algorithm, standard binary design variables are binary wavelet transformed to multiscale design variables. By working with the multiscale variables, evolution can proceed in multiresolution; converged solutions at a low resolution are reused as a part of individuals of the initial population for the next resolution evolution. It is shown that the best solution convergence can be achieved if three initial population groups having different fitness levels are mixed at the golden section ratio. An analogy between cell division and the proposed multiscale multiresolution strategy is made. The specific applications of the developed method are made in topology optimization problems. Copyright © 2007 John Wiley & Sons, Ltd.     

Multi-objective optimization of engineering systems using game theory and particle swarm optimization

This study proposes particle swarm optimization (PSO) based algorithms to solve multi-objective engineering optimization problems involving continuous, discrete and/or mixed design variables. The original PSO algorithm is modified to include dynamic maximum velocity function and bounce method to enhance the computational efficiency and solution accuracy. The algorithm uses a closest discrete approach (CDA) to solve optimization problems with discrete design variables. A modified game theory (MGT) approach, coupled with the modified PSO, is used to solve multi-objective optimization problems. A dynamic penalty function is used to handle constraints in the optimization problem. The methodologies proposed are illustrated by several engineering applications and the results obtained are compared with those reported in the literature.     

An effective simultaneous approach with variable time nodes for dynamic optimization problems

An effective simultaneous approach with variable time nodes is proposed to solve the dynamic optimization problems with multiple control components, where the variable time nodes for each control component are considered as parameters directly and the interval between the neighbouring variable nodes is further refined uniformly to ensure accuracy. Consequently, the method does not treat all the nodes as parameters to ensure efficiency. The gradient formulae and the sensitivities of the states with respect to the controls and the variable time nodes are further derived to solve the nonlinear programming problem transformed from the original dynamic optimization problem. The complete framework and detailed steps of the proposed method are also given. Two classic constrained dynamic optimization problems have been tested as an illustration, and detailed comparisons of the reported literature methods are carried out. The research results show the characteristics and the effectiveness of the proposed approach.     

An engineering method for complex structural optimization involving both size and topology design variables

This work presents an engineering method for optimizing structures made of bars, beams, plates, or a combination of those components. Corresponding problems involve both continuous (size) and discrete (topology) variables. Using a branched multipoint approximate function, which involves such mixed variables, a series of sequential approximate problems are constructed to make the primal problem explicit. To solve the approximate problems, genetic algorithm (GA) is utilized to optimize discrete variables, and when calculating individual fitness values in GA, a second-level approximate problem only involving retained continuous variables is built to optimize continuous variables. The solution to the second-level approximate problem can be easily obtained with dual methods. Structural analyses are only needed before improving the branched approximate functions in the iteration cycles. The method aims at optimal design of discrete structures consisting of bars, beams, plates, or other components. Numerical examples are given to illustrate its effectiveness, including frame topology optimization, layout optimization of stiffeners modeled with beams or shells, concurrent layout optimization of beam and shell components, and an application in a microsatellite structure. Optimization results show that the number of structural analyses is dramatically decreased when compared with pure GA while even comparable to pure sizing optimization.     

A hybrid evolutionary algorithm for distribution feeder reconfiguration

Distribution feeder reconfiguration (DFR) is formulated as a multi-objective optimization problem which minimizes real power losses, deviation of the node voltages and the number of switching operations and also balances the loads on the feeders. In the proposed method, the distance (λ ₂ norm) between the vector-valued objective function and the worst-case vector-valued objective function in the feasible set is maximized. In the algorithm, the status of tie and sectionalizing switches are considered as the control variables. The proposed DFR problem is a non-differentiable optimization problem. Therefore, a new hybrid evolutionary algorithm based on combination of fuzzy adaptive particle swarm optimization (FAPSO) and ant colony optimization (ACO), called HFAPSO, is proposed to solve it. The performance of HFAPSO is evaluated and compared with other methods such as genetic algorithm (GA), ACO, the original PSO, Hybrid PSO and ACO (HPSO) considering different distribution test systems.     

The harmony search heuristic algorithm for discrete structural optimization

Many methods have been developed and are in use for structural size optimization problems, in which the cross-sectional areas or sizing variables are usually assumed to be continuous. In most practical structural engineering design problems, however, the design variables are discrete. This paper proposes an efficient optimization method for structures with discrete-sized variables based on the harmony search (HS) heuristic algorithm. The recently developed HS algorithm was conceptualized using the musical process of searching for a perfect state of harmony. It uses a stochastic random search instead of a gradient search so that derivative information is unnecessary. In this article, a discrete search strategy using the HS algorithm is presented in detail and its effectiveness and robustness, as compared to current discrete optimization methods, are demonstrated through several standard truss examples. The numerical results reveal that the proposed method is a powerful search and design optimization tool for structures with discrete-sized members, and may yield better solutions than those obtained using current methods.     

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

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

A surrogate assisted evolutionary optimization method with application to the transonic airfoil design

A multi-layer perceptron neural network (NN) method is used for efficient estimation of the expensive objective functions in the evolutionary optimization with the genetic algorithm (GA). The estimation capability of the NN is improved by dynamic retraining using the data from successive generations. In addition, the normal distribution of the training data variables is used to determine well-trained parts of the design space for the NN approximation. The efficiency of the method is demonstrated by two transonic airfoil design problems considering inviscid and viscous flow solvers. Results are compared with those of the simple GA and an alternative surrogate method. The total number of flow solver calls is reduced by about 40% using this fitness approximation technique, which in turn reduces the total computational time without influencing the convergence rate of the optimization algorithm. The accuracy of the NN estimation is considerably improved using the normal distribution approach compared with the alternative method.     

An optimization technique using the characteristics of genetic algorithm

Optimization problems could happen often in discrete or discontinuous search space. Therefore, the traditional gradient‐based methods are not able to apply to this kind of problems. The discrete design variables are considered reasonably and the heuristic techniques are generally adopted to solve this problem, and the genetic algorithm based on stochastic search technique is one of these. The genetic algorithm method with discrete variables can be applied to structural optimization problems, such as composite laminated structures or trusses. However, the discrete optimization adopted in genetic algorithm gives rise to a troublesome task that is a mapping between each strings and discrete variables. And also, its solution quality could be restricted in some cases. In this study, a technique using the genetic algorithm characteristics is developed to utilize continuous design variables instead of discrete design variables in discontinuous solution spaces. Additionally, the proposed algorithm, which is manipulating a fitness function artificially, is applied to example problems and its results are compared with the general discrete genetic algorithm. The example problems are to optimize support positions of an unstable structure with discontinuous solution spaces.     

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.     

An evolutionary optimization-based approach for simulation of endurance time load functions

A novel optimization method based on Imperialist Competitive Algorithm (ICA) for simulating endurance time (ET) excitations was proposed. The ET excitations are monotonically intensifying acceleration time histories that are used as dynamic loading. Simulation of ET excitations by using evolutionary algorithms has been challenging due to the presence of a large number of decision variables that are highly correlated due to the dynamic nature of the problem. Optimal parameter values of the ICA algorithm for simulating ETEFs were evaluated and were used to simulate ET excitations. In order to increase the capability of the ICA and provide further search in the optimization space, this algorithm was combined with simulated annealing (SA). The new excitation results were compared with the current practice for simulation of ET excitations. It was shown that the proposed ICA-SA method leads to more accurate ET excitations than the classical optimization methods.     

Guided particle swarm optimization method to solve general nonlinear optimization problems

The development of hybrid algorithms is becoming an important topic in the global optimization research area. This article proposes a new technique in hybridizing the particle swarm optimization (PSO) algorithm and the Nelder–Mead (NM) simplex search algorithm to solve general nonlinear unconstrained optimization problems. Unlike traditional hybrid methods, the proposed method hybridizes the NM algorithm inside the PSO to improve the velocities and positions of the particles iteratively. The new hybridization considers the PSO algorithm and NM algorithm as one heuristic, not in a sequential or hierarchical manner. The NM algorithm is applied to improve the initial random solution of the PSO algorithm and iteratively in every step to improve the overall performance of the method. The performance of the proposed method was tested over 20 optimization test functions with varying dimensions. Comprehensive comparisons with other methods in the literature indicate that the proposed solution method is promising and competitive.     

Chemical process dynamic optimization based on the differential evolution algorithm with an adaptive scheduling mutation strategy

To solve chemical process dynamic optimization problems, a differential evolution algorithm integrated with adaptive scheduling mutation strategy (ASDE) is proposed. According to the evolution feedback information, ASDE, with adaptive control parameters, adopts the round-robin scheduling algorithm to adaptively schedule different mutation strategies. By employing an adaptive mutation strategy and control parameters, the real-time optimal control parameters and mutation strategy are obtained to improve the optimization performance. The performance of ASDE is evaluated using a suite of 14 benchmark functions. The results demonstrate that ASDE performs better than four conventional differential evolution (DE) algorithm variants with different mutation strategies, and that the whole performance of ASDE is equivalent to a self-adaptive DE algorithm variant and better than five conventional DE algorithm variants. Furthermore, ASDE was applied to solve a typical dynamic optimization problem of a chemical process. The obtained results indicate that ASDE is a feasible and competitive optimizer for this kind of problem.     

Truss optimization on shape and sizing with frequency constraints based on genetic algorithm

Truss optimization on shape and sizing with frequency constraints are highly nonlinear dynamic optimization problems. Coupling of two different types of design variables, nodal coordinates and cross-sectional areas, often lead to divergence while multiple frequency constraints often cause difficult dynamic sensitivity analysis. So optimal criteria method and mathematical programming, which need complex dynamic sensitivity and are easily trapped into the local optima, are difficult to solve the problems. To solve the truss shape and sizing optimization simply and effectively, a Niche Hybrid Genetic Algorithm (NHGA) is proposed. The objective of NHGA is to enhance the exploitation capacities while preventing the premature convergence simultaneously based on the new hybrid architecture. Niche techniques and adaptive parameter adjustment are used to maintain population diversity for preventing the premature convergence while simplex search is used to enhance the local search capacities of GAs. The proposed algorithm effectively alleviates premature convergence and improves weak exploitation capacities of GAs. Several typical truss optimization examples are employed to demonstrate the validity, availability and reliability of NHGA for solving shape and sizing optimization of trusses with multiple frequency constraints.     

热弹耦合梁结构动力响应的区间数值分析

研究了含有区间参数梁结构在温度载荷和力载荷共同作用下的动力响应问题,考虑材料变形与传热的相互影响,建立了梁在热弹耦合下的动力学有限元模型,并给出了对结构瞬态热传导方程与动力学方程进行相互交替迭代求解的计算方法。针对结构响应不确定性问题,以不确定参数作为约束变量,通过寻求结构响应函数的区间范围,将区间问题转化为优化问题,并利用遗传算法给出了结构响应函数的区间界限。通过算例及与概率有限元方法的计算结果比较,表明文中所提出方法的可行性和有效性,并获得在热弹耦合作用下梁结构的固有振动频率有所增加,而振动响应振幅则逐渐减弱的结论。该方法只需已知不确定参数所在范围的界限,而无需其他统计信息,为解决区间参数热弹耦合梁问题提供了一种途径。     

Redundancy allocation for multi-state systems using physical programming and genetic algorithms

This paper proposes a multi-objective optimization model for redundancy allocation for multi-state series–parallel systems. This model seeks to maximize system performance utility while minimizing system cost and system weight simultaneously. We use physical programming as an effective approach to optimize the system structure within this multi-objective optimization framework. The physical programming approach offers a flexible and effective way to address the conflicting nature of these different objectives. Genetic algorithm (GA) is used to solve the proposed physical programming-based optimization model due to the following three reasons: (1) the design variables, the number of components of each subsystems, are integer variables; (2) the objective functions in the physical programming-based optimization model do not have nice mathematical properties, and thus traditional optimization approaches are not suitable in this case; (3) GA has good global optimization performance. An example is used to illustrate the flexibility and effectiveness of the proposed physical programming approach over the single-objective method and the fuzzy optimization method.     

An efficient approach for reliability-based topology optimization

This article presents an efficient approach for reliability-based topology optimization (RBTO) in which the computational effort involved in solving the RBTO problem is equivalent to that of solving a deterministic topology optimization (DTO) problem. The methodology presented is built upon the bidirectional evolutionary structural optimization (BESO) method used for solving the deterministic optimization problem. The proposed method is suitable for linear elastic problems with independent and normally distributed loads, subjected to deflection and reliability constraints. The linear relationship between the deflection and stiffness matrices along with the principle of superposition are exploited to handle reliability constraints to develop an efficient algorithm for solving RBTO problems. Four example problems with various random variables and single or multiple applied loads are presented to demonstrate the applicability of the proposed approach in solving RBTO problems. The major contribution of this article comes from the improved efficiency of the proposed algorithm when measured in terms of the computational effort involved in the finite element analysis runs required to compute the optimum solution. For the examples presented with a single applied load, it is shown that the CPU time required in computing the optimum solution for the RBTO problem is 15–30% less than the time required to solve the DTO problems. The improved computational efficiency allows for incorporation of reliability considerations in topology optimization without an increase in the computational time needed to solve the DTO problem.