An Efficient Multi-Objective Robust Optimization Method by Sequentially Searching From Nominal Pareto Solutions

2021 ◽  
Author(s):  
Tingting Xia ◽  
Mian Li
Keyword(s):  
Robust Optimization ◽  
Optimization Method ◽  
Pareto Solutions ◽  
Multi Objective

An Efficient Multi-Objective Robust Optimization Method by Sequentially Searching From Nominal Pareto Solutions

2021 ◽  
Vol 21 (4) ◽  
Author(s):  
Tingting Xia ◽  
Mian Li
Keyword(s):  
Robust Optimization ◽  
Pareto Front ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Computational Time ◽  
Pareto Solutions ◽  
Worst Case ◽  
Multi Objective ◽  
Pareto Points ◽  
Single Objective

Abstract Multi-objective optimization problems (MOOPs) with uncertainties are common in engineering design. To find robust Pareto fronts, multi-objective robust optimization (MORO) methods with inner–outer optimization structures usually have high computational complexity, which is a critical issue. Generally, in design problems, robust Pareto solutions lie somewhere closer to nominal Pareto points compared with randomly initialized points. The searching process for robust solutions could be more efficient if starting from nominal Pareto points. We propose a new method sequentially approaching to the robust Pareto front (SARPF) from the nominal Pareto points where MOOPs with uncertainties are solved in two stages. The deterministic optimization problem and robustness metric optimization are solved in the first stage, where nominal Pareto solutions and the robust-most solutions are identified, respectively. In the second stage, a new single-objective robust optimization problem is formulated to find the robust Pareto solutions starting from the nominal Pareto points in the region between the nominal Pareto front and robust-most points. The proposed SARPF method can reduce a significant amount of computational time since the optimization process can be performed in parallel at each stage. Vertex estimation is also applied to approximate the worst-case uncertain parameter values, which can reduce computational efforts further. The global solvers, NSGA-II for multi-objective cases and genetic algorithm (GA) for single-objective cases, are used in corresponding optimization processes. Three examples with the comparison with results from the previous method are presented to demonstrate the applicability and efficiency of the proposed method.

scholarly journals A multi-objective optimization-based model for the deployment of reclosers and remote-controlled switches using NSGA2 and entropy weighted TOPSIS method

2020 ◽  
Vol 20 (3) ◽  
pp. 1128
Author(s):  
Anass Lekbich ◽  
Abdelaziz Belfqih ◽  
Tayeb Ouaderhman ◽  
Chaimae Zedak ◽  
Jamal Boukherouaa ◽  
...  
Keyword(s):  
Distribution Networks ◽  
Optimization Method ◽  
Pareto Solutions ◽  
Performance Control ◽  
Multi Objective ◽  
Electrical Distribution ◽  
Criteria Weights ◽  
Electrical Distribution Networks ◽  
Entropy Weighted ◽  
The Ideal

<p>Since they are fast, remote-controlled, automated and intelligent, reclosers<br />and switches are an inevitable solution for improving the reliability of<br />intelligent electrical distribution networks at optimal cost. However, their<br />location and coordination have great effects on the protection and automation<br />strategies of complex electrical distribution networks against multiple<br />unpredictable faults. Which requires a flexible and multi-criteria optimization<br />method. In this article, we propose a multi-objective method based on an<br />analytical model by considering the fault rate, restoration times, outage cost<br />and coordination between devices. The non-dominated genetic sorting<br />algorithm II was proposed to obtain the optimal Pareto solutions, and a<br />technique of performance control by similarity with the ideal solution was<br />used to classify them. The objective criteria weights are based on the entropy<br />method which allows solutions to be obtained and better classified with the<br />minimum of subjectivity. The IEEE33 and IEEE13 bus test networks were<br />used to verify the method. The results obtained are compared to a binary<br />multi-objective particle swarm optimization method and the results show that<br />the proposed method reduces the overall costs, reduces the undelivered<br />energy of the system and improves the reliability of the service.</p>

A Bi-Level Multi-Objective Robust Design Optimization Method With Multiple Robustness Index Capabilities

2011 ◽  
Author(s):  
Todd Letcher ◽  
M.-H. Herman Shen
Keyword(s):  
Robust Optimization ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Optimization Method ◽  
Robust Design Optimization ◽  
Nsga Ii ◽  
Worst Case ◽  
Multi Objective ◽  
Robustness Index ◽  
Multiple Robustness

A multi-objective robust optimization framework that incorporates a robustness index for each objective has been developed in a bi-level approach. The top level of the framework consists of the standard optimization problem formulation with the addition of a robustness constraint. The bottom level uses the Worst Case Sensitivity Region (WCSR) concept previously developed to solve single objective robust optimization problems. In this framework, a separate robustness index for each objective allows the designer to choose the importance of each objective. The method is demonstrated on a commonly studied two-bar truss structural optimization problem. The results of the problem demonstrate the effectiveness and usefulness of the multiple robustness index capabilities added to this framework. A multi-objective genetic algorithm, NSGA-II, is used in both levels of the framework.

An Efficient Multi-Objective Robust Optimization Method by Sequentially Searching From Nominal Pareto Solutions

2020 ◽  
Author(s):  
Tingting Xia ◽  
Mian Li
Keyword(s):  
Robust Optimization ◽  
Pareto Front ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Pareto Solutions ◽  
Worst Case ◽  
Multi Objective ◽  
Pareto Points ◽  
Engineering Design Problems ◽  
Single Objective

Abstract Multi-objective optimization problems (MOOPs) with uncertainties are common in engineering design problems. To find the robust Pareto fronts, multi-objective robust optimization methods with inner-outer optimization structures generally have high computational complexity, which is always an important issue to address. Based on the general experience, robust Pareto solutions usually lie somewhere near the nominal Pareto points. Starting from the obtained nominal Pareto points, the search process for robust solutions could be more efficient. In this paper, we propose a method that sequentially approaching to the robust Pareto front (SARPF) from the nominal Pareto points. MOOPs are solved by the SARPF in two optimization stages. The deterministic optimization problem and the robustness metric optimization problem are solved in the first stage, and nominal Pareto solutions and the robust-most solutions can be found respectively. In the second stage, a new single-objective robust optimization problem is formulated to find the robust Pareto solutions starting from the nominal Pareto points in the region between the nominal Pareto front and the robust-most points. The proposed SARPF method can save a significant amount of computation time since the optimization process can be performed in parallel at each stage. Vertex estimation is also applied to approximate the worst-case uncertain parameter values which can save computational efforts further. The global solvers, NSGA-II for the multi-objective case and genetic algorithm (GA) for the single-objective case, are used in corresponding optimization processes. Two examples with comparison to a previous method are presented for the applicability and efficiency demonstration.

scholarly journals Multi-objective robust optimization method for the modified epoxy resin sheet molding compounds of the impeller

2016 ◽  
Vol 3 (3) ◽  
pp. 179-190 ◽  
Author(s):  
Xiaozhang Qu ◽  
Guiping Liu ◽  
Shuyong Duan ◽  
Jichu Yang
Keyword(s):  
Robust Optimization ◽  
Epoxy Resin ◽  
Ventilation System ◽  
Optimization Method ◽  
Approximate Model ◽  
Analysis Model ◽  
Molding Compounds ◽  
Multi Objective ◽  
Multi Objective Genetic Algorithm ◽  
Modified Epoxy

Abstract A kind of modified epoxy resin sheet molding compounds of the impeller has been designed. Through the test, the non-metal impeller has a better environmental aging performance, but must do the waterproof processing design. In order to improve the stability of the impeller vibration design, the influence of uncertainty factors is considered, and a multi-objective robust optimization method is proposed to reduce the weight of the impeller. Firstly, based on the fluid-structure interaction, the analysis model of the impeller vibration is constructed. Secondly, the optimal approximate model of the impeller is constructed by using the Latin hypercube and radial basis function, and the fitting and optimization accuracy of the approximate model is improved by increasing the sample points. Finally, the micro multi-objective genetic algorithm is applied to the robust optimization of approximate model, and the Monte Carlo simulation and Sobol sampling techniques are used for reliability analysis. By comparing the results of the deterministic, different sigma levels and different materials, the multi-objective optimization of the SMC molding impeller can meet the requirements of engineering stability and lightweight. And the effectiveness of the proposed multi-objective robust optimization method is verified by the error analysis. After the SMC molding and the robust optimization of the impeller, the optimized rate reached 42.5%, which greatly improved the economic benefit, and greatly reduce the vibration of the ventilation system.

Multi-Objective Design Problem of Tire Wear and Visualization of Its Pareto Solutions2

2006 ◽  
Vol 34 (3) ◽  
pp. 170-194 ◽  
Author(s):  
M. Koishi ◽  
Z. Shida
Keyword(s):  
Inverse Problems ◽  
Conceptual Design ◽  
Dimensional Space ◽  
Design Stage ◽  
Objective Functions ◽  
Pareto Solutions ◽  
Design Problems ◽  
Multi Objective ◽  
Design Engineers ◽  
Design Variables

Abstract Since tires carry out many functions and many of them have tradeoffs, it is important to find the combination of design variables that satisfy well-balanced performance in conceptual design stage. To find a good design of tires is to solve the multi-objective design problems, i.e., inverse problems. However, due to the lack of suitable solution techniques, such problems are converted into a single-objective optimization problem before being solved. Therefore, it is difficult to find the Pareto solutions of multi-objective design problems of tires. Recently, multi-objective evolutionary algorithms have become popular in many fields to find the Pareto solutions. In this paper, we propose a design procedure to solve multi-objective design problems as the comprehensive solver of inverse problems. At first, a multi-objective genetic algorithm (MOGA) is employed to find the Pareto solutions of tire performance, which are in multi-dimensional space of objective functions. Response surface method is also used to evaluate objective functions in the optimization process and can reduce CPU time dramatically. In addition, a self-organizing map (SOM) proposed by Kohonen is used to map Pareto solutions from high-dimensional objective space onto two-dimensional space. Using SOM, design engineers see easily the Pareto solutions of tire performance and can find suitable design plans. The SOM can be considered as an inverse function that defines the relation between Pareto solutions and design variables. To demonstrate the procedure, tire tread design is conducted. The objective of design is to improve uneven wear and wear life for both the front tire and the rear tire of a passenger car. Wear performance is evaluated by finite element analysis (FEA). Response surface is obtained by the design of experiments and FEA. Using both MOGA and SOM, we obtain a map of Pareto solutions. We can find suitable design plans that satisfy well-balanced performance on the map called “multi-performance map.” It helps tire design engineers to make their decision in conceptual design stage.

Sign in / Sign up

Export Citation Format

Share Document