State-of-the-art in aerodynamic shape optimisation methods

Aerodynamic optimisation has become an indispensable component for any aerodynamic design over the past 60 years, with applications to aircraft, cars, trains, bridges, wind turbines, internal pipe flows, and cavities, among others, and is thus relevant in many facets of technology. With advancements in computational power, automated design optimisation procedures have become more competent, however, there is an ambiguity and bias throughout the literature with regards to relative performance of optimisation architectures and employed algorithms. This paper provides a well-balanced critical review of the dominant optimisation approaches that have been integrated with aerodynamic theory for the purpose of shape optimisation. A total of 229 papers, published in more than 120 journals and conference proceedings, have been classified into 6 different optimisation algorithm approaches. The material cited includes some of the most well-established authors and publications in the field of aerodynamic optimisation. This paper aims to eliminate bias toward certain algorithms by analysing the limitations, drawbacks, and the benefits of the most utilised optimisation approaches. This review provides comprehensive but straightforward insight for non-specialists and reference detailing the current state for specialist practitioners

Efficient polar optimization of transport aircraft in transonic RANS flow using adjoint gradient based approach

A major design requirement for transport aircraft is efficient cruise flight in the transonic region. From the aerodynamic viewpoint, this is achieved by favorable lift-to-drag ratio of the aircraft, both at the main design point and at off-design conditions. We therefore present a method to efficiently perform a multi-point optimization of a representative wing-body configuration. Designs are evaluated with RANS CFD simulations, the wing is parametrized using 40 free-form deformation control points, and a gradient-based method is used to drive the optimization. The gradient of cost functions is computed with a discrete adjoint approach, in which flow and mesh adjoint equations are solved. Compared to single-point optimization, with multi-point optimization we obtain a design with slightly lower best lift-to-drag ratio, but which has improved lift-to-drag polar over the whole range of practical lift coefficients compared to the baseline design

Hybrid Intelligent Optimization Methods for Engineering Problems

The purpose of optimization is to obtain the best solution under certain conditions. There are numerous optimization methods because different problems need different solution methodologies; therefore, it is difficult to construct patterns. Also mathematical modeling of a natural phenomenon is almost based on differentials. Differential equations are constructed with relative increments among the factors related to yield. Therefore, the gradients of these increments are essential to search the yield space. However, the landscape of yield is not a simple one and mostly multi-modal. Another issue is differentiability. Engineering design problems are usually nonlinear and they sometimes exhibit discontinuous derivatives for the objective and constraint functions. Due to these difficulties, non-gradient-based algorithms have become more popular in recent decades. Genetic algorithms (GA) and particle swarm optimization (PSO) algorithms are popular, non-gradient based algorithms. Both are population-based search algorithms and have multiple points for initiation. A significant difference from a gradient-based method is the nature of the search methodologies. For example, randomness is essential for the search in GA or PSO. Hence, they are also called stochastic optimization methods. These algorithms are simple, robust, and have high fidelity. However, they suffer from similar defects, such as, premature convergence, less accuracy, or large computational time. The premature convergence is sometimes inevitable due to the lack of diversity. As the generations of particles or individuals in the population evolve, they may lose their diversity and become similar to each other. To overcome this issue, we studied the diversity concept in GA and PSO algorithms. Diversity is essential for a healthy search, and mutations are the basic operators to provide the necessary variety within a population. After having a close scrutiny of the diversity concept based on qualification and quantification studies, we improved new mutation strategies and operators to provide beneficial diversity within the population. We called this new approach as multi-frequency vibrational GA or PSO. They were applied to different aeronautical engineering problems in order to study the efficiency of these new approaches. These implementations were: applications to selected benchmark test functions, inverse design of two-dimensional (2D) airfoil in subsonic flow, optimization of 2D airfoil in transonic flow, path planning problems of autonomous unmanned aerial vehicle (UAV) over a 3D terrain environment, 3D radar cross section minimization problem for a 3D air vehicle, and active flow control over a 2D airfoil. As demonstrated by these test cases, we observed that new algorithms outperform the current popular algorithms. The principal role of this multi-frequency approach was to determine which individuals or particles should be mutated, when they should be mutated, and which ones should be merged into the population. The new mutation operators, when combined with a mutation strategy and an artificial intelligent method, such as, neural networks or fuzzy logic process, they provided local and global diversities during the reproduction phases of the generations. Additionally, the new approach also introduced random and controlled diversity. Due to still being population-based techniques, these methods were as robust as the plain GA or PSO algorithms. Based on the results obtained, it was concluded that the variants of the present multi-frequency vibrational GA and PSO were efficient algorithms, since they successfully avoided all local optima within relatively short optimization cycles

Enhancing optimization capabilities using the AGILE collaborative MDO framework with application to wing and nacelle design

This paper presents methodological investigations performed in research activities in the field of Multi-disciplinary Design and Optimization (MDO) for overall aircraft design in the EU funded research project AGILE (2015–2018). In the AGILE project a team of 19 industrial, research and academic partners from Europe, Canada and Russia are working together to develop the next generation of MDO environment that targets significant reductions in aircraft development costs and time to market, leading to cheaper and greener aircraft. The paper introduces the AGILE project structure and describes the achievements of the 1st year that led to a reference distributed MDO system. A focus is then made on different novel optimization techniques studied during the 2nd year, all aiming at easing the optimization of complex workflows that are characterized by a high number of discipline interdependencies and a large number of design variables in the context of multi-level processes and multi-partner collaborative engineering projects. Three optimization strategies are introduced and validated for a conventional aircraft. First, a multi-objective technique based on Nash Games and Genetic Algorithm is used on a wing design problem. Then a zoom is made on the nacelle design where a surrogate-based optimizer is used to solve a mono-objective problem. Finally a robust approach is adopted to study the effects of uncertainty in parameters on the nacelle design process. These new capabilities have been integrated in the AGILE collaborative framework that in the future will be used to study and optimize novel unconventional aircraft configurations

Strategies for Solving High-Fidelity Aerodynamic Shape Optimization Problems

Peer Reviewedhttps://deepblue.lib.umich.edu/bitstream/2027.42/140440/1/6.2014-2594.pd

A survey on handling computationally expensive multiobjective optimization problems with evolutionary algorithms

This is the author accepted manuscript. The final version is available from Springer Verlag via the DOI in this record.Evolutionary algorithms are widely used for solving multiobjective optimization problems but are often criticized because of a large number of function evaluations needed. Approximations, especially function approximations, also referred to as surrogates or metamodels are commonly used in the literature to reduce the computation time. This paper presents a survey of 45 different recent algorithms proposed in the literature between 2008 and 2016 to handle computationally expensive multiobjective optimization problems. Several algorithms are discussed based on what kind of an approximation such as problem, function or fitness approximation they use. Most emphasis is given to function approximation-based algorithms. We also compare these algorithms based on different criteria such as metamodeling technique and evolutionary algorithm used, type and dimensions of the problem solved, handling constraints, training time and the type of evolution control. Furthermore, we identify and discuss some promising elements and major issues among algorithms in the literature related to using an approximation and numerical settings used. In addition, we discuss selecting an algorithm to solve a given computationally expensive multiobjective optimization problem based on the dimensions in both objective and decision spaces and the computation budget available.The research of Tinkle Chugh was funded by the COMAS Doctoral Program (at the University of Jyväskylä) and FiDiPro Project DeCoMo (funded by Tekes, the Finnish Funding Agency for Innovation), and the research of Dr. Karthik Sindhya was funded by SIMPRO project funded by Tekes as well as DeCoMo