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 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.     

A comparative study of controlled random search algorithms with application to inverse aerofoil design

This article presents a comparative study of some versions of the controlled random search algorithm (CRSA) in global optimization problems. The basic CRSA, originally proposed by Price in 1977 and improved by Ali et al. in 1997, is taken as a starting point. Then, some new modifications are proposed to improve the efficiency and reliability of this global optimization technique. The performance of the algorithms is assessed using traditional benchmark test problems commonly invoked in the literature. This comparative study points out the key features of the modified algorithm. Finally, a comparison is also made in a practical engineering application, namely the inverse aerofoil shape design.     

飞机总体设计中的一种多目标鲁棒优化方法

 提出一种基于灵敏度的多目标鲁棒优化方法。针对各维设计变量存在扰动的情况,在原约束多目标优化模型上,附加偏差目标函数,并采用最差估计法对约束条件进行鲁棒可行性调整。采用全局敏度方程方法来计算目标函数和约束函数对设计变量的敏度,进而采用Pareto遗传算法搜索约束多目标优化问题的非劣解集,设计者可以根据不同的设计准则从中选择合适的设计点。将上述方法用于飞机总体参数优化设计,并与采用常规优化方法所得的优化结果进行了分析和比较。     

A constrained optimization algorithm based on the simplex search method

In this article, a robust method is presented for handling constraints with the Nelder and Mead simplex search method, which is a direct search algorithm for multidimensional unconstrained optimization. The proposed method is free from the limitations of previous attempts that demand the initial simplex to be feasible or a projection of infeasible points to the nonlinear constraint boundaries. The method is tested on several benchmark problems and the results are compared with various evolutionary algorithms available in the literature. The proposed method is found to be competitive with respect to the existing algorithms in terms of effectiveness and efficiency.     

Multidisciplinary design and optimization of an air launched satellite launch vehicle using a hybrid heuristic search algorithm

A multidisciplinary design and optimization strategy for a multistage air launched satellite launch vehicle comprising of a solid propulsion system to low earth orbit with the implementation of a hybrid heuristic search algorithm is proposed in this article. The proposed approach integrated the search properties of a genetic algorithm and simulated annealing, thus achieving an optimal solution while satisfying the design objectives and performance constraints. The genetic algorithm identified the feasible region of solutions and simulated annealing exploited the identified feasible region in search of optimality. The proposed methodology coupled with design space reduction allows the designer to explore promising regions of optimality. Modules for mass properties, propulsion characteristics, aerodynamics, and flight dynamics are integrated to produce a high-fidelity model of the vehicle. The objective of this article is to develop a design strategy that more efficiently and effectively facilitates multidisciplinary design analysis and optimization for an air launched satellite launch vehicle.     

Hybrid genetic optimization for design of photonic crystal emitters

A unique hybrid-optimization technique is proposed, based on genetic algorithms (GA) and gradient descent (GD) methods, for the smart design of photonic crystal (PhC) emitters. The photonic simulation is described and the granularity of photonic crystal dimensions is considered. An innovative sliding-window method for performing local heuristic search is demonstrated. Finally, the application of the proposed method on two case studies for the design of a multi-pixel photonic crystal emitter and the design of thermal emitter in thermal photovoltaic is demonstrated. Discussion in the report includes the ability of the optimal PhC structures designed using the proposed method, to produce unprecedented high emission efficiencies of 54.5% in a significantly long wavelength region and 84.9% at significantly short wavelength region.     

A combined global and local search method to deal with constrained optimization for continuous tabu search

Heuristic methods, such as tabu search, are efficient for global optimizations. Most studies, however, have focused on constraint‐free optimizations. Penalty functions are commonly used to deal with constraints for global optimization algorithms in dealing with constraints. This is sometimes inefficient, especially for equality constraints, as it is difficult to keep the global search within the feasible region by purely adding a penalty to the objective function. A combined global and local search method is proposed in this paper to deal with constrained optimizations. It is demonstrated by combining continuous tabu search (CTS) and sequential quadratic programming (SQP) methods. First, a nested inner‐ and outer‐loop method is presented to lead the search within the feasible region. SQP, a typical local search method, is used to quickly solve a non‐linear programming purely for constraints in the inner loop and provides feasible neighbors for the outer loop. CTS, in the outer loop, is used to seek for the global optimal. Finally, another local search using SQP is conducted with the results of CTS as initials to refine the global search results. Efficiency is demonstrated by a number of benchmark problems. Copyright © 2008 John Wiley & Sons, Ltd.     

压电智能连续体结构/控制一体化广义拓扑优化

对于以往较少涉及到的同时考虑结构拓扑、作动器位置与数目和控制器参数等多种优化设计变量参与的压电智能板结构的一体化优化设计问题,研究了结构/控制一体化广义拓扑优化设计的方法。提出采用基于耦合模态空间的二次型最优控制系统设计与基于遗传算法和数学形态学处理的策略进行一体化拓扑优化设计实现。数值算例的结果表明,所提方法合理、有效,能够得到清晰的结构拓扑和良好的可控性。     

A hybrid optimization method of harmony search and opposition-based learning

The harmony search (HS) method is an emerging meta-heuristic optimization algorithm. However, like most of the evolutionary computation techniques, it sometimes suffers from a rather slow search speed, and fails to find the global optimum in an efficient way. In this article, a hybrid optimization approach is proposed and studied, in which the HS is merged together with the opposition-based learning (OBL). The modified HS, namely HS-OBL, has an improved convergence property. Optimization of 24 typical benchmark functions and an optimal wind generator design case study demonstrate that the HS-OBL can indeed yield a superior optimization performance over the regular HS method.     

结构主动控制的一体化多目标优化研究

基于Pareto多目标遗传算法提出了结构主动控制系统的一体化多目标优化设计方法,对作动器位置与主动控制器进行同步优化设计.外界激励采用平稳过滤白噪声来模拟,在状态空间下通过求解Lyapunov方程,得到结构响应和主动控制力的均方值.主动控制器采用LQG控制算法来进行设计.以结构位移和加速度均方值最大值与相应无控响应均方值的最大值之比,以及所需控制力均方值之和作为多目标同步优化的目标函数.优化过程还考虑了结构与激励参数对优化结果的影响.最后以某6层平面框架有限元模型为例进行了计算机仿真分析,结果表明所提出的主动控制系统多目标一体化优化方法简单,高效,实用,具有较好的普适性.     

变入射角度和频率时的声障板的优化设计方法

声障板是声纳设计中必不可少的声学元件。根据不同要求,合理优化声障板的材料和结构参数是声障板设计的关键。遗传算法作为一种有效的优化方法,在工程优化领域得到广泛的应用。但是由于其计算时不依赖外部信息,因此染色体的构成、编码的形式以及代价函数的选择对遗传算法性能会产生重要的影响。针对在一定入射频率范围内和一定入射角度内,反射系数保持最小且基本一致,提出了一种基于遗传算法的多层复合声障板参数的优化方法。在算法中,给出了基于传递矩阵的染色体编码和基于统计原理的代价函数。通过仿真计算,验证了算法的正确性和可靠性,分析了代价函数的改变对优化结果的影响。     

Analysis,design and optimization of structures using force method and genetic algorithm

In the first part of this paper, the energy formulation of the force method is presented and analysis is performed using genetic algorithm. Two simple examples are provided to show the accuracy of the approach. In the second part, an efficient method is developed for designing structures with prescribed stress ratios for its members. The genetic algorithm performed very well and designs with specified stress ratios were achieved with a good convergence rate. A unit value of c_i for all the members of a structure corresponds to the well known fully stressed design. In the third part, minimum weight design is formulated by the additional conditions being imposed on the design process. Again, genetic algorithm showed to be a powerful means for optimization. Copyright © 2005 John Wiley & Sons, Ltd.     

遗传算法的改进策略及其在桥梁抗震优化设计中的应用效果

本文论述了采用遗传算法进行结构优化设计时遇到的诸如计算量大、早熟收敛和边界探索不足等棘手问题，提出了三个解决对策，编制了计算程序，其在桥梁抗震代化设计中的应用效果表明，改进后的遗传算法不但提高了计算速度，而且在尽可能短的时间内找到最好的优化解。     

A diversity-enriched variant of discrete PSO applied to the design of water distribution networks

The design of water distribution networks (WDNs) is addressed by using a variant of the particle swarm optimization (PSO) algorithm. This variant, which makes use of a discrete version of PSO already considered by the authors, overcomes one of the PSO's main drawbacks, namely its difficulty in maintaining acceptable levels of population diversity and in balancing local and global searches. The performance of the variant proposed here is investigated by applying the model to solve two standard benchmark problems: the Hanoi new water distribution network and the New York Tunnel water supply system. The results obtained show considerable improvements in both convergence characteristics and the quality of the final solutions, and near-optimal results are consistently achieved at reduced computational cost.     

生活垃圾专用装载装置尺寸优化设计

 针对现有垃圾中转站无法与压缩车配套使用的问题,提出了新型生活垃圾中转站装载装置方案.运用遗传算法对生活垃圾六杆举卸装置进行运动优化设计,建立了目标函数和约束条件,实现了垃圾翻斗举卸轨迹的优化,利用ADAMS进行了动力优化,确定了相关构件的结构参数.在优化设计的基础上制作了主体机构样机模型,试验表明该装置达到了预期设计要求.     

Microstructure optimization design methods of the forging process and applications

A microstructure optimization design method of the forging process is proposed. The optimization goal is the fine grain size and homogeneous grain distribution. The optimization object is the forging process parameters and the shape of the preform die. The grain size sub-objective function, the forgings shape sub-objective function and the whole objective function including the shape and the grain size are established, respectively. The detailed optimization steps are given. The microstructure optimization program is developed using the micro-genetic algorithm and the finite element method. Then, the upsetting process of the cylindrical billet is analyzed using a self-developed program. The forging parameters and the shape of preform die of the upsetting process are optimized respectively. The fine size and homogenous distribution of the grain can be achieved by controlling the shape of the preform die and improving the friction condition.     

应用遗传算法和神经网络的工程电梯传动机构模糊优化设计

 考虑到影响设计的某些因素很难用确定数值表示,以工程电梯传动机构中蜗轮齿冠体积最小为优化目标,建立了模糊优化设计的数学模型。采用二级模糊综合评判法按最大隶属度原则求出最优水平截集,将模糊优化问题转化为普通优化问题。另外,通过神经网络方法得出网络权值和阈值以拟合待求系数,并采用加法形式的惩罚策略来构造带有惩罚项的适值函数,应用Matlab遗传算法工具箱寻求问题最优解,从而提高设计精度和搜索效率。     

Reducing the computational cost of local search in the hybrid evolutionary algorithm with application to electronic imaging

This article focuses on the efficiency problems associated with the use of local search in the hybrid evolutionary algorithm. A two-phase cyclic local search is proposed that alternates the random search and the downhill simplex method (DSM), and helps prevent the algorithm from converging to a sub-optimal solution in multidimensional optimization. The algorithm utilizes a novel micro-model of image local response, in order to reduce the number of fitness evaluations during the local DSM search, with the application to the global optimization problem arising in electronic imaging. The problem is stated as the search for the feasible transformation parameters that minimize the difference between two images. Image local response is defined as the variation of the fitness function that occurs because of a small variation of the parameters, and is computed over a small pixel area. The computed response coefficients specify a contraction transformation applied to the vector of the regular DSM coefficients that control the movement and the shape of the simplex. The transformation adjusts the length of the vector, making the step size of the simplex adaptive to the local properties of the fitness landscape. The computational experiments with two-dimensional grayscale images provide the experimental support and justification of the analytical model of image local response and its utilization for the reduction of the computational cost of local search, without the loss of the quality of the final solution.     

远邻粒子群算法及在Delta机器人优化设计中的应用

 为了提高粒子群算法全局寻优能力,提出一种远邻粒子群算法,该算法引入邻域算子概念,每个粒子选择与自身欧氏距离较远的粒子建立邻域,邻域中粒子的数目用邻域算子表示.测试函数实验结果表明,该算法在一定程度上消除了标准粒子群算法容易陷入局部最优的缺点.应用远邻粒子群算法对Delta机器人进行优化设计,结果证实：所提出的远邻粒子群算法较标准粒子群算法具有更好的寻优能力,比邻居递增粒子群算法搜索精度更高.