Block Recycling Optimization Algorithm

In support of the final thesis project, the exercise in this workshop was developed to learn the logic and technical aspect to design an algorithm using grasshopper.

Tools

Data retrieved from: Carto BCN                                                                                                                              Method used: Grasshopper optimization and Rhino 6                                                                                              Plug-ins: Urbano

Methods

Using the catalogue of a neighborhood scale anaerobic digestor developed in [barRi]cycle thesis project, the components were compiled into two groups. Each component group are configured to have a minimum footprint and to be placed in specific areas within a Barcelona Block.

These areas are the underground spaces for component group 1 and the block interior patios for the component group 2. A block from Eixample distrist was used as a case study, and the shapefiles of the block’s building underground and interior patios was extracted.

The algorithm is designed to optimize the footprint rectangular shape of the component group by keeping the same area. A set of other regulations are applied such as minimum distance between both component groups for a minimum cost, closest distance to the periphery of the block for accessibility and maintenance reasons and farthest distance of component group 2 to the surrounding buildings for safety reasons. The outcome displayed the optimum configuration of a neighborhood scale anaerobic digestion in a block with minimum cost and maximum efficiency.

Outcome

Block Recycling Optimization Algorithm is a project of IaaC, Institute for Advanced Architecture of Catalonia developed at Master in City & Technology 02 in (2019/2020) by:
Students: Sarine Bekarian
Faculties: Eduardo Rico