Siyang Deng, Stéphane Brisset and Stephane Clénet
This paper compares six reliability-based design optimization (RBDO) approaches dealing with uncertainties for a simple mathematical model and a multidisciplinary optimization…
Abstract
Purpose
This paper compares six reliability-based design optimization (RBDO) approaches dealing with uncertainties for a simple mathematical model and a multidisciplinary optimization problem of a safety transformer to highlight the most effective.
Design/methodology/approach
The RBDO and various approaches to calculate the probability of failure are is presented. They are compared in terms of precision and number of evaluations on mathematical and electromagnetic design problems.
Findings
The mathematical example shows that the six RBDO approaches have almost the same results except the approximate moment approach that is less accurate. The optimization of the safety transformer highlights that not all the methods can converge to the global solution. Performance measure approach, single-loop approach and sequential optimization and reliability assessment (SORA) method appear to be more stable. Considering both numerical examples, SORA is the most effective method among all RBDO approaches.
Originality/value
The comparison of six RBDO methods on the optimization problem of a safety transformer is achieved for the first time. The comparison in terms of precision and number of evaluations highlights the most effective ones.
Details
Keywords
Stéphane Brisset and Tuan-Vu Tran
This paper aims to propose a multiobjective branch and bound (MOBB) algorithm with a new criteria for the branching and discarding of nodes based on Pareto dominance and…
Abstract
Purpose
This paper aims to propose a multiobjective branch and bound (MOBB) algorithm with a new criteria for the branching and discarding of nodes based on Pareto dominance and contribution metric.
Design/methodology/approach
A multiobjective branch and bound (MOBB) method is presented and applied to the bi-objective combinatorial optimization of a safety transformer. A comparison with exhaustive enumeration and non-dominated sorting genetic algorithm (NSGA2) confirms the solutions.
Findings
It appears that MOBB and NSGA2 are both sensitive to their control parameters. The parameters for the MOBB algorithm are the number of starting points and the number of solutions on the relaxed Pareto front. The parameters of NSGA2 are the population size and the number of generations.
Originality/value
The comparison with exhaustive enumeration confirms that the proposed algorithm is able to find the complete set of non-dominated solutions in about 235 times fewer evaluations. As this last method is exact, its confidence level is higher.
Details
Keywords
Ramzi Ben Ayed and Stéphane Brisset
– The aim of this paper is to reduce the evaluations number of the fine model within the output space mapping (OSM) technique in order to reduce their computing time.
Abstract
Purpose
The aim of this paper is to reduce the evaluations number of the fine model within the output space mapping (OSM) technique in order to reduce their computing time.
Design/methodology/approach
In this paper, n-level OSM is proposed and expected to be even faster than the conventional OSM. The proposed algorithm takes advantages of the availability of n models of the device to optimize, each of them representing an optimal trade-off between the model error and its computation time. Models with intermediate characteristics between the coarse and fine models are inserted within the proposed algorithm to reduce the number of evaluations of the consuming time model and then the computing time. The advantages of the algorithm are highlighted on the optimization problem of superconducting magnetic energy storage (SMES).
Findings
A major computing time gain equals to three is achieved using the n-level OSM algorithm instead of the conventional OSM technique on the optimization problem of SMES.
Originality/value
The originality of this paper is to investigate several models with different granularities within OSM algorithm in order to reduce its computing time without decreasing the performance of the conventional strategy.
Details
Keywords
Ramzi Ben Ayed and Stéphane Brisset
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.
Abstract
Purpose
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.
Design/methodology/approach
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.
Findings
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.
Originality/value
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.
Details
Keywords
F. Moussouni, S. Kreuawan, S. Brisset, F. Gillon, P. Brochet and L. Nicod
Analytical target cascading (ATC) is a hierarchical multi‐level design methodology. According to the state‐of‐the‐art, it is confirmed that for problems with unattainable targets…
Abstract
Purpose
Analytical target cascading (ATC) is a hierarchical multi‐level design methodology. According to the state‐of‐the‐art, it is confirmed that for problems with unattainable targets, strict design consistency cannot be achieved with finite weighting factors. This paper aims to address these issues.
Design/methodology/approach
A new formulation is proposed to improve the ATC convergence. The weighted sum of deviation metric is transformed into a multi‐objective formulation. An original optimization problem with a single global optimal solution is used as a benchmark.
Findings
It is found that carrying out an industrial application to design optimally a tram traction system demonstrates the efficiency of the proposed solution.
Originality/value
This paper is of value in showing how to improve the convergence of a multi‐level optimization algorithm by best management of the consistency constraints.
Details
Keywords
Jinlin Gong, Frédéric Gillon and Nicolas Bracikowski
This paper aims to investigate three low-evaluation-budget optimization techniques: output space mapping (OSM), manifold mapping (MM) and Kriging-OSM. Kriging-OSM is an original…
Abstract
Purpose
This paper aims to investigate three low-evaluation-budget optimization techniques: output space mapping (OSM), manifold mapping (MM) and Kriging-OSM. Kriging-OSM is an original approach having high-order mapping.
Design/methodology/approach
The electromagnetic device to be optimally sized is a five-phase linear induction motor, represented through two levels of modeling: coarse (Kriging model) and fine.The optimization comparison of the three techniques on the five-phase linear induction motor is discussed.
Findings
The optimization results show that the OSM takes more time and iteration to converge the optimal solution compared to MM and Kriging-OSM. This is mainly because of the poor quality of the initial Kriging model. In the case of a high-quality coarse model, the OSM technique would show its domination over the other two techniques. In the case of poor quality of coarse model, MM and Kriging-OSM techniques are more efficient to converge to the accurate optimum.
Originality/value
Kriging-OSM is an original approach having high-order mapping. An advantage of this new technique consists in its capability of providing a sufficiently accurate model for each objective and constraint function and makes the coarse model converge toward the fine model more effectively.
Details
Keywords
Stéphane Vivier, Didier Lemoine and Guy Friedrich
The purpose of this paper is to focus on the implementation and management of multi‐objective optimizations, with the help of heuristic algorithms such as space mapping methods.
Abstract
Purpose
The purpose of this paper is to focus on the implementation and management of multi‐objective optimizations, with the help of heuristic algorithms such as space mapping methods.
Design/methodology/approach
The authors consider the design of electromechanical actuators by the use of mathematical and computer means. Experiments are then virtual, because they correspond to numerical simulations. Dimensioning is then ensured by an optimization procedure of the space mapping type, whose main characteristic consists in using two models of the same size actuator (instead of a single one for classical optimization methods). Moreover, one considers here that multiple outputs are defined: this defines a multi‐objective optimization. This paper proposes several techniques making it possible to include the definition of multiple objectives to be fulfilled as part of an output space mapping optimization process.
Findings
The proposed approaches make it possible to stabilize and accelerate the convergence of multi‐objective optimizations performed by space mapping. This is illustrated by the example of the dimensioning of a resonant linear electromagnetic actuator.
Originality/value
The approach presented in the paper is original because it allows finding of a solution to the multi‐objective problem, without building any Pareto front, and most effectively by improving the convergent behavior of the optimization algorithm.