A sampling-based optimization algorithm for solution spaces with pair-wise-coupled design variables
Solution spaces are sets of good designs that satisfy all design goals. They serve as target regions for robust and independent component development in a distributed design process. So-called solution boxes provide best decoupling; however, they are often small and therefore impractical. This article proposes an algorithm that computes two-dimensional permissible regions for pairs of design variables that are substantially larger than solution boxes. This is accomplished by modifying the existing sampling-based optimization algorithm for boxes and extending it by box-rotation.
KeywordsSampling-based optimization algorithm Black-box optimization Solution spaces
Compliance with Ethical Standards
Conflict of interest
The authors declare that they have no conflict of interest.
- Ben-Tal A, Nemirovski A (2001) Lectures on modern convex optimization analysis, algorithms, and engineering applications. Mos-Siam Series on Optimization, Society for Industrial and Applied Mathematics and Mathematical Programming Society PhiladelphiaGoogle Scholar
- Choi KK, Youn BD, Yang R-J (2001) Moving least square method for reliability-based design optimization. Fourth World Congress of Structural and Multidisciplinary Optimization. Dalian, ChinaGoogle Scholar
- Duddeck F, Wehrle E (2015) Recent advances on surrogate modeling for robustness assessment of structures with respect to crashworthiness requirement. In: 10th European LS-DYNA conference. WürzburgGoogle Scholar
- Graff L (2013) A stochastic algorithm for the identification of solution spaces in high-dimensional design spaces. PhD thesis, Faculty of Science University of BaselGoogle Scholar
- Sobek D, Ward AC, Liker J (1999) Toyota’s principles of set-based concurrent engineering. Sloan Manag Rev 40(2):67–83Google Scholar