Enhanced similarity-based metamodel updating strategy for reliability-based design optimization

Metamodels are becoming increasingly popular for handling large-scale optimization problems in product development. Metamodel-based reliability-based design optimization (RBDO) helps to improve the computational efficiency and reliability of optimal design. However, a metamodel in engineering applications is an approximation of a high-fidelity computer-aided engineering model and it frequently suffers from a significant loss of predictive accuracy. This issue must be appropriately addressed before the metamodels are ready to be applied in RBDO. In this article, an enhanced strategy with metamodel selection and bias correction is proposed to improve the predictive capability of metamodels. A similarity-based assessment for metamodel selection (SAMS) is derived from the cross-validation and similarity theories. The selected metamodel is then improved by Bayesian inference-based bias correction. The proposed strategy is illustrated through an analytical example and further demonstrated with a lightweight vehicle design problem. The results show its potential in handling real-world engineering problems.     

A kriging metamodel-assisted robust optimization method based on a reverse model

The goal of robust optimization methods is to obtain a solution that is both optimum and relatively insensitive to uncertainty factors. Most existing robust optimization approaches use outer–inner nested optimization structures where a large amount of computational effort is required because the robustness of each candidate solution delivered from the outer level should be evaluated in the inner level. In this article, a kriging metamodel-assisted robust optimization method based on a reverse model (K-RMRO) is first proposed, in which the nested optimization structure is reduced into a single-loop optimization structure to ease the computational burden. Ignoring the interpolation uncertainties from kriging, K-RMRO may yield non-robust optima. Hence, an improved kriging-assisted robust optimization method based on a reverse model (IK-RMRO) is presented to take the interpolation uncertainty of kriging metamodel into consideration. In IK-RMRO, an objective switching criterion is introduced to determine whether the inner level robust optimization or the kriging metamodel replacement should be used to evaluate the robustness of design alternatives. The proposed criterion is developed according to whether or not the robust status of the individual can be changed because of the interpolation uncertainties from the kriging metamodel. Numerical and engineering cases are used to demonstrate the applicability and efficiency of the proposed approach.     

基于序贯层次Kriging模型的微型飞行器机身结构设计优化

在基于仿真模型的工程设计优化中,采用高精度、高成本的分析模型会导致计算量大,采用低精度、低成本的分析模型会导致设计优化结果的可信度低,难以满足实际工程的要求。为了有效平衡高精度与低成本之间的矛盾关系,通过建立序贯层次Kriging模型融合高/低精度数据,采用大量低成本、低精度的样本点反映高精度分析模型的变化趋势,并采用少量高成本、高精度的样本点对低精度分析模型进行校正,以实现对优化目标的高精度预测。为了避免层次Kriging模型误差对优化结果的影响,将层次Kriging模型与遗传算法相结合,根据6σ设计准则计算每一代最优解的预测区间,具有较大预测区间的当前最优解即为新的高精度样本点。同时,在优化过程中序贯更新层次Kriging模型,提高最优解附近的层次Kriging模型的预测精度,从而保证设计结果的可靠性。将所提出的方法应用于微型飞行器机身结构的设计优化中,以验证该方法的有效性和优越性。采用具有不同单元数的网格模型分别作为低精度分析模型和高精度分析模型,利用最优拉丁超立方设计分别选取60个低精度样本点和20个高精度样本点建立初始层次Kriging模型,采用本文方法求解并与直接采用高精度仿真模型求解的结果进行比较。结果表明,所提出的方法能够有效利用高/低精度样本点处的信息,建立高精度的层次Kriging模型;本文方法仅需要少量的计算成本就能求得近似最优解,有效提高了设计效率,为类似的结构设计优化问题提供了参考。     

Optimizing Latin hypercube design for sequential sampling of computer experiments

Space-filling and projective properties are desired features in the design of computer experiments to create global metamodels to replace expensive computer simulations in engineering design. The goal in this article is to develop an efficient and effective sequential Quasi-LHD (Latin Hypercube design) sampling method to maintain and balance the two aforementioned properties. The sequential sampling is formulated as an optimization problem, with the objective being the Maximin Distance, a space-filling criterion, and the constraints based on a set of pre-specified minimum one-dimensional distances to achieve the approximate one-dimensional projective property. Through comparative studies on sampling property and metamodel accuracy, the new approach is shown to outperform other sequential sampling methods for global metamodelling and is comparable to the one-stage sampling method while providing more flexibility in a sequential metamodelling procedure.     

Distributed evolutionary algorithms with hierarchical evaluation

A distributed evolutionary algorithm is presented that is based on a hierarchy of (fitness or cost function) evaluation passes within each deme and is efficient in solving engineering optimization problems. Starting with non-problem-specific evaluations (using surrogate models or metamodels, trained on previously evaluated individuals) and ending up with high-fidelity problem-specific evaluations, intermediate passes rely on other available lower-fidelity problem-specific evaluations with lower CPU cost per evaluation. The sequential use of evaluation models or metamodels, of different computational cost and modelling accuracy, by screening the generation members to get rid of non-promising individuals, leads to reduced overall computational cost. The distributed scheme is based on loosely coupled demes that exchange regularly their best-so-far individuals. Emphasis is put on the optimal way of coupling distributed and hierarchical search methods. The proposed method is tested on mathematical and compressor cascade airfoil design problems.     

A Constraint‐based Maximum Entropy Sampling Method for Kriging Models in Fuel Cell Applications

A metamodel replaces the simulation model with an approximation model to make design optimization computationally achievable. The accuracy of a metamodel depends highly on the choice of sampling points. This article proposes a constraint‐based maximum entropy sampling method that locates most sampling points within a feasible constraint domain represented as a complex nonlinear function. As a robust measure of information, a maximum entropy criterion is used to select sampling points for constructing the Kriging model. The violation ratio from the feasible domain is incorporated into the covariance function in the Kriging model. The constraint‐based maximum entropy sampling method is applied to reduce the weight of a bipolar plate in a vanadium redox battery by optimizing its channel design. The proposed sampling method rapidly approximates the boundary of the feasible domain with a relatively small number of sampling points. Final optimal design results for the plate channel using the proposed method indicate a significant reduction in the plate weight compared with the existing bipolar plate design. Copyright © 2012 John Wiley & Sons, Ltd.     

基于Stochastic Kriging模型的不确定性序贯试验设计方法

不确定性研究中需要计算大量重复样本,这无疑对计算量较大的数值模拟提出了巨大的挑战.通过试验设计方法可以有效地减少不确定性研究中的计算量,然而,目前考虑不确定性的试验设计方法研究大多仍专注于传统试验设计方法.针对这一问题,为了通过更为合理的计算资源分配得到更精准的不确定性评估,基于有限样本的Stochastic Kriging模型提出了针对不确定性问题的三阶段序贯试验设计方法.首先,通过特定位置的采样对IMSE进行简化,构建了预选步进信息选取策略,通过预选增量样本总个数以及各取样位置处的分布信息,达到随机代理模型目标精度要求;同时,基于IMSE构建了基于步进信息的单轮选点试验设计准则,以同时考虑设计变量的取样位置及其分布信息.由算例与传统方法的对比分析可知,所建立方法通过等量的采样得到了精度更高的随机代理模型,验证了其在不确定性问题中的可行性和优势.     

Sequential sampling designs based on space reduction

In the field of engineering design and optimization, metamodels are widely used to replace expensive simulation models in order to reduce computing costs. To improve the accuracy of metamodels effectively and efficiently, sequential sampling designs have been developed. In this article, a sequential sampling design using the Monte Carlo method and space reduction strategy (MCSR) is implemented and discussed in detail. The space reduction strategy not only maintains good sampling properties but also improves the efficiency of the sampling process. Furthermore, a local boundary search (LBS) algorithm is proposed to efficiently improve the performance of MCSR, which is called LBS-MCSR. Comparative results with several sequential sampling approaches from low to high dimensions indicate that the space reduction strategy generates samples with better sampling properties (and thus better metamodel accuracy) in less computing time.     

Hybrid surrogate-model-based multi-fidelity efficient global optimization applied to helicopter blade design

A multi-fidelity optimization technique by an efficient global optimization process using a hybrid surrogate model is investigated for solving real-world design problems. The model constructs the local deviation using the kriging method and the global model using a radial basis function. The expected improvement is computed to decide additional samples that can improve the model. The approach was first investigated by solving mathematical test problems. The results were compared with optimization results from an ordinary kriging method and a co-kriging method, and the proposed method produced the best solution. The proposed method was also applied to aerodynamic design optimization of helicopter blades to obtain the maximum blade efficiency. The optimal shape obtained by the proposed method achieved performance almost equivalent to that obtained using the high-fidelity, evaluation-based single-fidelity optimization. Comparing all three methods, the proposed method required the lowest total number of high-fidelity evaluation runs to obtain a converged solution.     

Generation of a cokriging metamodel using a multiparametric strategy

In the course of designing structural assemblies, performing a full optimization is very expensive in terms of computation time. In order or reduce this cost, we propose a multilevel model optimization approach. This paper lays the foundations of this strategy by presenting a method for constructing an approximation of an objective function. This approach consists in coupling a multiparametric mechanical strategy based on the LATIN method with a gradient-based metamodel called a cokriging metamodel. The main difficulty is to build an accurate approximation while keeping the computation cost low. Following an introduction to multiparametric and cokriging strategies, the performance of kriging and cokriging models is studied using one- and two-dimensional analytical functions; then, the performance of metamodels built from mechanical responses provided by the multiparametric strategy is analyzed based on two mechanical test examples.     

Reliability-based design optimization using a moment method and a kriging metamodel

Reliability-based design optimization (RBDO) has been used for optimizing engineering systems with uncertainties in design variables and system parameters. RBDO involves reliability analysis, which requires a large amount of computational effort, so it is important to select an efficient method for reliability analysis. Of the many methods for reliability analysis, a moment method, which is called the fourth moment method, is known to be less expensive for moderate size problems and requires neither iteration nor the computation of derivatives. Despite these advantages, previous research on RBDO has been mainly based on the first-order reliability method and relatively little attention has been paid to moment-based RBDO. This article considers difficulties in implementing the moment method into RBDO; they are solved using a kriging metamodel with an active constraint strategy. Three numerical examples are tested and the results show that the proposed method is efficient and accurate.     

Solving bi-level optimization problems in engineering design using kriging models

Stackelberg game-theoretic approaches are applied extensively in engineering design to handle distributed collaboration decisions. Bi-level genetic algorithms (BLGAs) and response surfaces have been used to solve the corresponding bi-level programming models. However, the computational costs for BLGAs often increase rapidly with the complexity of lower-level programs, and optimal solution functions sometimes cannot be approximated by response surfaces. This article proposes a new method, namely the optimal solution function approximation by kriging model (OSFAKM), in which kriging models are used to approximate the optimal solution functions. A detailed example demonstrates that OSFAKM can obtain better solutions than BLGAs and response surface-based methods, and at the same time reduce the workload of computation remarkably. Five benchmark problems and a case study of the optimal design of a thin-walled pressure vessel are also presented to illustrate the feasibility and potential of the proposed method for bi-level optimization in engineering design.     

Construction of nested maximin designs based on successive local enumeration and modified novel global harmony search algorithm

Engineering design often involves different types of simulation, which results in expensive computational costs. Variable fidelity approximation-based design optimization approaches can realize effective simulation and efficiency optimization of the design space using approximation models with different levels of fidelity and have been widely used in different fields. As the foundations of variable fidelity approximation models, the selection of sample points of variable-fidelity approximation, called nested designs, is essential. In this article a novel nested maximin Latin hypercube design is constructed based on successive local enumeration and a modified novel global harmony search algorithm. In the proposed nested designs, successive local enumeration is employed to select sample points for a low-fidelity model, whereas the modified novel global harmony search algorithm is employed to select sample points for a high-fidelity model. A comparative study with multiple criteria and an engineering application are employed to verify the efficiency of the proposed nested designs approach.     

A parallel adaptive sampling strategy to accelerate the sampling process during the modeling of a Kriging metamodel

ABSTRACT

Higher modeling efficiency is an important goal for the modeling of a Kriging (KG) metamodel, and the sampling approach affects the modeling efficiency directly. Considering the effect of the employed correlation model on prediction accuracy of a KG model, a multiple KG models based parallel adaptive sampling strategy (MKPAS) is proposed using the combination forecasting method, in which the added new points in the sampling process are determined using multiple KG models with different correlation models. The effectiveness of the proposed approach is verified by two low dimensional benchmark functions as well as a high dimensional one. And an engineering application is also used to demonstrate the effectiveness of the proposed MKPAS approach. The results show that the proposed approach can improve the modeling efficiency of a KG model significantly compared with other ordinary sampling approaches.     

An adaptive metamodel-based global optimization algorithm for black-box type problems

In this article, an adaptive metamodel-based global optimization (AMGO) algorithm is presented to solve unconstrained black-box problems. In the AMGO algorithm, a type of hybrid model composed of kriging and augmented radial basis function (RBF) is used as the surrogate model. The weight factors of hybrid model are adaptively selected in the optimization process. To balance the local and global search, a sub-optimization problem is constructed during each iteration to determine the new iterative points. As numerical experiments, six standard two-dimensional test functions are selected to show the distributions of iterative points. The AMGO algorithm is also tested on seven well-known benchmark optimization problems and contrasted with three representative metamodel-based optimization methods: efficient global optimization (EGO), GutmannRBF and hybrid and adaptive metamodel (HAM). The test results demonstrate the efficiency and robustness of the proposed method. The AMGO algorithm is finally applied to the structural design of the import and export chamber of a cycloid gear pump, achieving satisfactory results.     

A new sampling scheme for developing metamodels with the zeros of Chebyshev polynomials

The accuracy of metamodelling is determined by both the sampling and approximation. This article proposes a new sampling method based on the zeros of Chebyshev polynomials to capture the sampling information effectively. First, the zeros of one-dimensional Chebyshev polynomials are applied to construct Chebyshev tensor product (CTP) sampling, and the CTP is then used to construct high-order multi-dimensional metamodels using the ‘hypercube’ polynomials. Secondly, the CTP sampling is further enhanced to develop Chebyshev collocation method (CCM) sampling, to construct the ‘simplex’ polynomials. The samples of CCM are randomly and directly chosen from the CTP samples. Two widely studied sampling methods, namely the Smolyak sparse grid and Hammersley, are used to demonstrate the effectiveness of the proposed sampling method. Several numerical examples are utilized to validate the approximation accuracy of the proposed metamodel under different dimensions.     

Homogenisation Metamodelling of Perforated Plates

Abstract:  The use of finite element (FE)-based homogenisation has improved the study of composite material properties. However, it involves enormous computational effort when implemented in engineering design problems. Therefore an artificial neural network (ANN) surrogate model is proposed here to avoid this issue. In this study, a numerical homogenisation code was developed based on a commercial FE package. It is used to develop the ANN metamodel for an individual composite structure. The effectiveness of the metamodel was examined through an analytical optimisation procedure.     

Multifidelity adaptive kriging metamodel based on discretization error bounds

This article presents an approach to build a multifidelity kriging metamodel from finite element computations on different meshes for stuctural reliability assessment. The proposed method takes advantage of the computation of bounds on the discretization error, which enables to guarantee the state (safe or failure) of each computation of the performance function. An algorithm to build the metamodel from the different levels of fidelity and estimate the failure probability is provided. Illustrations are presented on a two dimensional mechanical crack opening problem. Bounds on the failure probability are also post-processed.     

Non-stationary kriging for design optimization

Traditional surrogate modelling techniques, such as kriging, have been employed quite effectively within design optimizations. However, such models can fail to reproduce non-stationary responses accurately. This article explores the application of non-stationary kriging to design optimization and attempts to determine its applicability with regard to the optimization of both stationary and non-stationary objective functions. A series of analytical test problems and an engineering design problem are used to compare the performance of non-stationary and adaptive partial non-stationary kriging to traditional stationary kriging.     

Distributed supply chain network modelling and simulation: integration of agent-based distributed simulation and improved SCOR model

Agent-based distributed simulation is an efficient methodology for modelling and analysing such complex adaptive systems as dynamic supply chain networks. However, it lacks an acceptable generic standard. Supply chain operations reference (SCOR) model is a cross-functional framework widely accepted as an industry standard. It provides the standard processes, performance metrics, best practices and associated software functionalities for modelling, evaluating and improving supply chain networks. However, it is a static tool. Integration of agent-based distributed simulation and SCOR model can exploit their advantages to form a generic methodology for modelling and simulation of a wide range of supply chain networks. Therefore, this paper proposes a methodology for distributed supply chain network modelling and simulation by means of integration of agent-based distributed simulation and an improved SCOR model. The methodology contains two components: a hierarchical framework for modelling supply chain network based on the improved SCOR model and agent building blocks integrating the standard processes from the SCOR model. The hierarchical framework provides an approach for structure modelling in any level with different granularities based on the improved SCOR model, and allows rapidly mapping a supply chain network into the structure model of a multi-agent system; while agent building blocks are quite useful and convenient to fill the structure model to fulfil its function modelling. With the approach of structure modelling and function filling, not only can the process of agent-based supply chain network modelling be accelerated, but also the built models can be reused and expanded. Because the hierarchical framework is based on the conceptual framework of SCOR model and agent building blocks integrate the standard processes from SCOR model, the proposed methodology is more generic. In addition, the issues of sub-model synchronisation and data distribution management in the agent-based distributed simulation implementation are taken into consideration and the corresponding solutions for these issues are proposed. Finally, an example of a supply chain network is modelled and implemented to illustrate the proposed methodology and related solutions.