- Research Article
67
- 10.1016/j.cja.2013.02.004
Research on multi-fidelity aerodynamic optimization methods
- Mar 06, 2013
- Chinese Journal of Aeronautics
- Likeng Huang + 2 more +2
Research on multi-fidelity aerodynamic optimization methods
Efficient multi-objective CMA-ES algorithm assisted by knowledge-extraction-based variable-fidelity surrogate model
Research on multi-fidelity aerodynamic optimization methods
Research on multi-fidelity aerodynamic optimization methods
Optimization design of horizontal well fracture stage placement in shale gas reservoirs based on an efficient variable-fidelity surrogate model and intelligent algorithm
Optimization design of horizontal well fracture stage placement in shale gas reservoirs based on an efficient variable-fidelity surrogate model and intelligent algorithm
Read moreMulti-Objective based Generation Fuel Cost and Emission Reduction using Grasshopper Optimization Algorithm
In this paper, the problems of fuel cost and emission reduction based on multi-objective optimization are studied and solved. Various multi-objective optimization algorithms, such as the multi-objective ant lion optimization (MOALO), the multi-objective multiverse optimization (MOMVO), the multi-objective particle swarm optimization (MOPSO), the multi-objective thermal exchange optimization (MOTEO), and the multi-objective grasshopper optimization algorithm (MOGOA), are used to reduce the cost and emissions of generation fuel. With equality and inequality restrictions, the suggested work is carried out in an IEEE 30 bus system. To determine the lowest system-wide minimization of generating cost and emission, the results of several optimization strategies are compared. In terms of lowering fuel costs and emissions, the MOGOA performs better than any other multi-objective algorithms.
Read moreA Multiobjective Adaptive Surrogate Modeling-Based Optimization (MO-ASMO) Framework Using Efficient Sampling Strategies
A novel multiobjective adaptive surrogate modeling-based optimization (MO-ASMO) framework is proposed to utilize a minimal number of training samples efficiently for sequential model updates. All the sample points are enforced to be feasible, and to provide coverage of sparsely explored sparse design regions using a new optimization subproblem. The MO-ASMO method only evaluates high-fidelity functions at feasible sample points. During an exploitation sample phase, samples are selected to enhance solution accuracy rather than the global exploration. Sampling tasks are especially challenging for multiobjective optimization; for an n-dimensional design space, a strategy is required for generating model update sample points near an (n − 1)-dimensional hypersurface corresponding to the Pareto set in the design space. This is addressed here using a force-directed layout algorithm, adapted from graph visualization strategies, to distribute feasible sample points evenly near the estimated Pareto set. Model validation samples are chosen uniformly on the Pareto set hypersurface, and surrogate model estimates at these points are compared to high-fidelity model responses. All high-fidelity model evaluations are stored for later use to train an updated surrogate model. The MO-ASMO algorithm, along with the set of new sampling strategies, are tested using two mathematical and one realistic engineering problems. The second mathematical test problems is specifically designed to test the limits of this algorithm to cope with very narrow, non-convex feasible domains. It involves oscillatory objective functions, giving rise to a discontinuous set of Pareto-optimal solutions. Also, the third test problem demonstrates that the MO-ASMO algorithm can handle a practical engineering problem with more than 10 design variables and black-box simulations. The efficiency of the MO-ASMO algorithm is demonstrated by comparing the result of two mathematical problems to the results of the NSGA-II algorithm in terms of the number of high fidelity function evaluations, and is shown to reduce total function evaluations by several orders of magnitude when converging to the same Pareto sets.
Read moreEfficient Bayesian multi-fidelity inverse analysis for expensive and non-differentiable physics-based simulations in high stochastic dimensions
• Differentiable multi-fidelity inference: BMFIA enables gradient-based Bayesian inference for high-dimensional, non-differentiable multi-physics problems using low-fidelity model gradients. • Efficiency with minimal HF data: Accurate posterior estimates are achieved from only 100–300 HF–LF simulations with orders-of-magnitude speed-ups over HF-only inference. • Accuracy despite crude LF models: Robust posterior reconstruction is maintained even with weakly correlated or simplified low-fidelity models. High-dimensional Bayesian inverse analysis ( dim ≫ 100 ) is mostly unfeasible for computationally demanding, nonlinear physics-based high-fidelity (HF) models. Usually, the use of more efficient gradient-based inference schemes is impeded if the multi-physics models are provided by complex legacy codes. Adjoint-based derivatives are either exceedingly cumbersome to derive or nonexistent for practically relevant large-scale nonlinear and coupled multi-physics problems. Similarly, holistic automated differentiation w. r. t. primary variables of multi-physics codes is usually not yet an option and requires extensive code restructuring if not considered from the outset in the software design. This absence of differentiability further exacerbates the already present computational challenges. To overcome the existing limitations, we propose a novel inference approach called Bayesian multi-fidelity inverse analysis (BMFIA) , which leverages simpler and computationally cheaper lower-fidelity (LF) models that are designed to provide model derivatives. BMFIA learns a simple, probabilistic dependence of the LF and HF models, which is then employed in an altered likelihood formulation to statistically correct the inaccurate LF response. From a Bayesian viewpoint, this dependence represents a multi-fidelity (MF) conditional density (discriminative model). We demonstrate how this MF conditional density can be learned robustly in the small data regime from only a few HF and LF simulations (50 to 300), which would not be sufficient for naive surrogate approaches. The formulation is fully differentiable and allows the flexible design of a wide range of LF models. We demonstrate that BMFIA solves Bayesian inverse problems for scenarios that used to be prohibitive, such as finely-resolved and hence high-dimensional spatial reconstruction problems in two-dimensional Euclidean domains with static posteriors, given nonlinear and transient coupled poro-elastic media physics. We show that the resulting static MF posteriors are in excellent agreement with the (usually inaccessible) HF posteriors or ground-truth data and note that extending the framework to arbitrary three-dimensional domains is a natural and important direction for future work.
Read moreEfficient model-correction-based reliability analysis of uncertain dynamical systems
The scope of this paper is to apply a model-correction-based strategy for efficient reliability analysis of uncertain dynamical systems based on a low-fidelity (LF) model whose outcomes are corrected in a probabilistic sense to represent the more realistic outcomes of a high-fidelity (HF) model. In the model-correction approach utilized, the LF model is calibrated to the HF model close to the so-called most probable point in standard normal space, which allows a more realistic assessment of the considered complex dynamical system. Since only few expensive limit state function evaluations of the HF model are required, an efficient reliability analysis is enabled. In an application example, the LF model describes an existing single-span railway bridge modelled as simply supported Euler–Bernoulli beam subjected to moving single forces representing the axle loads of a moving train. The HF modelling approach accounts for the bridge–train interaction by modelling the passing train as mass-spring-damper system, however increasing the computational effort of the limit state function evaluations. Failure probabilities evaluated with the model-correction approach are contrasted and discussed with failure probabilities of the sophisticated bridge–train interaction model evaluated with the first-order reliability method (FORM). It is demonstrated that the efficiency of the method depends on the correlation between the LF and the HF model. A comparison of the results of FORM and the model-correction-based approach shows that the latter provides reliable failure probability prediction of the HF model while leading to a significant reduction in computational effort.
Read moreA performance comparison of multi-objective optimization algorithms for solving nearly-zero-energy-building design problems
A performance comparison of multi-objective optimization algorithms for solving nearly-zero-energy-building design problems
Read moreDesign approach for tilt propellers of UAM/eVTOLs for cruise and hover considering aerodynamic and aeroacoustic characteristics via a multi-fidelity model
Design approach for tilt propellers of UAM/eVTOLs for cruise and hover considering aerodynamic and aeroacoustic characteristics via a multi-fidelity model
Read moreExtended Hierarchical Kriging Method for Aerodynamic Model Generation Incorporating Multiple Low-Fidelity Datasets
Multi-fidelity surrogate modeling (MFSM) methods are gaining recognition for their effectiveness in addressing simulation-based design challenges. Prior approaches have typically relied on recursive techniques, combining a limited number of high-fidelity (HF) samples with multiple low-fidelity (LF) datasets structured in hierarchical levels to generate a precise HF approximation model. However, challenges arise when dealing with non-level LF datasets, where the fidelity levels of LF models are indistinguishable across the design space. In such cases, conventional methods employing recursive frameworks may lead to inefficient LF dataset utilization and substantial computational costs. To address these challenges, this work proposes the extended hierarchical Kriging (EHK) method, designed to simultaneously incorporate multiple non-level LF datasets for improved HF model construction, regardless of minor differences in fidelity levels. This method leverages a unique Bayesian-based MFSM framework, simultaneously combining non-level LF models using scaling factors to construct a global trend model. During model processing, unknown scaling factors are implicitly estimated through hyperparameter optimization, resulting in minimal computational costs during model processing, regardless of the number of LF datasets integrated, while maintaining the necessary accuracy in the resulting HF model. The advantages of the proposed EHK method are validated against state-of-the-art MFSM methods through various analytical examples and an engineering case study involving the construction of an aerodynamic database for the KP-2 eVTOL aircraft under various flying conditions. The results demonstrated the superiority of the proposed method in terms of computational cost and accuracy when generating aerodynamic models from the given multi-fidelity datasets.
Read moreA competitive variable-fidelity surrogate-assisted CMA-ES algorithm using data mining techniques
A competitive variable-fidelity surrogate-assisted CMA-ES algorithm using data mining techniques
Multi-Objective Five-Element Cycle Optimization Algorithm Based on Multi-Strategy Fusion for the Bi-Objective Traveling Thief Problem
In this paper, we propose a Multi-objective Five-element Cycle Optimization algorithm based on Multi-strategy fusion (MOFECO-MS) to address the Bi-objective Traveling Thief Problem (BITTP), an extension of the Traveling Thief Problem that incorporates two conflicting objectives. The novelty of our approach lies in a unique individual selection strategy coupled with an innovative element update mechanism rooted in the Five-element Cycle Model. To balance global exploration and local exploitation, the algorithm categorizes the population into distinct groups and applies crossover operations both within and between these groups, while also employing a mutation operator for local searches on the best individuals. This coordinated approach optimizes parameter settings and enhances the search capabilities of the algorithm. Extensive experiments were conducted on nine BITTP instances, comparing MOFECO-MS against eight state-of-the-art multi-objective optimization algorithms. The results show that MOFECO-MS excels in both Hypervolume (HV) and Spread (SP) indicators, while also maintaining a high level of Pure Diversity (PD). Overall, MOFECO-MS outperformed the other algorithms in most instances, demonstrating its superiority and robustness in solving complex multi-objective optimization problems.
Read moreMulti-objective fuzzy Q-learning to solve continuous state-action problems
Multi-objective fuzzy Q-learning to solve continuous state-action problems
Multi-objective optimal approach for injection molding based on surrogate model and particle swarm optimization algorithm
An integrated optimization strategy based on Kriging model and multi-objective particle swarm optimization (PSO) algorithm was constructed. As a new surrogate model technology, Kriging model has better fitting precision for nonlinear problem. The Kriging model was adopted to replace computer aided engineering (CAE) simulation as fitness function of multi-objective PSO algorithm, and the computation cost can be reduced greatly. By introducing multi-objective handling mechanism of crowding distance and mutation operator to multi-objective PSO algorithm, the entire Pareto front can be approximated better. It is shown that the multi-objective optimization strategy can get higher solving accuracy and computation efficiency under small sample.
Read moreMOBRO: multi-objective battle royale optimizer.
Battle Royale Optimizer (BRO) is a recently proposed optimization algorithm that has added a new category named game-based optimization algorithms to the existing categorization of optimization algorithms. Both continuous and binary versions of this algorithm have already been proposed. Generally, optimization problems can be divided into single-objective and multi-objective problems. Although BRO has successfully solved single-objective optimization problems, no multi-objective version has been proposed for it yet. This gap motivated us to design and implement the multi-objective version of BRO (MOBRO). Although there are some multi-objective optimization algorithms in the literature, according to the no-free-lunch theorem, no optimization algorithm can efficiently solve all optimization problems. We applied the proposed algorithm to four benchmark datasets: CEC 2009, CEC 2018, ZDT, and DTLZ. We measured the performance of MOBRO based on three aspects: convergence, spread, and distribution, using three performance criteria: inverted generational distance, maximum spread, and spacing. We also compared its obtained results with those of three state-of-the-art optimization algorithms: the multi-objective Gray Wolf optimization algorithm (MOGWO), the multi-objective particle swarm optimization algorithm (MOPSO), the multi-objective artificial vulture's optimization algorithm (MOAVAO), the optimization algorithm for multi-objective problems (MAOA), and the multi-objective non-dominated sorting genetic algorithm III (NSGA-III). The obtained results approve that MOBRO outperforms the existing optimization algorithms in most of the benchmark suites and operates competitively with them in the others.
Read moreMultifidelity Data Fusion Based on Gradient-Enhanced Surrogate Modeling Method
A multifidelity surrogate (MFS) model is a data fusion method for the enhanced prediction of less intensively sampled primary variables of interest (i.e., high-fidelity (HF) samples) with the assistance of intensively sampled auxiliary variables (i.e., low-fidelity (LF) samples). In this article, an MFS model based on the gradient-enhanced radial basis function, termed gradient-enhanced multifidelity surrogate based on the radial basis function (GEMFS-RBF), is proposed to establish a mapping relationship between HF and LF samples. To identify the scaling factor and the undetermined coefficients in GEMFS-RBF, an expanded correlation matrix is constructed by considering the correlations between the acquired samples, the correlations between the gradients, and the correlations between the samples and their corresponding gradients. To evaluate the prediction accuracy of the GEMFS-RBF model, it is compared with the co-Kriging model, multifidelity surrogate based on the radial basis function (MFS-RBF) model, and two single-fidelity surrogate models. The influences of key factors (i.e., the correlations between the HF and LF functions, the subordinations between the sample sets) and the effect of the cost ratio on the performance of GEMFS-RBF are also investigated. It is observed that GEMFS-RBF presents a more acceptable accuracy rate and is less sensitive to the aforementioned factors than the other benchmark models in most cases in this article, which illustrates the practicability and robustness of the proposed GEMFS-RBF model.
Read more