id |
ecaade2018_405 |
authors |
Belém, Catarina and Leit?o, António |
year |
2018 |
title |
From Design to Optimized Design - An algorithmic-based approach |
doi |
https://doi.org/10.52842/conf.ecaade.2018.2.549
|
source |
Kepczynska-Walczak, A, Bialkowski, S (eds.), Computing for a better tomorrow - Proceedings of the 36th eCAADe Conference - Volume 2, Lodz University of Technology, Lodz, Poland, 19-21 September 2018, pp. 549-558 |
summary |
Stringent requirements of efficiency and sustainability lead to the demand for buildings that have good performance regarding different criteria, such as cost, lighting, thermal, and structural, among others. Optimization can be used to ensure that such requirements are met. In order to optimize a design, it is necessary to generate different variations of the design, and to evaluate each variation regarding the intended criteria. Currently available design and evaluation tools often demand manual and time-consuming interventions, thus limiting design variations, and causing architects to completely avoid optimization or to postpone it to later stages of the design, when its benefits are diminished. To address these limitations, we propose Algorithmic Optimization, an algorithmic-based approach that combines an algorithmic description of building designs with automated simulation processes and with optimization processes. We test our approach on a daylighting optimization case study and we benchmark different optimization methods. Our results show that the proposed workflow allows to exclude manual interventions from the optimization process, thus enabling its automation. Moreover, the proposed workflow is able to support the architect in the choice of the optimization method, as it enables him to easily switch between different optimization methods. |
keywords |
Algorithmic Design; Algorithmic Analysis; Algorithmic Optimization; Lighting optimization; Black-Box optimization |
series |
eCAADe |
email |
catarina.belem@tecnico.ulisboa.pt |
full text |
file.pdf (4,025,097 bytes) |
references |
Content-type: text/plain
|
Brent, RP (1973)
Algorithms for Minimization without Derivatives
, Dover Publications, Mineola, New York
|
|
|
|
Caetano, I, Ilunga, G, Belém, C, Aguiar, R, Feist, S, Bastos, F and Leit?o, A (2018)
Case Studies on the Integration of Algorithmic Design Processes in Traditional Design Workflows
, Learning, Adapting and Prototyping - Proceedings of the 23rd CAADRIA Conference, Beijing, China, pp. 129-139
|
|
|
|
Cichocka, JM, Browne, WN and Rodriguez, E (2017)
Optimization in the Architectural Practice
, Protocols, Flows, and Glitches - Proceedings of the 22nd CAADRIA Conference, Suzhou, China, p. 387-397
|
|
|
|
Conn, A, Scheinberg, K and Vicente, L (2009)
Introduction to Derivative-Free Optimization
, PA: Society for Industrial and Applied Mathematics
|
|
|
|
Gablonsky, JM and Kelley, CT (2001)
A locally-biased form of the DIRECT algorithm
, Global Optimization, 21, pp. 27-37
|
|
|
|
Glover, FW and Kochenberger, GA (2003)
Handbook of Metaheuristics
, Kluwer
|
|
|
|
Gutmann, HM (2001)
A Radial Basis Function Method for Global Optimization
, Journal of Global Optimization, 19(3), p. 201-227
|
|
|
|
Hamdy, M, Nguyen, A and Hensen, JLM (2016)
A performance comparison of multi-objective optimization algorithms for solving nearly-zero-energy-building design problems
, Energy and Buildings, 121, pp. 57-71
|
|
|
|
Hasançebi, O, Carbas, S, Dogan, E, Erdal, F and Saka, MP (2009)
Performance evaluation of metaheuristic search techniques in the optimum design of real size pin jointed structures
, Computers and Structures, 87(5-6), pp. 284-302
|
|
|
|
Jones, DR, Perttunen, CD and Stuckman, BE (1993)
Lipschitzian optimization without the Lipschitz constant
, Journal of Optimization Theory and Applications, 79(1), p. 157-181
|
|
|
|
Kolda, TG, Lewis, RM and Torczon, V (2003)
Optimization by Direct Search- New Perspectives on Some Classical and Modern Methods
, Society for Industrial and Applied Mathematics, 45(3), pp. 385-482
|
|
|
|
Koziel, S, Ciaurri, DE and Leifsson, L (2011)
Surrogate-Based Methods
, Koziel, S and Yang, X (eds), Computational optimization, methods and algorithms, Springer-Verlag Berlin Heidelberg, pp. 33-59
|
|
|
|
Leit?o, A, Castelo-Branco, R and Cardoso, C (2017)
Algorithmic-based analysis: Design and Analysis in a Multi Back-end Generative Tool
, Protocols, Flows and Glitches, Proceedings of the 22nd CAADRIA Conference, Suzhou, China, p. 137-146
|
|
|
|
Nabil, A and Mardaljevic, J (2006)
Useful daylight illuminances: A replacement for daylight factors
, Energy and Buildings, 38(7), p. 905-913
|
|
|
|
Nelder, J and Mead, R (1964)
A Simplex Method for Function Minimization
, The Computer Journal, 7(4), p. 308-313
|
|
|
|
Nocedal, J and Wright, SJ (2011)
Numerical Optimization
, Springer-Verlag New York
|
|
|
|
Powell, MJD (1994)
A Direct Search Optimization Method that Models the Objective and Constraint Functions by Linear Interpolation
, Gomez, S and Hennart, JP (eds), Advances in Optimization and Numerical Analysis, Springer-Verlag Netherlands, p. 51-67
|
|
|
|
Powell, MJD (2009)
The BOBYQA algorithm for bound constrained optimization without derivatives
, Centre for Mathematical Sciences, University of Cambridge, Cambridge
|
|
|
|
Price, WL (1983)
Global optimization by controlled random search
, Journal of Optimization Theory and Applications, 40(3), p. 333-348
|
|
|
|
Rasmussen, CE and Williams, CKI (2006)
Gaussian Processes for Machine Learning
, MIT Press, Cambridge
|
|
|
|
last changed |
2022/06/07 07:54 |
|