| id |
caadria2020_258 |
| authors |
Beatricia, Beatricia, Indraprastha, Aswin and Koerniawan, M. Donny |
| year |
2020 |
| title |
Revisiting Packing Algorithm - A Strategy for Optimum Net-to Gross Office Design |
| source |
D. Holzer, W. Nakapan, A. Globa, I. Koh (eds.), RE: Anthropocene, Design in the Age of Humans - Proceedings of the 25th CAADRIA Conference - Volume 1, Chulalongkorn University, Bangkok, Thailand, 5-6 August 2020, pp. 405-414 |
| doi |
https://doi.org/10.52842/conf.caadria.2020.1.405
|
| summary |
Net-to-gross efficiency is defined as the ratio of net area to a gross area of a building. Net-to-gross efficiency will determine the quantity of leasable building area. On the other side, the effectiveness of the spatial distribution of a floor plan design must follow the value of net-to-gross efficiency. Therefore in the context of office design, there are two challenges need to be improved: 1) to get an optimum value of efficiency, architects need to assign the amount and size of the office units which can be effectively arranged, and 2) to fulfill high net-to-gross efficiency value that usually set out at minimal 85%. This paper aims to apply the packing algorithm as a strategy to achieve optimum net-to-gross efficiency and generating spatial configuration of office units that fit with the result. Our study experimented with series of models and simulations consisting of three stages that start from finding net-to-gross efficiency, defining office unit profiles based on preferable office space units, and applying the packing algorithm to get an optimum office net-to-gross efficiency. Computational processes using physics engine and optimization solvers have been utilized to generate design layouts that have minimal spatial residues, hence increasing the net-to-gross ratio. |
| keywords |
net-to-gross efficiency; packing algorithm; modular office area; area optimization; |
| series |
CAADRIA |
| email |
aswin@itb.ac.id |
| full text |
 file.pdf (12,223,407 bytes) |
| references |
Content-type: text/plain
|
Alajmi, Ali and Wright, Jonathan (2014)
 Selecting The Most Efficient Genetic Algorithm Sets in Solving Unconstrained Building Optimization Problem
, International Journal of Sustainable Built Environment, 3(1), pp. 18-26
|
|
|
|
|
Chiara, Joseph de (1980)
Time Saver Standards for Building Types
, McGraw-Hill
|
|
|
|
|
Dong, Hong, Fadel, Georges and Blouin, Vincent (2005)
Packing Optimization by Enhanced Rubber Band Analogy
, ASME 2005 International Design Engineering Technical Conferences and Computers and Information in Engineering
|
|
|
|
|
Duffy, Francis, Cave, Collin and Worthington, John (1976)
Planning Office Space
, Architectural Press, London
|
|
|
|
|
El Daly, Hazem M. Talaat (2009)
Revisiting Algorithms in Architectural Design: Towards New Computational Methods
, Ph.D. Thesis, Ain Shams University Faculty of Engineering Department of Architecture
|
|
|
|
|
Goldberg, D.E. (1989)
Genetic Algorithms in Search, Optimization, and Machine Learning
, Addison-Wesley Longman
|
|
|
|
|
Keshav, Anand (2013)
Effects of Core Design Form on Rentable Spaces of A High Rise Office Building.
, The Relationship Between Structural System, Core and Rentable Spaces of a High Rise Office Building, Bhopal, India
|
|
|
|
|
Leu, Sou-Sen and Yang, Chung-Huei (1999)
GA-Based Multicriteria Optimal Model for Construction Scheduling
, Journal of Construction Engineering and Management, 126(6), pp. 420-427
|
|
|
|
|
M., Fadel, G. and A., Sinha (2001)
Packing Optimization Using a Rubber band Analogy
, ASME, DETC
|
|
|
|
|
Sev, Aysin and Ozgen, Aydan (2008)
Space Efficiency in High-Rise Office Building
, METU Journal of the Faculty of Architecture, 26(2), pp. 69-89
|
|
|
|
| last changed |
2022/06/07 07:54 |
|
