Search results

The purpose of this work is to apply and compare surrogate-assisted and multi-fidelity, multi-objective optimization (MOO) algorithms to simulation-based aerodynamic design exploration.

The three algorithms for multi-objective aerodynamic optimization compared in this work are the combination of evolutionary algorithms, design space reduction and surrogate models, the multi-fidelity point-by-point Pareto set identification and the multi-fidelity sequential domain patching (SDP) Pareto set identification. The algorithms are applied to three cases, namely, an analytical test case, the design of transonic airfoil shapes and the design of subsonic wing shapes, and are evaluated based on the resulting best possible trade-offs and the computational overhead.

The results show that all three algorithms yield comparable best possible trade-offs for all the test cases. For the aerodynamic test cases, the multi-fidelity Pareto set identification algorithms outperform the surrogate-assisted evolutionary algorithm by up to 50 per cent in terms of cost. Furthermore, the point-by-point algorithm is around 27 per cent more efficient than the SDP algorithm.

The novelty of this work includes the first applications of the SDP algorithm to multi-fidelity aerodynamic design exploration, the first comparison of these multi-fidelity MOO algorithms and new results of a complex simulation-based multi-objective aerodynamic design of subsonic wing shapes involving two conflicting criteria, several nonlinear constraints and over ten design variables.

In recent decades, development of effective methods for optimizing a set of conflicted objective functions has been absorbing an increasing interest from researchers. This refers to the essence of real-life engineering systems and complex natural mechanisms which are generally multi-modal, non-convex and multi-criterion. Until now, several deterministic and stochastic methods have been proposed to cope with such complex systems. Advanced soft computational methods such as evolutionary games (cooperative and non-cooperative), Pareto-based techniques, fuzzy evolutionary methods, cooperative bio-inspired algorithms and neuro-evolutionary systems have effectively come to the aid of researchers to build up efficient paradigms with application to vector optimization. The paper aims to discuss this issue.

A novel hybrid algorithm called synchronous self-learning Pareto strategy (SSLPS) is presented for the sake of vector optimization. The method is the ensemble of evolutionary algorithms (EA), swarm intelligence (SI), adaptive version of self-organizing map (CSOM) and a data shuffling mechanism. EA are powerful numerical optimization algorithms capable of finding a global extreme point over a wide exploration domain. SI techniques (the swarm of bees in our case) can improve both intensification and robustness of exploration. CSOM network is an unsupervised learning methodology which learns the characteristics of non-dominated solutions and, thus, enhances the quality of the Pareto front.

To prove the effectiveness of the proposed method, the authors engage a set of well-known benchmark functions and some well-known rival optimization methods. Additionally, SSLPS is employed for optimal design of shape memory alloy actuator as a nonlinear multi-modal real-world engineering problem. The experiments show the acceptable potential of SSLPS for handling both numerical and engineering multi-objective problems.

To the author’s best knowledge, the proposed algorithm is among the rare multi-objective methods which fosters the use of automated unsupervised learning for increasing the intensity of Pareto front (while preserving the diversity). Also, the research evaluates the power of hybridization of SI and EA for efficient search.

This paper aims to investigates several design strategies to solve multi-objective aerodynamic optimization problems using high-fidelity simulations. The purpose is to find strategies which reduce the overall optimization time while still maintaining accuracy at the high-fidelity level.

Design strategies are proposed that use an algorithmic framework composed of search space reduction, fast surrogate models constructed using a combination of physics-based surrogates and kriging and global refinement of the Pareto front with co-kriging. The strategies either search the full or reduced design space with a low-fidelity model or a physics-based surrogate.

Numerical investigations of airfoil shapes in two-dimensional transonic flow are used to characterize and compare the strategies. The results show that searching a reduced design space produces the same Pareto front as when searching the full space. Moreover, as the reduced space is two orders of magnitude smaller (volume-wise), the number of required samples to setup the surrogates can be reduced by an order of magnitude. Consequently, the computational time is reduced from over three days to less than half a day.

The proposed design strategies are novel and holistic. The strategies render multi-objective design of aerodynamic surfaces using high-fidelity simulation data in moderately sized search spaces computationally tractable.

Multi-objective is a complex problem that appears in real life while these objectives are conflicting. The swarm intelligence algorithm is often used to solve such multi-objective problems. Due to its strong search ability and convergence ability, particle swarm optimization algorithm is proposed, and the multi-objective particle swarm optimization algorithm is used to solve multi-objective optimization problems. However, the particles of particle swarm optimization algorithm are easy to fall into local optimization because of their fast convergence. Uneven distribution and poor diversity are the two key drawbacks of the Pareto front of multi-objective particle swarm optimization algorithm. Therefore, this paper aims to propose an improved multi-objective particle swarm optimization algorithm using adaptive Cauchy mutation and improved crowding distance.

In this paper, the proposed algorithm uses adaptive Cauchy mutation and improved crowding distance to perturb the particles in the population in a dynamic way in order to help the particles trapped in the local optimization jump out of it which improves the convergence performance consequently.

In order to solve the problems of uneven distribution and poor diversity in the Pareto front of multi-objective particle swarm optimization algorithm, this paper uses adaptive Cauchy mutation and improved crowding distance to help the particles trapped in the local optimization jump out of the local optimization. Experimental results show that the proposed algorithm has obvious advantages in convergence performance for nine benchmark functions compared with other multi-objective optimization algorithms.

In order to help the particles trapped in the local optimization jump out of the local optimization which improves the convergence performance consequently, this paper proposes an improved multi-objective particle swarm optimization algorithm using adaptive Cauchy mutation and improved crowding distance.

This paper aims to investigate deterministic strategies for low-cost multi-objective design optimization of compact microwave structures, specifically, impedance matching transformers. The considered methods involve surrogate modeling techniques and variable-fidelity electromagnetic (EM) simulations. In contrary to majority of conventional approaches, they do not rely on population-based metaheuristics, which permit lowering the design cost and improve reliability.

There are two algorithmic frameworks presented, both fully deterministic. The first algorithm involves creating a path covering the Pareto front and arranged as a sequence of patches relocated in the course of optimization. Response correction techniques are used to find the Pareto front representation at the high-fidelity EM simulation level. The second algorithm exploits Pareto front exploration where subsequent Pareto-optimal designs are obtained by moving along the front by means of solving appropriately defined local constrained optimization problems. Numerical case studies are provided demonstrating feasibility of solving real-world problems involving expensive EM-simulation models of impedance transformer structures.

It is possible, by means of combining surrogate modeling techniques and constrained local optimization, to identify the set of alternative designs representing Pareto-optimal solutions, in a realistic time frame corresponding to a few dozen of high-fidelity EM simulations of the respective structures. Multi-objective optimization for the considered class of structures can be realized using deterministic approaches without defaulting to evolutionary methods.

The present study can be considered a step toward further studies on expedited optimization of computationally expensive simulation models for miniaturized microwave components.

The proposed algorithmic solutions proved useful for expedited multi-objective design optimization of miniaturized microwave structures. The problem is extremely challenging when using conventional methods, in particular evolutionary algorithms. To the authors’ knowledge, this is one of the first attempts to investigate deterministic surrogate-assisted multi-objective optimization of compact components at the EM-simulation level.

The purpose of this paper is to study the use of outsourcing as a mechanism to cope with supply chain uncertainty, more specifically, how to deal with sudden arrival of higher priority jobs that require immediate processing, in an in-house manufacturer's facility from the perspective of outsourcing. An operational level schedule of production and distribution of outsourced jobs to the manufacturer's facility should be determined for the subcontractor in order to achieve overall optimality.

The problem is of bi-criteria in that both the transportation cost measured by number of delivery vehicles and schedule performance measured by jobs’ delivery times. In order to obtain the problem's Pareto front, we propose dynamic programming (DP) heuristic solution procedure based on integrated decision making, and population-heuristic solution procedures using different encoding schemes based on sequential decision making. Computational studies are designed and carried out by randomly generating comparative variations of numerical problem instances.

By comparing several existing performance metrics for the obtained Pareto fronts, it is found that DP heuristic outperforms population-heuristic in both solutions diversity and proximity to optimal Pareto front. Also in population-heuristic, sub-range keys representation appears to be a better encoding scheme for the problem than random keys representation.

This study contributes to the limited yet important knowledge body on using outsourcing approach to coping with possible supply chain disruptions in production scheduling due to sudden customer orders. More specifically, we used modeling methodology to confirm the importance of collaboration with subcontractors to effective supply chain risk management.

The purpose of this paper is to investigate the strategies and algorithms for expedited design optimization of microwave and antenna structures in multi-objective setup.

Formulation of the multi-objective design problem-oriented toward execution of the population-based metaheuristic algorithm within the segmented search space is investigated. Described algorithmic framework exploits variable fidelity modeling, physics- and approximation-based representation of the structure and model correction techniques. The considered approach is suitable for handling various problems pertinent to the design of microwave and antenna structures. Numerical case studies are provided demonstrating the feasibility of the segmentation-based framework for the design of real-world structures in setups with two and three objectives.

Formulation of appropriate design problem enables identification of the search space region containing Pareto front, which can be further divided into a set of compartments characterized by small combined volume. Approximation model of each segment can be constructed using a small number of training samples and then optimized, at a negligible computational cost, using population-based metaheuristics. Introduction of segmentation mechanism to multi-objective design framework is important to facilitate low-cost optimization of many-parameter structures represented by numerically expensive computational models. Further reduction of the design cost can be achieved by enforcing equal-volumes of the search space segments.

The study summarizes recent advances in low-cost multi-objective design of microwave and antenna structures. The investigated techniques exceed capabilities of conventional design approaches involving direct evaluation of physics-based models for determination of trade-offs between the design objectives, particularly in terms of reliability and reduction of the computational cost. Studies on the scalability of segmentation mechanism indicate that computational benefits of the approach decrease with the number of search space segments.

The proposed design framework proved useful for the rapid multi-objective design of microwave and antenna structures characterized by complex and multi-parameter topologies, which is extremely challenging when using conventional methods driven by population-based metaheuristics algorithms. To the authors knowledge, this is the first work that summarizes segmentation-based approaches to multi-objective optimization of microwave and antenna components.

The purpose of this paper is to present a modified version of the non-dominated sorted genetic algorithm with an application in the design optimization of a power inductor for magneto-fluid hyperthermia (MFH).

The proposed evolutionary algorithm is a modified version of migration-non-dominated sorting genetic algorithms (M-NSGA) that now includes the self-adaption of migration events- non-dominated sorting genetic algorithms (SA-M-NSGA). Moreover, a criterion based on the evolution of the approximated Pareto front has been activated for the automatic stop of the computation. Numerical experiments have been based on both an analytical benchmark and a real-life case study; the latter, which deals with the design of a class of power inductors for tests of MFH, is characterized by finite element analysis of the magnetic field.

The SA-M-NSGA substantially varies the genetic heritage of the population during the optimization process and allows for a faster convergence.

The proposed SA-M-NSGA is able to find a wider Pareto front with a computational effort comparable to a standard NSGA-II implementation.

Strategies for accelerated multi-objective optimization of aerodynamic surfaces are investigated, including the possibility of exploiting surrogate modeling techniques for computational fluid dynamic (CFD)-driven design speedup of such surfaces. The purpose of this paper is to reduce the overall optimization time.

An algorithmic framework is described that is composed of: a search space reduction, fast surrogate models constructed using variable-fidelity CFD models and co-Kriging, and Pareto front refinement. Numerical case studies are provided demonstrating the feasibility of solving real-world problems involving multi-objective optimization of transonic airfoil shapes and accurate CFD simulation models of such surfaces.

It is possible, through appropriate combination of surrogate modeling techniques and variable-fidelity models, to identify a set of alternative designs representing the best possible trade-offs between conflicting design objectives in a realistic time frame corresponding to a few dozen of high-fidelity CFD simulations of the respective surfaces.

The proposed aerodynamic design optimization algorithmic framework is novel and holistic. It proved useful for fast design of aerodynamic surfaces using high-fidelity simulation data in moderately sized search space, which is extremely challenging when using conventional methods due to the excessive computational cost.

One of the main components of multi-objective, and therefore, many-objective evolutionary algorithms, is the selection mechanism. It is responsible for performing two main tasks simultaneously. First, it has to promote convergence by selecting solutions which are as close as possible to the Pareto optimal set. And second, it has to promote diversity in the solution set provided. In the current work, an exhaustive study that involves the comparison of several selection mechanisms with different features is performed. Particularly, Pareto-based and indicator-based selection schemes, which belong to well-known multi-objective optimisers, are considered. The paper aims to discuss these issues.

Each of those mechanisms is incorporated into a common multi-objective evolutionary algorithm framework. The main goal of the study is to measure the diversity preserved by each of those selection methods when addressing many-objective optimisation problems. The Walking Fish Group test suite, a set of optimisation problems with a scalable number of objective functions, is taken into account to perform the experimental evaluation.

The computational results highlight that the the reference-point-based selection scheme of the Non-dominated Sorting Genetic Algorithm III and a modified version of the Non-dominated Sorting Genetic Algorithm II, where the crowding distance is replaced by the Euclidean distance, are able to provide the best performance, not only in terms of diversity preservation, but also in terms of convergence.

The performance provided by the use of the Euclidean distance as part of the selection scheme indicates this is a promising line of research and, to the best of the knowledge, it has not been investigated yet.