TY - JOUR

T1 - On the Optimal Decomposition of High-Dimensional Solution Spaces of Complex Systems

AU - Erschen, Stefan

AU - Duddeck, Fabian

AU - Gerdts, Matthias

AU - Zimmermann, Markus

N1 - Publisher Copyright:
Copyright © 2018 by ASME.

PY - 2018/6/1

Y1 - 2018/6/1

N2 - In the early development phase of complex technical systems, uncertainties caused by unknown design restrictions must be considered. In order to avoid premature design decisions, sets of good designs, i.e., designs which satisfy all design goals, are sought rather than one optimal design that may later turn out to be infeasible. A set of good designs is called a solution space and serves as target region for design variables, including those that quantify properties of components or subsystems. Often, the solution space is approximated, e.g., to enable independent development work. Algorithms that approximate the solution space as high-dimensional boxes are available, in which edges represent permissible intervals for single design variables. The box size is maximized to provide large target regions and facilitate design work. As a result of geometrical mismatch, however, boxes typically capture only a small portion of the complete solution space. To reduce this loss of solution space while still enabling independent development work, this paper presents a new approach that optimizes a set of permissible twodimensional (2D) regions for pairs of design variables, so-called 2D-spaces. Each 2Dspace is confined by polygons. The Cartesian product of all 2D-spaces forms a solution space for all design variables. An optimization problem is formulated that maximizes the size of the solution space, and is solved using an interior-point algorithm. The approach is applicable to arbitrary systems with performance measures that can be expressed or approximated as linear functions of their design variables. Its effectiveness is demonstrated in a chassis design problem.

AB - In the early development phase of complex technical systems, uncertainties caused by unknown design restrictions must be considered. In order to avoid premature design decisions, sets of good designs, i.e., designs which satisfy all design goals, are sought rather than one optimal design that may later turn out to be infeasible. A set of good designs is called a solution space and serves as target region for design variables, including those that quantify properties of components or subsystems. Often, the solution space is approximated, e.g., to enable independent development work. Algorithms that approximate the solution space as high-dimensional boxes are available, in which edges represent permissible intervals for single design variables. The box size is maximized to provide large target regions and facilitate design work. As a result of geometrical mismatch, however, boxes typically capture only a small portion of the complete solution space. To reduce this loss of solution space while still enabling independent development work, this paper presents a new approach that optimizes a set of permissible twodimensional (2D) regions for pairs of design variables, so-called 2D-spaces. Each 2Dspace is confined by polygons. The Cartesian product of all 2D-spaces forms a solution space for all design variables. An optimization problem is formulated that maximizes the size of the solution space, and is solved using an interior-point algorithm. The approach is applicable to arbitrary systems with performance measures that can be expressed or approximated as linear functions of their design variables. Its effectiveness is demonstrated in a chassis design problem.

UR - http://www.scopus.com/inward/record.url?scp=85047053410&partnerID=8YFLogxK

U2 - 10.1115/1.4037485

DO - 10.1115/1.4037485

M3 - Article

AN - SCOPUS:85047053410

SN - 2332-9017

VL - 4

JO - ASCE-ASME Journal of Risk and Uncertainty in Engineering Systems, Part B: Mechanical Engineering

JF - ASCE-ASME Journal of Risk and Uncertainty in Engineering Systems, Part B: Mechanical Engineering

IS - 2

M1 - 021008

ER -