Breaking-down building design problems with decomposition approaches: A review
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Decomposition simplifies complex building design problems by breaking them into smaller, manageable subproblems, enabling structured and efficient optimization. While widely used in systems engineering, its application in building design remains underexplored due to inconsistent definitions and a lack of structured guidelines. This review systematically examines decomposition approaches in early-stage building design optimization, primarily focusing on energy and emission performances. The study first characterizes single-level building design optimization problems and underscores the importance of decomposition. It then analyzes decomposition mechanisms, focusing on four hierarchical approaches: Sequential, Iterative, Nested, and Partitioned, along with a structured guideline outlining their key implementation criteria and challenges. Findings demonstrate that decomposition reduces computational effort while maintaining solution accuracy and enhances automation. This review highlights how decomposition improves design flexibility and supports the integration of operational performance in the early building design stages. The practical guideline enables key stakeholders to improve collaboration and facilitate a more informed decision-making process.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it