Search results

An improvement in the energy efficiency of wind turbines can be achieved using dual rotors. Because of complex flow physics, the design of dual-rotor wind turbines (DRWTs) requires repetitive evaluations of computationally expensive partial differential equation (PDE) simulation models. Approaches for solving design optimization of DRWTs constrained by PDE simulations are investigated. The purpose of this study is to determine design optimization algorithms which can find optimal designs at a low computational cost.

Several optimization approaches and algorithms are compared and contrasted for the design of DRWTs. More specifically, parametric sweeps, direct optimization using pattern search, surrogate-based optimization (SBO) using approximation-based models and SBO using kriging interpolation models with infill criteria are investigated for the DRWT design problem.

The approaches are applied to two example design cases where the DRWT fluid flow is simulated using the Reynolds-averaged Navier−Stokes (RANS) equations with a two-equation turbulence model on an axisymmetric computational grid. The main rotor geometry is kept fixed and the secondary rotor characteristics, using up to three variables, are optimized. The results show that the automated numerical optimization techniques were able to accurately find the optimal designs at a low cost. In particular, SBO algorithm with infill criteria configured for design space exploitation required the least computational cost. The widely adopted parametric sweep approach required more model evaluations than the optimization algorithms, as well as not being able to accurately find the optimal designs.

For low-dimensional PDE-constrained design of DRWTs, automated optimization algorithms are essential to find accurately and efficiently the optimal designs. More specifically, surrogate-based approaches seem to offer a computationally efficient way of solving such problems.

This paper aims to develop a new method of fuselage drag optimization that can obtain results faster than the conventional methods based on full computational fluid dynamics (CFD) calculations and can be used to improve the efficiency of preliminary design.

An efficient method for helicopter fuselage shape optimization based on surrogate-based optimization is presented. Two numerical simulation methods are applied in different stages of optimization according to their relative advantages. The fast panel method is used to calculate the sample data to save calculation time for a large number of sample points. The initial solution is obtained by combining the Kriging surrogate model and the multi-island genetic algorithm. Then, the accuracy of the solution is determined by using the infill criteria based on CFD corrections. A parametric model of the fuselage is established by several characteristic sections and guiding curves.

It is demonstrated that this method can greatly reduce the calculation time while ensuring a high accuracy in the XH-59A helicopter example. The drag coefficient of the optimized fuselage is reduced by 13.3%. Because of the use of different calculation methods for samples, this novel method reduces the total calculation time by almost fourfold compared with full CFD calculations.

To the best of the authors’ knowledge, this is the first study to provide a novel method of fuselage drag optimization by combining different numerical simulation methods. Some suggestions on fuselage shape optimization are given for the XH-59A example.

This paper aims to present a multi-fidelity surrogate-based optimization (MFSBO) method for computationally accurate and efficient design of microfluidic concentration gradient generators (µCGGs).

Cokriging-based multi-fidelity surrogate model (MFSM) is constructed to combine data with varying fidelities and computational costs to accelerate the optimization process and improve design accuracy. An adaptive sampling approach based on parallel infill of multiple low-fidelity (LF) samples without notably adding computation burden is developed. The proposed optimization framework is compared with a surrogate-based optimization (SBO) method that relies on data from a single source, and a conventional multi-fidelity adaptive sampling and optimization method in terms of the convergence rate and design accuracy.

The results demonstrate that proposed MFSBO method allows faster convergence and better designs than SBO for all case studies with 49% more reduction in the objective function value on average. It is also found that parallel infill (MFSBO-4) with four LF samples, enables more robust, efficient and accurate designs than conventional multi-fidelity infill (MFSBO-1) that only adopts one LF sample during each iteration for more complex optimization problems.

A MFSM based on cokriging method is constructed to utilize data with varying fidelities, accuracies and computational costs for µCGG design. A parallel infill strategy based on multiple infill criteria is developed to accelerate the convergence and improve the design accuracy of optimization. The proposed methodology is proved to be a feasible method for µCGG design and its computational efficiency is verified.

A technique for accelerated design optimization of antenna input characteristics is developed and comprehensively validated using real-world wideband antenna structures. Comparative study using a conventional trust-region algorithm is provided. Investigations of the effects of the algorithm control parameters are also carried out.

An optimization methodology is introduced that replaces finite differentiation (FD) by a combination of FD and selectively used Broyden updating formula for antenna response Jacobian estimations. The updating formula is used for directions that are sufficiently well aligned with the design relocation that occurred in the most recent algorithm iteration. This allows for a significant reduction of the number of full-wave electromagnetic simulations necessary for the algorithm to converge; hence, it leads to the reduction of the overall design cost.

Incorporation of the updating formulas into the Jacobian estimation process in a selective manner considerably reduces the computational cost of the optimization process without compromising the design quality. The algorithm proposed in the study can be used to speed up direct optimization of the antenna structures as well as surrogate-assisted procedures involving variable-fidelity models.

This study sets a direction for further studies on accelerating procedures for the local optimization of antenna structures. Further investigations on the effects of the control parameters on the algorithm performance are necessary along with the development of means to automate the algorithm setup for a particular antenna structure, especially from the point of view of the search space dimensionality.

The proposed algorithm proved useful for a reduced-cost optimization of antennas and has been demonstrated to outperform conventional algorithms. To the authors’ knowledge, this is one of the first attempts to address the problem in this manner. In particular, it goes beyond traditional approaches, especially by combining various sensitivity estimation update measures in an adaptive fashion.

The purpose of this paper is to reduce the overall computational time of aerodynamic shape optimization that involves accurate high-fidelity simulation models.

The proposed approach is based on the surrogate-based optimization paradigm. In particular, multi-fidelity surrogate models are used in the optimization process in place of the computationally expensive high-fidelity model. The multi-fidelity surrogate is constructed using physics-based low-fidelity models and a proper correction. This work introduces a novel correction methodology – referred to as the adaptive response prediction (ARP). The ARP technique corrects the low-fidelity model response, represented by the airfoil pressure distribution, through suitable horizontal and vertical adjustments.

Numerical investigations show the feasibility of solving real-world problems involving optimization of transonic airfoil shapes and accurate computational fluid dynamics simulation models of such surfaces. The results show that the proposed approach outperforms traditional surrogate-based approaches.

The proposed aerodynamic design optimization algorithm is novel and holistic. In particular, the ARP correction technique is original. The algorithm is useful for fast design of aerodynamic surfaces using high-fidelity simulation data in moderately sized search spaces, which is challenging using conventional methods because of excessive computational costs.

Dual-rotor wind turbines (DRWTs) are a novel type of wind turbines that can capture more power than their single-rotor counterparts. Because their surrounding flow fields are complex, evaluating a DRWT design requires accurate predictive simulations, which incur high computational costs. Currently, there does not exist a design optimization framework for DRWTs. Since the design optimization of DRWTs requires numerous model evaluations, the purpose of this paper is to identify computationally efficient design approaches.

Several algorithms are compared for the design optimization of DRWTs. The algorithms vary widely in approaches and include a direct derivative-free method, as well as three surrogate-based optimization methods, two approximation-based approaches and one variable-fidelity approach with coarse discretization low-fidelity models.

The proposed variable-fidelity method required significantly lower computational cost than the derivative-free and approximation-based methods. Large computational savings come from using the time-consuming high-fidelity simulations sparingly and performing the majority of the design space search using the fast variable-fidelity models.

Due the complex simulations and the large number of designable parameters, the design of DRWTs require the use of numerical optimization algorithms. This work presents a novel and efficient design optimization framework for DRWTs using computationally intensive simulations and variable-fidelity optimization techniques.

The purpose of this paper is to investigate the use of multidisciplinary optimization (MDO) formulations within space‐mapping techniques in order to reduce their computing time.

The aim of this work is to quantify the interest of using MDO formulations within space mapping techniques. A comparison of three MDO formulations is carried out in a short time by using an analytical model of a safety transformer. This comparison reveals the advantage of two formulations in terms of robustness and computing time among the three MDO formulations. Then, the best formulations are investigated within output space mapping, using both analytical and FE models of the transformer.

A major computing time gain equal to 5.5 is achieved using the Individual Disciplinary Feasibility formulation within the output space‐mapping technique in the case of the safety transformer.

The MultiDisciplinary Feasibility formulation is the common formulation used within space‐mapping technique because it is the most conventional way to perform MDO. The originality of this paper is to investigate the Individual Disciplinary Feasibility formulation within output space‐mapping technique in order to allow the parallelization of calculation and to achieve a major reduction of computing time.

The purpose of this study is to propose a framework for expedited antenna optimization with numerical derivatives involving gradient variation monitoring throughout the optimization run and demonstrate it using a benchmark set of real-world wideband antennas. A comprehensive analysis of the algorithm performance involving multiple starting points is provided. The optimization results are compared with a conventional trust-region (TR) procedure, as well as the state-of-the-art accelerated TR algorithms.

The proposed algorithm is a modification of the TR gradient-based algorithm with numerical derivatives in which a monitoring of changes of the system response gradients is performed throughout the algorithm run. The gradient variations between consecutive iterations are quantified by an appropriately developed metric. Upon detecting stable patterns for particular parameter sensitivities, the costly finite differentiation (FD)-based gradient updates are suppressed; hence, the overall number of full-wave electromagnetic (EM) simulations is significantly reduced. This leads to considerable computational savings without compromising the design quality.

Monitoring of the antenna response sensitivity variations during the optimization process enables to detect the parameters for which updating the gradient information is not necessary at every iteration. When incorporated into the TR gradient-search procedures, the approach permits reduction of the computational cost of the optimization process. The proposed technique is dedicated to expedite direct optimization of antenna structures, but it can also be applied to speed up surrogate-assisted tasks, especially solving sub-problems that involve performing numerous evaluations of coarse-discretization models.

The introduced methodology opens up new possibilities for future developments of accelerated antenna optimization procedures. In particular, the presented routine can be combined with the previously reported techniques that involve replacing FD with the Broyden formula for directions that are satisfactorily well aligned with the most recent design relocation and/or performing FD in a sparse manner based on relative design relocation (with respect to the current search region) in consecutive algorithm iterations.

Benchmarking against a conventional TR procedure, as well as previously reported methods, confirms improved efficiency and reliability of the proposed approach. The applications of the framework include direct EM-driven design closure, along with surrogate-based optimization within variable-fidelity surrogate-assisted procedures. To the best of the authors’ knowledge, no comparable approach to antenna optimization has been reported elsewhere. Particularly, it surmounts established methodology by carrying out constant supervision of the antenna response gradient throughout successive algorithm iterations and using gathered observations to properly guide the optimization routine.

The purpose of this paper is to exploit a database of pre-existing designs to accelerate parametric optimization of antenna structures is investigated.

The usefulness of pre-existing designs for rapid design of antennas is investigated. The proposed approach exploits the database existing antenna base designs to determine a good starting point for structure optimization and its response sensitivities. The considered method is suitable for handling computationally expensive models, which are evaluated using full-wave electromagnetic (EM) simulations. Numerical case studies are provided demonstrating the feasibility of the framework for the design of real-world structures.

The use of pre-existing designs enables rapid identification of a good starting point for antenna optimization and speeds-up estimation of the structure response sensitivities. The base designs can be arranged into subsets (simplexes) in the objective space and used to represent the target vector, i.e. the starting point for structure design. The base closest base point w.r.t. the initial design can be used to initialize Jacobian for local optimization. Moreover, local optimization costs can be reduced through the use of Broyden formula for Jacobian updates in consecutive iterations.

The study investigates the possibility of reusing pre-existing designs for the acceleration of antenna optimization. The proposed technique enables the identification of a good starting point and reduces the number of expensive EM simulations required to obtain the final design.

The proposed design framework proved to be useful for the identification of good initial design and rapid optimization of modern antennas. Identification of the starting point for the design of such structures is extremely challenging when using conventional methods involving parametric studies or repetitive local optimizations. The presented methodology proved to be a useful design and geometry scaling tool when previously obtained designs are available for the same antenna structure.

Manifold‐mapping (MM) is an efficient surrogate‐based optimization technique aimed at the acceleration of very time‐consuming design problems. In this paper we present two new variants of the original algorithm that make it applicable to a broader range of optimization scenarios.

The first variant is useful when the optimization constraints are expressed by means of functions that are very expensive to compute. The second variant endows the original scheme with a trust‐region strategy and the result is a much more robust algorithm.

Two practical optimization problems from electromagnetics eventually show that the proposed variants perform efficiently.

The original MM algorithm is extended with two new variants. Therefore, the MM approach is applicable to a much larger set of design situations.