journal article·2024-06-21Open access

Multi-Objective Optimization for Complex Systems Considering Both Performance Optimality and Robustness

Yue Chen, Jian Shi

Applied Sciences· Volume 14· Issue 13

Abstract

As engineering systems become increasingly complex, performance requirements rise, and tolerance for design parameter variations becomes more crucial due to increased uncertainty. Tolerance to parameter variation can be measured by the volume of the solution space. A larger solution space implies a higher tolerance to parameter changes and thus greater robustness. The box-shaped solution space, represented by intervals with respect to each design parameter, has the advantage of showing which design parameters can be decoupled. Therefore, this paper proposes a new multi-objective optimization problem to optimize both the performance and volume of the box-shaped solution space simultaneously. Often, optimal performance and maximum volume are conflicting objectives, indicating a trade-off between performance and robustness. Furthermore, the DIRECT-NSGA-II approach is proposed for solving this multi-objective optimization problem. The DIRECT algorithm evaluates the minimum value of the performance function within the box-shaped solution space, while the NSGA-II algorithm identifies Pareto-optimal solution spaces. Finally, two case studies are implemented to illustrate the effectiveness of the DIRECT-NSGA-II method. We can conclude that (I) the proposed DIRECT-NSGA-II approach is suitable for black-box performance functions, (II) any point within the obtained solution space is a good design point, and (III) the proposed optimization problem considers both performance optimality and robustness, enabling the identification of a representative set of Pareto-optimal solution spaces that balance these two factors.
Source: crossref · Quality: baseline

Research context

OpenAlex topics: Systems Engineering Methodologies and Applications

SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.

Affiliations

School of Statistics, Capital University of Economics and Business, Beijing 100070, China

Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190, China

School of Mathematical Sciences, University of Chinese Academy of Sciences, Beijing 100049, China

Funding

Youth Academic Innovation Team Construction project of Capital University of Economics and Business

References (43)

Show source-provided references
1. Oberkampf, W.L. (2005). Uncertainty Quantification Using Evidence Theory, Stanford University.
2. Non-gradient based parameter sensitivity estimation for single objective robust design optimization10.1115/1.1711821 ↗
3. Zhou, S., Zhang, J., Zhang, Q., Huang, Y., and Wen, M. (2022). Uncertainty theory-based structural reliability analysis and design optimization under epistemic uncertainty. Appl. Sci., 12.10.3390/app12062846 ↗
4. Propagating input uncertainties into parameter uncertainties and model prediction uncertainties—A review10.1002/cjce.25015 ↗
5. Introducing robustness in multi-objective optimization10.1162/evco.2006.14.4.463 ↗
6. Robust optimization: A kriging-based multi-objective optimization approach10.1016/j.ress.2020.106913 ↗
7. Evolutionary large-scale multi-objective optimization: A survey
8. Robust optimization–a comprehensive survey10.1016/j.cma.2007.03.003 ↗
9. Engineering computation under uncertainty–capabilities of non-traditional models10.1016/j.compstruc.2007.05.041 ↗
10. Jin, Y., and Sendhoff, B. (2003, January 8–11). Trade-off between performance and robustness: An evolutionary multiobjective approach. Proceedings of the International Conference on Evolutionary Multi-Criterion Optimization, Faro, Portugal.10.1007/3-540-36970-8_17 ↗
11. Robust design of structures using optimization methods10.1016/j.cma.2003.12.055 ↗
12. A methodology for trading-off performance and robustness under uncertainty10.1115/1.2202883 ↗
13. Robey, A., Chamon, L., Pappas, G.J., and Hassani, H. (2022, January 17–23). Probabilistically robust learning: Balancing average and worst-case performance. Proceedings of the 39th International Conference on Machine Learning, Baltimore, MD, USA.
14. Xu, D., Zhang, Y., and Zimmermann, M. (2023). Design of Vibrating Systems Using Solution Spaces. Machines, 11.10.3390/machines11060642 ↗
15. Sathuluri, A., Sureshbabu, A.V., and Zimmermann, M. (June, January 29). Robust co-design of robots via cascaded optimisation. Proceedings of the 2023 IEEE International Conference on Robotics and Automation (ICRA), London, UK.10.1109/ICRA48891.2023.10161134 ↗
16. Computing solution spaces for robust design10.1002/nme.4450 ↗
17. Bender, E. (2000). An Introduction to Mathematical Modeling, Dover Publications.
18. A globally optimal robust design method for complex systems10.1155/2020/6632956 ↗
19. On the computation of solution spaces in high dimensions10.1007/s00158-016-1454-x ↗
20. Robust design using a hybrid cellular-evolutionary and interval-arithmetic approach: A reliability application10.1016/S0951-8320(02)00226-0 ↗
21. Moore, R. (1966). Interval Analysis, Prentice-Hall.
22. Solving advanced multi-objective robust designs by means of multiple objective evolutionary algorithms (MOEA): A reliability application10.1016/j.ress.2006.03.003 ↗
23. Identification of energy management configuration concepts from a set of pareto-optimal solutions
24. Globally-biased DISIMPL algorithm for expensive global optimization10.1007/s10898-014-0180-4 ↗
25. Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds10.1007/s11590-009-0156-3 ↗
26. An algorithm for finding the absolute minimum of a function
27. A sequential method seeking the global maximum of a function10.1137/0709036 ↗
28. Lipschitzian optimization without the Lipschitz constant10.1007/BF00941892 ↗
29. Global optimization using the DIRECT algorithm in Matlab
30. Gablonsky, J. (2001). Modifications of the Direct Algorithm. [Ph.D. Thesis, North Carolina State University].
31. Additive scaling and the DIRECT algorithm10.1007/s10898-006-9029-9 ↗
32. A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems10.1007/s10589-008-9217-2 ↗
33. Global search based on diagonal partitions and a set of Lipschitz constants
34. A fast and elitist multiobjective genetic algorithm: NSGA-II10.1109/4235.996017 ↗
35. DIRECT algorithm: A new definition of potentially optimal hyperrectangles
36. A new sampling method in the DIRECT algorithm
37. Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants10.1007/s10898-016-0485-6 ↗
38. Optimization of constrained multiple-objective reliability problems using evolutionary algorithms10.1016/j.ress.2005.11.040 ↗
39. Optimizing bi-objective redundancy allocation problem with a mixed redundancy strategy10.1016/j.isatra.2014.10.002 ↗
40. Deb, K., Agrawal, S., Pratap, A., and Meyarivan, T. (2000). A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. Parallel Problem Solving from Nature PPSN VI, Proceedings of the 6th International Conference, Paris, France, 18–20 September 2000, Springer. International Conference on Parallel Problem Solving from Nature.10.1007/3-540-45356-3_83 ↗
41. Nonequilibrium simulated-annealing algorithm applied to reliability optimization of complex systems10.1109/24.589951 ↗
42. A new reliability analysis method for repairable systems with closed-loop feedback links10.1002/qre.2255 ↗
43. Optimizing component solution spaces for systems design10.1007/s00158-019-02456-8 ↗