Aerodynamic aircraft design for mission performance by multipoint optimization

In this study, we transform an optimization problem into a game problem by multiple decision makers. This transformation is called gamification of the optimization problem. Then, we discuss correspondence of the dynamics to search the rational solution of the game problem with the multi-point type optimization method to search the optimal solution of the original problem. Specifically, we propose a condition to compose objective functions of multiple decision makers who interfere with each other from the objective function of the original problem so that equivalence of the Nash equilibrium solution of the game problem to the optimal solution of the original problem is guaranteed. Then, correspondence of the gradient dynamics to solve the game problem with the multi-point type optimization method is discussed. We also show some numerical examples in order to explain the gamification of the optimization problem.

This paper presents the fundamentals of a continuous adjoint method and the applications of this method to the aerodynamic design optimization of both external and internal flows. General formulation of the continuous adjoint equations and the corresponding boundary conditions are derived. With the adjoint method, the complete gradient information needed in the design optimization can be obtained by solving the governing flow equations and the corresponding adjoint equations only once for each cost function, regardless of the number of design parameters. An inverse design of airfoil is firstly performed to study the accuracy of the adjoint gradient and the effectiveness of the adjoint method as an inverse design method. Then the method is used to perform a series of single and multiple point design optimization problems involving the drag reduction of airfoil, wing, and wing-body configuration, and the aerodynamic performance improvement of turbine and compressor blade rows. The results demonstrate that the continuous adjoint method can efficiently and significantly improve the aerodynamic performance of the design in a shape optimization problem.

In this study, we propose a new global optimization method in which the simultaneous perturbation gradient approximation is introduced into a multi-point type chaotic optimization method. The multi-point type chaotic optimization method, which has been proposed recently, is a global optimization method to solve unconstrained optimization problems in which multiple search points which implement global search driven by a chaotic gradient dynamic model are synchronized to their elite search points. The chaotic optimization method uses gradient as a driving force for search points. Hence, its application is confined to a class of problems in which gradient of the objective function can be computed. In this study, we introduce the simultaneous perturbation gradient approximation into the multi-point type chaotic optimization method in order to compute gradient approximately so that the chaotic optimization method can be applied to a class of problems whose objective function values only can be computed. Then, we confirm effectiveness of the proposed method through applications to several unconstrained multi-peaked optimization problems with 100 variables comparing to other major meta-heuristics.

In actual flight, aircraft rarely operate under a single design condition; multiple flight states must be considered to meet performance requirements. With the push for green and low-carbon aviation, there is growing demand for high-performance, fuel-efficient aircraft. This study focuses on the Blended Wing Body (BWB) configuration. To address large-scale design variables and multiple constraints, a discrete adjoint-based aerodynamic optimization method is developed, improving computational efficiency and reducing cost.The optimization results show reduced drag coefficients across various flight conditions and enhanced drag divergence performance. The robustness of the multi-point optimization approach is validated, confirming its ability to improve aircraft performance across different states. The proposed method is practical and provides an effective reference for aerodynamic design of BWB aircraft.

In the aerodynamic shape design, the drag prediction has always been an extremely challenging mission for the exploration of a configuration. As for the more complex configurations, it is especially desired to the availability of a highly accurate and reliable aerodynamic numerical solution. For improving the drag prediction accuracy and promoting the aerodynamic shape designs, firstly, the characteristics of drag prediction based on far-field drag method and near-field drag method is analyzed and compared. Also, the merits and demerits of defining axial velocity defect with the current main far-field drag prediction approaches is summarized, which promotes the building of the improved method of axial velocity defect and the improved far-field drag prediction and decomposition approach. Moreover, during the establishment of the drag decomposition method, it is necessary to judge and decide on the selection of the drag region. Therefore, the discussions on the sensitivity of the relevant parameters are fulfilled. Furthermore, based on the far-field drag prediction and decomposition method constructed, the aerodynamic performance research of Common Research Model wing-body configuration is launched. The results show that it can effectively observe and analyze the changes in drag components, their impact on the total drag and the contribution percentage. Finally, combining the far-field drag prediction and decomposition method proposed in this paper with a gradient-based aerodynamic shape optimization design system, the aerodynamic shape optimization designs are studied with CRM wing-body configuration. The results can not only directly analyze the detailed change of the visualized drag region, but also can obtain the more accurate total drag and lift-to-drag ratio of the optimized configuration by removing the spurious drag.

With the increasing design dimensionality, it is more difficult to solve multidisciplinary design optimization (MDO) problems. Many MDO decomposition strategies have been developed to reduce the dimensionality. Those strategies consider the design problem as a black-box function. However, practitioners usually have certain knowledge of their problem. In this paper, a method leveraging causal graph and qualitative analysis is developed to reduce the dimensionality of the MDO problem by systematically modeling and incorporating the knowledge about the design problem into optimization. Causal graph is created to show the input–output relationships between variables. A qualitative analysis algorithm using design structure matrix (DSM) is developed to automatically find the variables whose values can be determined without resorting to optimization. According to the impact of variables, an MDO problem is divided into two subproblems, the optimization problem with respect to the most important variables, and the other with variables of lower importance. The novel method is used to solve a power converter design problem and an aircraft concept design problem, and the results show that by incorporating knowledge in form of causal relationship, the optimization efficiency is significantly improved.

Optimizing time-varying performance and mission aborting policy in resource constrained missions

Distributed control and constraint preconditioners

This paper presents the discussion and comparison of the different optimization strategies and their associated evolutionary tools for the multi-point design optimization of a multi-element airfoil system during landing and taking off operations of an aircraft. New optimization algorithms based on binary coded genetic algorithms (GAs) coupling with game theory, such as Nash GAs (N-GAs) and Stackelberg GAs (S-GAs), are introduced and implemented to optimize the position of slat and flap of a high lift system operating simultaneous at taking off and landing conditions. A cheap nondifferentiable CFD solver coupling an inviscid panel approach with laminar or turbulent boundary layers and wake is used to solve the flow field around this system. Numerical results are compared with different strategies which demonstrates the flexible capability and robustness of such algorithms for multi-objective and multidisciplinary optimization problems in aerodynamics.

The process of regression testing is generally done under critical time and resource constraints. In the existing approaches, Test Case Prioritization (TCP), Test Case Selection (TCS), and Test Suite Reduction (TSR) have been treated as different optimization problems. This is based on simple heuristics that do not use valuable information that can be extracted from the program under test. Moreover, they do not allow for making internally consistent budget-conscious decisions. This paper introduces a unified approach that combines various variants of Graph Neural Networks (GNNs) and Reinforcement Learning (RL) for the solutions of TCP, TCS, and TSR. In our proposal, the representation of regression artifacts such as test cases, code entities, and faults is used as nodes in the typed graph, while the edges are used to show the relations between these artifacts. The relation-aware GNN is used for generating test case embeddings, reflecting the distance between the test cases and the changed areas as well as the areas known to have issues in the past. The actor-critic RL agent uses these test case embeddings and the budget to decide whether to run, skip, or discard test cases. The performance of our proposal outstrips coverage-based heuristics, history-based ranking, a GA-based search, an enhanced QPSO, and two learning-based ablations, as validated by our experiments on four Java projects from Defects4J. In terms of various programs and budgets, using GNN–RL has led to an improvement in the Average Percentage of Faults Detected (APFD) and Cost-cognizant Average Percentage of Faults Detected (APFDc) by approximately 6–9 percentage points on lower budgets. In addition, it is possible to obtain a 42% suite reduction and a 48% cost reduction while still retaining 98% of all fault-revealing tests in the final suite. The results show that it is possible to obtain promising solutions for adaptive regression testing using budget-aware reinforcement learning and graph-based representation learning.

MOGBO: A new Multiobjective Gradient-Based Optimizer for real-world structural optimization problems

Metaheuristics for optimization problems in computer communications

This thesis proposes a new parallel computing network--a binary relation inference network. The network topology is set up to match conventional optimization procedures. The network transforms some optimization problems (shortest path, transitive closure, assignment, etc.) into network convergence problems and divides the work load evenly among all processors. Link weights are known. It can operate in synchronous discrete-time, asynchronous discrete-time, and continuous-time domains. Inference network algorithms are derived directly from problem formulation, and are effective for a large range of problem sizes. The inference network consists of interconnected components; each component is composed of a unit, a number of sites attached to the unit, and links from the unit to sites on other units. Each unit is a simple computational engine. The topology of the inference network matches naturally to many optimization problems, since its deduction sites produce candidates to compete for the optimum and its decision-making units select the optimum from the site values. Either directly or through a transformation mapping to a systolic structure, discrete inference network algorithms can be implemented on a commercially available parallel processing facility, such as the Connection Machine. Analog inference network can be built using integrated circuits which solve problems efficiently in the continuous-time domain. In this thesis, mathematical analysis and numerical simulation were conducted for the synchronous, asynchronous, and analog inference network. Various applications has been discussed. The inference network has shown to solve the all-pair shortest path problem efficiently in various updating schemes. The inference network algorithm for the transitive closure problem parts derived straightforwardly from the formulation of the problem and the topology of the inference network. Efficient continuous-time solution was obtained from a non-synchronized logical circuit. The convergence of the network for the shortest path or transitive closure problems was shown to be independent of the problem size. It was demonstrated that the inference network can solve the assignment problem in a way similar to the Hopfield net's solution to the traveling salesman problem. However, the former was shown to converge for all test cases with problem size up to 128. (Abstract shortened by UMI.)

Full-wave electromagnetic (EM) simulation models are ubiquitous in carrying out design closure of antenna structures. Yet, EM-based design is expensive due to a large number of analyses necessary to yield an optimized design. Computational savings can be achieved using, for example, adjoint sensitivities, surrogate-assisted procedures, design space dimensionality reduction, or similar sophisticated means. In this article, a simple modification of a rudimentary trust-region-embedded gradient search with numerical derivatives is proposed for reduced-cost optimization of input characteristics of wideband antennas. The approach exploits information and history of relative changes of the design (as compared with the trust region size) during algorithm iterations to control the updates of components of the antenna response Jacobian, specifically, to execute them only if necessary. It is demonstrated that the proposed framework may lead to over 50% savings over the reference algorithm with only minor degradation of the design quality, specifically, up to 0.3 dB (or <3%). Numerical results are supported by experimental validation of the optimized antenna designs. The presented algorithm can be utilized as a stand-alone optimization routine or as a building block of surrogate-assisted procedures.

Various software engineering paradigms and real-time projects have proved that software testing is the most critical and highly important phase in the SDLC. In general, software testing takes approximately 40–60% of the total effort and time involved in project development. Generating test cases is the most important process in software testing. There are many techniques involved in the automatic generation of these test cases which aim to find a smaller group of cases that could allow for an adequacy level to be achieved which will hence reduce the effort and cost involved in software testing. In the structural testing of a product, the auto-generation of test cases that are path focused in an efficient manner is a challenging process. These are often considered optimization problems and hence search-based methods such as genetic algorithm (GA) and swarm optimizations have been proposed to handle this issue. The significance of the study is to address the optimization problem of automatic test case generation in search-based software engineering. The proposed methodology aims to close the gap of genetic algorithms acquiring local minimum due to poor diversity. Here, dynamic adjustment of cross-over and mutation rate is achieved by calculating the individual measure of similarity and fitness and searching for the more global optimum. The proposed method is applied and experimented on a benchmark of five industrial projects. The results of the experiments have confirmed the efficiency of generating test cases that have optimum path coverage.