Shape optimization of preform tools in forging of aerofoil using a metamodel-assisted multi-island genetic algorithm

Preform design plays an important role in improving the material flow, mechanical properties and reducing defects for forgings with complex shapes. In this paper, a study on shape optimization of preform tools in forging of an airfoil is carried out based on a multi-island genetic algorithm combined with a metamodel technique. An optimal Latin hypercube sampling technique is employed for sampling with the expected coverage of parameter space. Finite element (FE) simulations of multistep forging processes are implemented to obtain the objective function values for evaluating the forging qualities. For facilitating the optimization process, a radial basis function surrogate model is established to predict the responses of the hot forging process to the variation of the preform tool shape. In consideration of the compromise between different optimal objectives, a set of Pareto-optimal solutions are identified by the suggested genetic algorithm to provide more selections. Finally, according to the proposed fitness function, the best solution of multi-objective optimization on the Pareto front is confirmed and the corresponding preform tool shape proves optimal performances with substantially improved forging qualities via FE validation.     

A bi-objective optimization approach for exclusive bus lane selection and scheduling design

This study proposes a methodology to solve the integrated problems of selection and scheduling of the exclusive bus lane. The selection problem intends to determine which roads (links) should have a lane reserved for buses while the scheduling problem intends to find the time period of the application. It is formulated as a bi-objective optimization model that aims to minimize the total travel time of non-bus traffic and buses simultaneously. The proposed model formulation is solved by the hybrid non-dominated sorting genetic algorithm with Paramics. The results show that the proposed methodology is workable. Sets of Pareto solutions are obtained indicating that a trade-off between buses and non-bus traffic for the improvement of the bus transit system is necessary when the exclusive bus lane is applied. This allows the engineer to choose the best solutions that could balance the performance of both modes in a multimode transport system environment to achieve a sustainable transport system.     

Uncertainty‐based robust aerodynamic optimization of rotor blades

The aerodynamic performance of a compressor is highly sensitive to uncertain working conditions. This paper presents an efficient robust aerodynamic optimization method on the basis of nondeterministic computational fluid dynamic (CFD) simulation and multi‐objective genetic algorithm (MOGA). A nonintrusive polynomial chaos method is used in conjunction with an existing well‐verified CFD module to quantify the uncertainty propagation in the flow field. This method is validated by comparing with a Monte Carlo method through full 3D CFD simulations on an axial compressor (National Aeronautics and Space Administration rotor 37). On the basis of the validation, the nondeterministic CFD is coupled with a surrogate‐based MOGA to search for the Pareto front. A practical engineering application is implemented to the robust aerodynamic optimization of rotor 37 under random outlet static pressure. Two curve angles and two sweep angles at tip and hub are used as design variables. Convergence analysis shows that the surrogate‐based MOGA can obtain the Pareto front properly. Significant improvements of both mean and variance of the efficiency are achieved by the robust optimization. The comparison of the robust optimization results with that of the initial design, and a deterministic optimization demonstrate that the proposed method can be applied to turbomachinery successfully. Copyright © 2012 John Wiley & Sons, Ltd.     

Inverse hydrograph routing optimization model based on the kinematic wave approach

This article presents and validates the inverse flood hydrograph routing optimization model under kinematic wave (KW) approximation in order to produce the upstream (inflow) hydrograph, given the downstream (outflow) hydrograph of a river reach. The cost function involves minimization of the error between the observed outflow hydrograph and the corresponding directly routed outflow hydrograph. Decision variables are the inflow hydrograph ordinates. The KW and genetic algorithm (GA) are coupled, representing the selected methods of direct routing and optimization, respectively. A local search technique is also enforced to achieve better agreement of the routed outflow hydrograph with the observed hydrograph. Computer programs handling the direct flood routing, cost function and local search are linked with the optimization model. The results show that the case study inflow hydrographs obtained by the GA were reconstructed with accuracy. It was also concluded that the coupled KW-GA model framework can perform inverse hydrograph routing with numerical stability.     

A study on evolutionary multi-objective optimization for flow geometry design

In this paper, we investigate three recently proposed multi-objective optimization algorithms with respect to their application to a design-optimization task in fluid dynamics. The usual approach to render optimization problems is to accumulate multiple objectives into one objective by a linear combination and optimize the resulting single-objective problem. This has severe drawbacks such that full information about design alternatives will not become visible. The multi-objective optimization algorithms NSGA-II, SPEA2 and Femo are successfully applied to a demanding shape optimizing problem in fluid dynamics. The algorithm performance will be compared on the basis of the results obtained.     

An effective hybrid cuckoo search and genetic algorithm for constrained engineering design optimization

This article presents an effective hybrid cuckoo search and genetic algorithm (HCSGA) for solving engineering design optimization problems involving problem-specific constraints and mixed variables such as integer, discrete and continuous variables. The proposed algorithm, HCSGA, is first applied to 13 standard benchmark constrained optimization functions and subsequently used to solve three well-known design problems reported in the literature. The numerical results obtained by HCSGA show competitive performance with respect to recent algorithms for constrained design optimization problems.     

An extension of the directed search domain algorithm to bilevel optimization

A method is developed for generating a well-distributed Pareto set for the upper level in bilevel multiobjective optimization. The approach is based on the Directed Search Domain (DSD) algorithm, which is a classical approach for generation of a quasi-evenly distributed Pareto set in multiobjective optimization. The approach contains a double-layer optimizer designed in a specific way under the framework of the DSD method. The double-layer optimizer is based on bilevel single-objective optimization and aims to find a unique optimal Pareto solution rather than generate the whole Pareto frontier on the lower level in order to improve the optimization efficiency. The proposed bilevel DSD approach is verified on several test cases, and a relevant comparison against another classical approach is made. It is shown that the approach can generate a quasi-evenly distributed Pareto set for the upper level with relatively low time consumption.     

Aircraft technology portfolio optimization using ant colony optimization

Technology portfolio selection is a combinatorial optimization problem often faced with a large number of combinations and technology incompatibilities. The main research question addressed in this article is to determine if Ant Colony Optimization (ACO) is better suited than Genetic Algorithms (GAs) and Simulated Annealing (SA) for technology portfolio optimization when incompatibility constraints between technologies are present. Convergence rate, capability to find optima, and efficiency in handling of incompatibilities are the three criteria of comparison. The application problem consists of finding the best technology portfolio from 29 aircraft technologies. The results show that ACO and GAs converge faster and find optima more easily than SA, and that ACO can optimize portfolios with technology incompatibilities without using penalty functions. This latter finding paves the way for more use of ACO when the number of constraints increases, such as in the technology and concept selection for complex engineering systems.     

可靠性优化的一种新的算法

建立了可靠性冗余优化模型,提出了一种基于粒子群优化算法的可靠性优化的新方法,该方法结合了遗传算法的思想。实例结果表明,粒子群算法比模拟退火算法和遗传算法效果好。     

An artificial immune network for multiobjective optimization problems

Multiobjective optimization is an important problem of great complexity and evolutionary algorithms have been established as a dominant approach in the field. This article suggests a method for approximating the Pareto front of a given function based on artificial immune networks. The proposed method uses cloning and mutation on a population of antibodies to create local subsets of the Pareto front. Elements of these local fronts are combined, in a way that maximizes diversity, to form the complete Pareto front of the function. The method is tested on a number of well-known benchmark problems, as well as an engineering problem. Its performance is compared against state-of-the-art algorithms, yielding promising results.     

Topology optimization of compliant mechanisms using pairs of curves

The structural topology optimization approach can be used to generate compliant mechanisms for some desired input–output requirements. The success of the optimization depends on the structural geometry representation scheme used. In this paper, a novel representation scheme is proposed. The representation scheme is characterized by pairs of curves that are used to connect Input/Ouput (I/O) regions of the structure. Each pair of curves includes a normal curve and a fat curve. The areas bounded by the pair of curves define the material distribution between them. All I/O regions are connected to one another (either directly or indirectly) by pairs of curves in order to form one single connected load-bearing structure. A genetic algorithm for constrained and multiobjective optimization is then applied with the representation scheme of the structure in the form of a graph. Simulation results from a displacement inverter and a displacement redirector indicate that the presented representation scheme is appropriate.     

牵引式下肢康复机器人机构参数优化及轨迹规划

为满足下肢运动功能障碍患者在不同阶段的康复训练需求,针对现有下肢康复机器人训练方式单一的问题,提出了一种可实现卧姿、坐姿训练模式的牵引式下肢康复机器人。首先,根据人体下肢运动机理和仿生原理,设计了一种五自由度混联机构构型。然后,建立了机器人的运动学模型,分别计算了其运动学正、逆解。接着,以人体下肢末端与机器人末端的工作空间重合度为目标函数,采用遗传算法对机器人的机构参数进行了优化,并求得人机系统矢状面内人体下肢的有效工作空间比为0.71。最后,规划了CPM（continuous passive motion,连续被动运动）、圆周运动和螺旋运动等3种康复训练运动轨迹,并根据优化后的机构参数搭建了机器人样机,通过运动捕捉实验验证了机器人结构设计与优化结果的合理性以及轨迹规划的正确性,表明该机器人能够满足下肢运动功能障碍患者的康复需求。     

Hierarchical optimization for topology design of multi-material compliant mechanisms

Multi-material topology optimization enables potential design possibilities in the multiphysics and structural designing fields. In this article, a bi-level hierarchical optimization method is introduced to address the multi-material design of compliant mechanisms. The hierarchical optimization develops decomposition approaches allowing the original complex multi-material optimization problem to be reduced to set of low-order single-material optimization sub-problems. The solution of the complex multi-material problem is found as a vector of the single-material sub-problems solutions. All the local sub-problems are solved with the solid isotropic material with penalization method independently, and a stiffness spreading technique is worked out to coordinate components of the global solution of the original problem. Several numerical examples are presented to demonstrate the validity of this method.     

Multi-objective optimization of combined Brayton and inverse Brayton cycles using advanced optimization algorithms

This study explores the use of teaching-learning-based optimization (TLBO) and artificial bee colony (ABC) algorithms for determining the optimum operating conditions of combined Brayton and inverse Brayton cycles. Maximization of thermal efficiency and specific work of the system are considered as the objective functions and are treated simultaneously for multi-objective optimization. Upper cycle pressure ratio and bottom cycle expansion pressure of the system are considered as design variables for the multi-objective optimization. An application example is presented to demonstrate the effectiveness and accuracy of the proposed algorithms. The results of optimization using the proposed algorithms are validated by comparing with those obtained by using the genetic algorithm (GA) and particle swarm optimization (PSO) on the same example. Improvement in the results is obtained by the proposed algorithms. The results of effect of variation of the algorithm parameters on the convergence and fitness values of the objective functions are reported.     

基于代理模型和改进遗传算法的注塑翘曲优化

提出一种最小化制品翘曲的注塑工艺参数优化集成方法.以空调柜机顶盖注塑制品开发为例,该方法使用Moldflow软件分析制品的翘曲变形,运用田口方法确定与制品翘曲量密切相关的工艺因素,然后采用响应曲面法(RSM)和改进的精英保留自适应遗传算法(EAGA)相结合的方法,建立主要影响工艺参数与制品翘曲量之间的关系模型,通过对模型寻优以实现对制品翘曲的优化.该方法的适用性在制品的实际生产中得到了验证.     

A variant space search method and its application to the optimization design of compressor profiles

Optimization methods have been widely used in practical engineering, with search efficiency and global search ability being the main evaluation criteria. In this article, the Bezier curve equivalent recursion is used in a genetic algorithm (GA) to realize the variant space search to improve the search efficiency and global search ability. The parameters related to this method are investigated by an optimization test of the simple curve approximation, which is then used for optimization designs of supersonic and transonic profiles. The results show that the GA can be improved if the variant space search method is added.     

可自动反冲洗的污水源热泵的应用研究

介绍一种带自动反冲洗功能的污水源热泵机组.增设此功能后,污水可以直接进入机组换热器,与带中间换热器的常规机组相比,减小传热温差.通过对整个系统进行优化设计,机组效率进一步提高,但设备成本有所增加.     

Topology optimization of fluid problems using genetic algorithm assisted by the Kriging model

A non‐gradient‐based approach for topology optimization using a genetic algorithm is proposed in this paper. The genetic algorithm used in this paper is assisted by the Kriging surrogate model to reduce computational cost required for function evaluation. To validate the non‐gradient‐based topology optimization method in flow problems, this research focuses on two single‐objective optimization problems, where the objective functions are to minimize pressure loss and to maximize heat transfer of flow channels, and one multi‐objective optimization problem, which combines earlier two single‐objective optimization problems. The shape of flow channels is represented by the level set function. The pressure loss and the heat transfer performance of the channels are evaluated by the Building‐Cube Method code, which is a Cartesian‐mesh CFD solver. The proposed method resulted in an agreement with previous study in the single‐objective problems in its topology and achieved global exploration of non‐dominated solutions in the multi‐objective problems. © 2016 The Authors International Journal for Numerical Methods in Engineering Published by John Wiley & Sons Ltd     

Knowledge‐based algorithms in fixed‐grid GA shape optimization

Shape optimization through a genetic algorithm (GA) using discrete boundary steps and the fixed‐grid (FG) finite‐element analysis (FEA) concept was recently introduced by the authors. In this paper, algorithms based on knowledge specific to the FG method with the GA‐based shape optimization (FGGA) method are introduced that greatly increase its computational efficiency. These knowledge‐based algorithms exploit the information inherent in the system at any given instance in the evolution such as string structure and fitness gradient to self‐adapt the string length, population size and step magnitude. Other non‐adaptive algorithms such as string grouping and deterministic local searches are also introduced to reduce the number of FEA calls. These algorithms were applied to two examples and their effects quantified. The examples show that these algorithms are highly effective in reducing the number of FEA calls required hence significantly improving the computational efficiency of the FGGA shape optimization method. Copyright © 2003 John Wiley & Sons, Ltd.     

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.