Search results

Variable-fidelity optimization (VFO) frameworks generally aim at taking full advantage of high-fidelity (HF) and low-fidelity (LF) models to solve computationally expensive problems. The purpose of this paper is to develop a novel modified trust-region assisted variable-fidelity optimization (MTR-VFO) framework that can improve the optimization efficiency for computationally expensive engineering design problems.

Though the LF model is rough and inaccurate, it probably contains the gradient information and trend of the computationally expensive HF model. In the proposed framework, the extreme locations of the LF kriging model are firstly utilized to enhance the HF kriging model, and then a modified trust-region (MTR) method is presented for efficient local search. The proposed MTR-VFO framework is verified through comparison with three typical methods on some benchmark problems, and it is also applied to optimize the configuration of underwater tandem wings.

The results indicate that the proposed MTR-VFO framework is more effective than some existing typical methods and it has the potential of solving computationally expensive problems more efficiently.

The extreme locations of LF models are utilized to improve the accuracy of HF models and a MTR method is first proposed for local search without utilizing HF gradient. Besides, a novel MTR-VFO framework is presented which is verified to be more effective than some existing typical methods and shows great potential of solving computationally expensive problems effectively.

Strategies for accelerated multi-objective optimization of compact microwave and RF structures are investigated, including the possibility of exploiting surrogate modeling techniques for electromagnetic (EM)-driven design speedup for such components. The paper aims to discuss these issues.

Two algorithmic frameworks are described that are based on fast response surface approximation models, structure decomposition, and Pareto front refinement. Numerical case studies are provided demonstrating feasibility of solving real-world problems involving multi-objective optimization of miniaturized microwave passives and expensive EM-simulation models of such structures.

It is possible, through appropriate combination of the surrogate modeling techniques and response correction methods, to identify the 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 EM simulations of the respective structures.

The present study sets a direction for further studied on expedited optimization of computationally expensive simulation models for miniaturized microwave components.

The proposed algorithmic framework proved useful for fast design of microwave structures, which is extremely challenging when using conventional methods. To the authors’ knowledge, this is one of the first attempts to surrogate-assisted multi-objective optimization of compact components at the EM-simulation level.

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 propose and analyze the use of local surrogate models to improve differential evolution’s (DE) overall performance in computationally expensive problems.

DE is a popular metaheuristic to solve optimization problems with several variants available in the literature. Here, the offspring are generated by means of different variants, and only the best one, according to the surrogate model, is evaluated by the simulator. The problem of weight minimization of truss structures is used to assess DE’s performance when different metamodels are used. The surrogate-assisted DE techniques proposed here are also compared to common DE variants. Six different structural optimization problems are studied involving continuous as well as discrete sizing design variables.

The use of a local, similarity-based, surrogate model improves the relative performance of DE for most test-problems, specially when using r-nearest neighbors with r = 0.001 and a DE parameter F = 0.7.

The proposed methods have no limitations and can be applied to solve constrained optimization problems in general, and structural ones in particular.

The proposed techniques can be used to solve real-world problems in engineering. Also, the performance of the proposals is examined using structural engineering problems.

The main contributions of this work are to introduce and to evaluate additional local surrogate models; to evaluate the effect of the value of DE’s parameter F (which scales the differences between components of candidate solutions) upon each surrogate model; and to perform a more complete set of experiments covering continuous as well as discrete design variables.

This paper aims to propose a reliable local search algorithm having steepest descent pivot rule for computationally expensive optimization problems. In particular, an application to the design of Permanent Magnet Synchronous Motor (PMSM) drives is shown.

A surrogate assisted Hooke‐Jeeves algorithm (SAHJA) is proposed. The SAHJA is a local search algorithm with the structure of the Hooke‐Jeeves algorithm, which employs a local surrogate model dynamically constructed during the exploratory move at each step of the optimization process.

Several numerical experiments have been designed. These experiments are carried out both on the simulation model (off‐line) and at the actual plant (on‐line). Moreover, the off‐line experiments have been considered in non‐noisy and noisy cases. The numerical results show that use of the SAHJA leads to a saving in terms of computational cost without requiring any extra hardware components.

The surrogate approach in the design of electric drives is novel. In addition, implementation of the proposed surrogate model allows the algorithm not only to reduce computational cost but also to filter noise caused by the sensors and measurement devices.

This paper aims to assess control parameter setup and its effect on computational cost and performance of deterministic procedures for multi-objective design optimization of expensive simulation models of antenna structures.

A deterministic algorithm for cost-efficient multi-objective optimization of antenna structures has been assessed. The algorithm constructs a patch connecting extreme Pareto-optimal designs (obtained by means of separate single-objective optimization runs). Its performance (both cost- and quality-wise) depends on the dimensions of the so-called patch, an elementary region being relocated in the course of the optimization process. The cost/performance trade-offs are studied using two examples of ultra-wideband antenna structures and the optimization results are compared to draw conclusions concerning the algorithm robustness and determine the most advantageous control parameter setups.

The obtained results indicate that the investigated algorithm is very robust, i.e. its performance is weakly dependent on the control parameters setup. At the same time, it is found that the most suitable setups are those that ensure low computational cost, specifically non-uniform ones generated on the basis of sensitivity analysis.

The study provides recommendations for control parameter setup of deterministic multi-objective optimization procedure for computationally efficient design of antenna structures. This is the first study of this kind for this particular design procedure, which confirms its robustness and determines the most suitable arrangement of the control parameters. Consequently, the presented results permit full automation of the surrogate-assisted multi-objective antenna optimization process while ensuring its lowest possible computational cost.

The work is the first comprehensive validation of the sequential domain patching algorithm under various scenarios of its control parameter setup. The considered design procedure along with the recommended parameter arrangement is a robust and computationally efficient tool for fully automated multi-objective optimization of expensive simulation models of contemporary antenna structures.

This paper aims to propose hybrid global optimization based on multiple metamodels for improving the efficiency of global optimization.

The method has fully utilized the information provided by different metamodels in the optimization process. It not only imparts the expected improvement criterion of kriging into other metamodels but also intelligently selects appropriate metamodeling techniques to guide the search direction, thus making the search process very efficient. Besides, the corresponding local search strategies are also put forward to further improve the optimizing efficiency.

To validate the method, it is tested by several numerical benchmark problems and applied in two engineering design optimization problems. Moreover, an overall comparison between the proposed method and several other typical global optimization methods has been made. Results show that the global optimization efficiency of the proposed method is higher than that of the other methods for most situations.

The proposed method sufficiently utilizes multiple metamodels in the optimizing process. Thus, good optimizing results are obtained, showing great applicability in engineering design optimization problems which involve costly simulations.

In this paper, a modification strategy is proposed for the particle swarm optimization (PSO) algorithm. The strategy adds an adaptive scaling term into the algorithm, which aims to increase its convergence rate and thereby to obtain an acceptable solution with a lower number of objective function evaluations. Such an improvement can be useful in many practical engineering optimizations where the evaluation of a candidate solution is a computationally expensive operation and consequently finding the global optimum or a good sub‐optimal solution with the algorithm is too time consuming, or even impossible within the time available. The modified PSO algorithm was empirically studied with a suite of four well‐known benchmark functions, and was further examined with a practical application case, a neural‐network‐based modeling of aerodynamic data. The numerical simulation demonstrates that the modified algorithm statistically outperforms the original one.

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 paper is to introduce an effective methodology of obtaining Perot-optimal solutions when combining system dynamics (SD) and multi-objective optimization (MOO) for supply chain problems.

This paper proposes a new approach that combines SD and MOO within a simulation-based optimization framework for generating the efficient frontier for supporting decision making in supply chain management (SCM). It also addresses the issue of the curse of dimensionality, commonly found in practical optimization problems, through design space reduction.

The integrated MOO and SD approach has been shown to be very useful for revealing how the decision variables in the Beer Game (BG) affect the optimality of the three common SCM objectives, namely, the minimization of inventory, backlog, and the bullwhip effect (BWE). The results from the in-depth BG study clearly show that these three optimization objectives are in conflict with each other, in the sense that a supply chain manager cannot minimize the BWE without increasing the total inventory and total backlog levels.

Having a methodology that enables effective generation of optimal trade-off solutions, in terms of computational cost, time as well as solution diversity and intensification, assist decision makers in not only making decision in time but also present a diverse and intense solution set to choose from.

This paper presents a novel supply chain MOO methodology to assist in finding Pareto-optimal solutions in a more effective manner. In order to do so the methodology tackles the so-called curse of dimensionality by reducing the design space and focussing the search of the optimization to regions of inters. Together with design space reduction, it is believed that the integrated SD and MOO approach can provide an innovative and efficient approach for the design and analysis of manufacturing supply chain systems in general.