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

摘要

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-Ⅱ 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.