System Architecture Optimization Strategies: Dealing with Expensive Hierarchical Problems
arXiv:2502.00838 · doi:10.1007/s10898-024-01443-8
Abstract
Choosing the right system architecture for the problem at hand is challenging due to the large design space and high uncertainty in the early stage of the design process. Formulating the architecting process as an optimization problem may mitigate some of these challenges. This work investigates strategies for solving System Architecture Optimization (SAO) problems: expensive, black-box, hierarchical, mixed-discrete, constrained, multi-objective problems that may be subject to hidden constraints. Imputation ratio, correction ratio, correction fraction, and max rate diversity metrics are defined for characterizing hierar chical design spaces. This work considers two classes of optimization algorithms for SAO: Multi-Objective Evolutionary Algorithms (MOEA) such as NSGA-II, and Bayesian Optimization (BO) algorithms. A new Gaussian process kernel is presented that enables modeling hierarchical categorical variables, extending previous work on modeling continuous and integer hierarchical variables. Next, a hierarchical sampling algorithm that uses design space hierarchy to group design vectors by active design variables is developed. Then, it is demonstrated that integrating more hierarchy information in the optimization algorithms yields better optimization results for BO algorithms. Several realistic single-objective and multi-objective test problems are used for investigations. Finally, the BO algorithm is applied to a jet engine architecture optimization problem. This work shows that the developed BO algorithm can effectively solve the problem with one order of magnitude less function evaluations than NSGA-II. The algorithms and problems used in this work are implemented in the open-source Python library SBArchOpt.
J Glob Optim (2024)
References in corpus (19)
- On Hyperparameter Optimization of Machine Learning Algorithms: Theory and Practice
- pymoo: Multi-objective Optimization in Python
- Dealing with Integer-valued Variables in Bayesian Optimization with Gaussian Processes
- Dealing with Categorical and Integer-valued Variables in Bayesian Optimization with Gaussian Processes
- SMT 2.0: A Surrogate Modeling Toolbox with a focus on Hierarchical and Mixed Variables Gaussian Processes
- Graph Kernels: A Survey
- OpenBox: A Generalized Black-box Optimization Service
- Upper Trust Bound Feasibility Criterion for Mixed Constrained Bayesian Optimization with Application to Aircraft Design
- CMA-ES with Margin: Lower-Bounding Marginal Probability for Mixed-Integer Black-Box Optimization
- BOAH: A Tool Suite for Multi-Fidelity Bayesian Optimization & Analysis of Hyperparameters
- A mixed-categorical correlation kernel for Gaussian process
- Trieste: Efficiently Exploring The Depths of Black-box Functions with TensorFlow
- HEBO Pushing The Limits of Sample-Efficient Hyperparameter Optimisation
- Bayesian Optimization over Discrete and Mixed Spaces via Probabilistic Reparameterization
- Bayesian optimization for mixed variables using an adaptive dimension reduction process: applications to aircraft design
- Surrogate-based optimization of system architectures subject to hidden constraints
- High-dimensional mixed-categorical Gaussian processes with application to multidisciplinary design optimization for a green aircraft
- Framework and Benchmarks for Combinatorial and Mixed-variable Bayesian Optimization
- Metaheuristics for (Variable-Size) Mixed Optimization Problems: A Unified Taxonomy and Survey