Heuristic Methods in Architectural Design Optimization

Similar documents
Building Information Modeling

Genetically Enhanced Parametric Design for Performance Optimization

GENETIC ALGORITHM METHOD FOR COMPUTER AIDED QUALITY CONTROL

Outline. Best-first search. Greedy best-first search A* search Heuristics Local search algorithms

Evolutionary Algorithms. CS Evolutionary Algorithms 1

White Paper. Scia Engineer Optimizer: Automatic Optimization of Civil Engineering Structures. Authors: Radim Blažek, Martin Novák, Pavel Roun

Evolutionary form design: the application of genetic algorithmic techniques to computer-aided product design

Preprocessing of Stream Data using Attribute Selection based on Survival of the Fittest

[make]shift: Information Exchange and Collaborative Design Workflows

STUDY OF THE IMPACT OF THE RAPID PROTOTYPING METHOD ON THE PERFORMANCES OF A DESIGN PROCESS

Building Information Modeling

A procedure for generating well-formed street networks

Job Shop Scheduling Problem (JSSP) Genetic Algorithms Critical Block and DG distance Neighbourhood Search

A Genetic Algorithm for Graph Matching using Graph Node Characteristics 1 2

Form Exploration and GA-Based Optimization of Lattice Towers Comparing with Shukhov Water Tower

CHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM

by Mahender Reddy Concept To Reality / Summer 2006

Escaping Local Optima: Genetic Algorithm

Genetically Enhanced Parametric Design in the Exploration of Architectural Solutions

Optimization of Tapered Cantilever Beam Using Genetic Algorithm: Interfacing MATLAB and ANSYS

Outline. Motivation. Introduction of GAs. Genetic Algorithm 9/7/2017. Motivation Genetic algorithms An illustrative example Hypothesis space search

Literature Review On Implementing Binary Knapsack problem

Architectural Geometry as Design Knowledge

Genetic Algorithms. Kang Zheng Karl Schober

HYBRID GENETIC ALGORITHM WITH GREAT DELUGE TO SOLVE CONSTRAINED OPTIMIZATION PROBLEMS

Fabrication of partially double-curved surfaces out of flat sheet material through a 3d puzzle approach

Mechanical Component Design for Multiple Objectives Using Elitist Non-Dominated Sorting GA

Industrial and Manufacturing Engineering (IME)

Genetic Programming: A study on Computer Language

SIMULATION APPROACH OF CUTTING TOOL MOVEMENT USING ARTIFICIAL INTELLIGENCE METHOD

Heuristic Optimisation

Using Genetic Algorithms to Solve the Box Stacking Problem

A GENETIC ALGORITHM APPROACH TO OPTIMAL TOPOLOGICAL DESIGN OF ALL TERMINAL NETWORKS

Autodesk Robot Structural Analysis Professional. Comprehensive analysis for your structural projects.

Dr.-Ing. Johannes Will CAD-FEM GmbH/DYNARDO GmbH dynamic software & engineering GmbH

Genetic algorithms and finite element coupling for mechanical optimization

Reducing Graphic Conflict In Scale Reduced Maps Using A Genetic Algorithm

Evolutionary Computation Algorithms for Cryptanalysis: A Study

Applied Cloning Techniques for a Genetic Algorithm Used in Evolvable Hardware Design

Chapter 8 Visualization and Optimization

Introducing Evaluation

MAE Advanced Computer Aided Design. 01. Introduction Doc 02. Introduction to the FINITE ELEMENT METHOD

International Journal of Digital Application & Contemporary research Website: (Volume 1, Issue 7, February 2013)

Evolutionary Approaches for Resilient Surveillance Management. Ruidan Li and Errin W. Fulp. U N I V E R S I T Y Department of Computer Science

A Hands-on Project approach to Teaching Solid Modeling

Autodesk Conceptual Design Curriculum 2011 Student Workbook Unit 2: Parametric Exploration Lesson 1: Parametric Modeling

EVOLVING LEGO. Exploring the impact of alternative encodings on the performance of evolutionary algorithms. 1. Introduction

Structural morphologies and sun transmittance control: integrated parametric design using genetic algorithms

Structural Engineering Training courses :

GENETIC ALGORITHM with Hands-On exercise

MAXIMUM LIKELIHOOD ESTIMATION USING ACCELERATED GENETIC ALGORITHMS

Using Database Storage to Improve Explorative Optimization of Form Critical Structures

An Introduction to Evolutionary Algorithms

Optimization of Turning Process during Machining of Al-SiCp Using Genetic Algorithm

Scuola Politecnica DIME

Vector Operations in Grasshopper

Evaluating Assemblies of Planar Parts Using the Liaison Graph and System Dynamics

DETERMINING MAXIMUM/MINIMUM VALUES FOR TWO- DIMENTIONAL MATHMATICLE FUNCTIONS USING RANDOM CREOSSOVER TECHNIQUES

Research on Applications of Data Mining in Electronic Commerce. Xiuping YANG 1, a

FRAMEWORK OF THE EXTENDED PROCESS TO PRODUCT MODELING (XPPM) FOR EFFICIENT IDM DEVELOPMENT

Fuzzy Inspired Hybrid Genetic Approach to Optimize Travelling Salesman Problem

Questions and Answers

Introduction to Genetic Algorithms. Based on Chapter 10 of Marsland Chapter 9 of Mitchell

Classification of Optimization Problems and the Place of Calculus of Variations in it

Building Information ModelingChapter1:

Heuristics in MILP. Group 1 D. Assouline, N. Molyneaux, B. Morén. Supervisors: Michel Bierlaire, Andrea Lodi. Zinal 2017 Winter School

Metaheuristic Development Methodology. Fall 2009 Instructor: Dr. Masoud Yaghini

The Parallel Software Design Process. Parallel Software Design

Genetic Algorithm (GA)

INTERACTIVE MULTI-OBJECTIVE GENETIC ALGORITHMS FOR THE BUS DRIVER SCHEDULING PROBLEM

FRAMEWORK OF THE EXTENDED PROCESS TO PRODUCT MODELING (XPPM) FOR EFFICIENT IDM DEVELOPMENT

Three-Dimensional Off-Line Path Planning for Unmanned Aerial Vehicle Using Modified Particle Swarm Optimization

EVOLUTIONARY DESIGN OF HOUSING: A template for development and evaluation procedures

A d v a n c e d I n t e r a c t i v e

Parameter Control of Genetic Algorithms by Learning and Simulation of Bayesian Networks

Search Algorithms for Regression Test Suite Minimisation

A Role-based Use Case Model for Remote Data Acquisition Systems *

Autodesk. Robot Structural Analysis Professional Welcome to the new millennium.

SAFI Sample Projects. Design of a Steel Structure. SAFI Quality Software Inc. 3393, chemin Sainte-Foy Ste-Foy, Quebec, G1X 1S7 Canada

EXPLORING STYLE EMERGENCE IN ARCHITECTURAL DESIGNS

76 ACADIA22 >> CONNECTING CROSSROADS OF DIGITAL DISCOURSE

BIM Goes to School AUTODESK REVIT BUILDING INFORMATION MODELING. BIM in the Architectural Curriculum. Savannah College of Art and Design, USA

Offspring Generation Method using Delaunay Triangulation for Real-Coded Genetic Algorithms

HONDA APPROACH TO AUTOMATE THE NV CAE PROCESS

Time Complexity Analysis of the Genetic Algorithm Clustering Method

Simulation of In-Cylinder Flow Phenomena with ANSYS Piston Grid An Improved Meshing and Simulation Approach

Cutting Process Control

Questions and Answers

High-resolution spatial and electrical modeling for efficient BIPV system design

Suppose you have a problem You don t know how to solve it What can you do? Can you use a computer to somehow find a solution for you?

MINIMIZATION OF PART WARPAGE IN INJECTION MOLDING THROUGH IDEAL WALL THICKNESS DISTRIBUTION

Slides for courses based on the textbook

Tact Optimization Algorithm of LED Bulb Production Line Based on CEPSO

Module 1 Lecture Notes 2. Optimization Problem and Model Formulation

IMECE FUNCTIONAL INTERFACE-BASED ASSEMBLY MODELING

Multi-Objective Optimization Using Genetic Algorithms

The Application of CAD/CAM in the Design of Industrial Products

Building Information Modelling for Visualisation in AEC Education

The Genetic Algorithm for finding the maxima of single-variable functions

Practical Design of Experiments: Considerations for Iterative Developmental Testing

Transcription:

Heuristic Methods in Architectural Design Optimization Monte Rosa Shelter: Digital Optimization and Construction System Design Kai Rüdenauer 1, Philipp Dohmen 2 Chair for Computer Aided Architectural Design CAAD, Prof. Dr. Ludger Hovestadt, Institute of Building Technology, Department of Architecture, Swiss Federal School of Technology, Zurich, Switzerland http://www.caad.arch.ethz.ch 1 ruedenauer@hbt.arch.ethz.ch, 2 dohmen@hbt.arch.ethz.ch This paper focuses on optimization methods and their role in the digital chain in architectural design and production. These methods were developed in the research phase of the project New Monte Rosa Shelter to improve cost efficiency and to adapt the design for the specific environmental and constructive constraints of the site. The New Monte Rosa Shelter is a project designed by students for a mountain shelter at high altitude. For transportation and construction reasons, optimization was required to minimize costs, material, and weight of the structure. For this project a series of programs using genetic algorithms were written to optimize the geometry of the wooden framework. These programs were combined to create a digital toolset, giving the architects direct output of surface information from the framing data, and allowing for output as a threedimensional model. This optimization toolset gives creative control back to the architects themselves, who can now transform and manipulate the architecture. This paper describes the overall process, and outlines one specific optimization tool, a program that enables architects to fill the wooden framework automatically with different material and construction systems and understand the cost and efficiency implications based upon the structural analysis software and the programmed heuristic methods. Keywords: Heuristics; algorithm; evolutionary strategy; digital chain; generative design; computer aided optimization. Session 11: Prediction and Evaluation - ecaade 25 507

Figure 1 Photomontage of the student design Monte Rosa Introduction and overview on the Monte Rosa project The Monte Rosa Shelter project was initially a student design course assignment and architectural competition in 2004 at the Federal Institute of Technology in Zürich (ETHZ). The task was to design a mountain shelter for 120 people on the highest mountain of Switzerland, Monte Rosa. To aid in the realization of this project a research group was formed in 2006 to research materials, fabrication methods, and construction strategies, to adapt the design for the specific environmental and physical constraints of the site, and to determine the best strategies for optimizing the cost. The concept of a digital chain was introduced to implement a continuous set of data and processes within the project, and ensure that all of the project participants are working collaboratively. The individual steps of this digital chain were developed by the Chair of Computer Aided Architectural Design (CAAD). The research group consisted of Prof. Andrea Deplazes, Chair of Architecture and Technology, Prof. Dr. Ludger Hovestadt, Chair of Computer-Aided Architectural Design (CAAD) and Prof. Sacha Menz, Chair of Architecture and Building Management. Digital design translation - the rubber band model The initial step to prepare the project for optimization was to transfer the project geometry and parameters into usable data structures. The project geometry and data was digitized and the subsequent data set imported into a software program (written by Markus Braach) which represents the design as a series of parametric relations. This program enabled the architect to manipulate and visualize the basic design, both exterior and interior, and have simultaneous feedback on the important parametrically Figure 2 Screenshots of the software to manipulate the volume outline of the design 508 ecaade 25 - Session 11: Prediction and Evaluation

associated features. Exterior modifications affected issues such as structure, surface, wall section and thickness, while interior modifications of affected usability issues such as total number of beds. The program thusly balanced the substantial building parameters against the overall site and program requirements, acting like a tension system equalizing the parameters of the design (like a rubber band). This program gave to the designers, an overview of the impact of each change and allowed real time evaluation of appropriateness, efficiency, and also a rough cost estimate. The defined geometry of surfaces (walls) were then exported as an edge-node model to the next step of the digital chain. At this stage the surfaces are defined and evaluated with different material assemblies, and the wooden framework can then be optimized using heuristic methods. Heuristic algorithms the genetic algorithm Heuristic algorithms are mathematical representations of simple, strategy based, rule systems. A heuristic algorithm will try to follow a simple set of rules to return a specific solution, but it cannot guarantee that the best solution will be found. As a result a heuristic algorithm based program may only be considered as an approximate solution finder. Heuristic algorithms are used to find an acceptable solution and find it with minimal computing time. The benefit of the Heuristic algorithm is that it is efficient and can be used for real time representations; the disadvantage is that it does not guarantee the best solution in all cases. For certain multi-parametric tasks there are no clear analytic solutions. For such tasks one can try to determine a solution using an optimization algorithm. But there are differently algorithmic strategies. Genetic algorithms (GA) are optimization procedures which take the biological evolution as model. In nature organisms adapt to their environmental context through evolution of their genetic constitution. This adjustment process is directed by three basic principles: natural selection, recombination of the hereditary characteristics, and mutation. A similar model can be represented in software programming. GA programs optimize an initialized set of individuals using similar symbolic steps: evaluation and selection, recombination, mutation. During initialization, quantities of dissimilar individual solutions are produced; similarly to nature it is important for a successful evolution that the population is sufficiently large. The solutions are then evaluated based on a series of fitness criteria and selections are made by the programmed fitness function. The more fit a solution is, the higher the probability that the solution will be selected to survive. The next step serves to propagate the population through recombination of the hereditary characteristics. Recombination composes new individuals from the genomes of the good solutions. Mutation functions also exist to allow for diversification of the population and the formation of variants. Mutations prevent the emergence of local optima and ensure diversification for the next cycle. This three step process is then repeated, with each cycle representing one step of the evolution. The process is cyclical and continuous until an either an abort criteria is reached or the system achieves an equilibrium where every new variant is less fit than the existing population. The Monte Rosa problem The chosen architectural design for the shelter consists of a wooden frame structure and exterior panelization. The entire construction must be optimized to reduce the weight, as the only realizable method of transportation for large materials to the site, is to be lifted by helicopter. A significant cost optimized can therefore be achieved using lightweight, prefabricated wooden framework and a prefabricated wall panel system, thereby saving costs of material, waste, transport, and reducing assembly time in a difficult to access location. Session 11: Prediction and Evaluation - ecaade 25 509

Figure 3 Possible Fill Style variations of the wooden framework Initialization After the first rubber band design manipulation, the resulting geometry is processed by a program (written by Kai Rüdenauer) to determine the structural geometry of the timber framework. The architect can use the program to specify different subdivision fill styles on the different vertical faces (interior and external walls, ceilings and floors, walls of the internal core). Figure 4 Bottom view of two different framework solutions. For clarity only the exterior wall faces are illustrated, the nodes in the center mark the core of the interior structure. Filled facade panels with randomly placed beams (left); Filled faces with timber framing which integrates the windows (right) 510 ecaade 25 - Session 11: Prediction and Evaluation

Figure 5 Screenshot of the Monte Rosa shelter produced using the structural analysis software RSTAB The architect can choose a timber framing which integrates a window (a), a framework over the entire field (b), a framework over the entire field with king post truss (c), a timber framing with two diagonal studs (d), triangulation studs (c) and a timber framing with randomly placed studs (f). The best initialization type for the framework is to fill each face with a random number of beams, resulting in a larger variety between individual of the first generation. This generates a larger genome pool, reinforcing the probability of finding optimal solutions. Evaluation of each generation The initial generated framework was exported into the structural analysis software RSTAB, which simulates the framework under static load testing. The structure is exposed to different load cases, such as wind, snow, working load, and self-weight. During the simulation the behavior of each single beam and joint is determined and recorded. After the determination of the whole structure, all axial forces and all bending moments of each beam are stored in a data structure (comma separated value file) which can be read back in to the software. The results from the analysis are reintroduced to the optimization cycle, and are used to evaluate the fitness criteria. Fitness criteria The fitness criteria of each structural component are based on the load and type of force carried by each beam in the wooden framework. Every structural part should bear its maximum (safe) load. This avoids any over-sizing of the structural elements, and results in economies of weight, cost, and transport. With this primary constraint all unnecessary beams are eventually deleted, and the overall structure is reduced to an optimized minimum over the evolution of the process. For example: A beam which carries its maximum load it is validated with an excellent fitness rating. If a beam is bearing a load over or under its maximum load it is validated with a lesser fitness. The fitness criteria of a beam is also influenced by the amount Session 11: Prediction and Evaluation - ecaade 25 511

of material required compared to the specific planar face. A face where all beams take their maximum load, will be more valued if it uses less material. After the validation, each face of the structure has its own fitness rating and the combination of the structure and the face values creates an overall fitness evaluation. The actual calculation of fitness is based on engineering simulation data and the heuristic rule set developed for the project. Selection and recombination To prepare the individuals for the next generation the different models are ranked. The higher a fitness of an individual is, the higher is the degree of a probability for a recombination with another individual of the same generation. This rule ensures that even poorly ranked framework have the possibility for recombination. Individuals are recombined by merging the structural detailing from the face of each model (parent) to a new face (child). There are two strategies to merge two faces. One is to translate fifty percent of each filling style and combine the geometries into a single face. The second method is to analyze the two fillings styles and to mediate the positions of the beams as an average of the two styles combined. Mutation A face is mutated by randomly inserting or removing a beam from the filling. The number of beams can only be reduced to a minimum of one, but can be augmented to a local maximum depending on the geometry and dimensions of the face. Abort criteria and tuning The optimization process is programmed to stop either after a predefined number of generations, or if a solution is found via the algorithm that satisfies a predetermined criteria. Too many parameters or parametric variance require many more iterations to optimize a problem. As such, it is worth tuning the influencing parameters (such as the mutation probability, recombination probability and population size), so as to find reasonable settings for the scope of the problem. A very small mutation rate may lead or premature convergence of the genetic algorithm into a local optimum. A high mutation rate may lead to a loss of good solutions due to genetic drift. There are theoretical but not yet practical upper and lower bounds for parameters that can help to guide through the selection. To find the right settings is perhaps one of the most difficult tasks after the implementation of the algorithm. For this project the abort criteria were to stop the program once the structural weight to load capacity ratio hit equilibrium, and became adequate based on cost estimations. Optimization and export of the evaluated solution The final phase of the process is to run the GA on the geometry model and produce the structural design. To do this the program is required to interface with existing engineering software. The data was provided as a geometry file and translated to XML, VectorScript, and as an import file for RSTAB. The RSTAB data enabled the continuation of the digital chain and export of the 3D model and to all static load environments of the structure into Cadwork; an industry standard software for timber construction engineering. The structural analysis software allows for objective and traceable evaluation of each individual model and component. Result Each model cycle of the GA (recombination, mutation, selection and validation) could be calculated in an acceptable time of 40 to 60 seconds. The optimization began with a minimum number of forty individual components and each full evolution of the structure required approximately one hour to calculate. 512 ecaade 25 - Session 11: Prediction and Evaluation

Figure 6 Timber framework of the student design (left); timber framework with king post truss (right) in the structural analysis software RSTAB Compared with the original timber framework (as designed in the students design), the resulting optimized structure is approximately 30% lighter. Conclusion and discussion The Monte Rosa Project provided our research team with an ideal basis under which to develop these optimization programs. The combination of clear goal parameters and a minimal architectural design upon which to apply them, allowed us to develop an equally clear and consistent methodology. The opportunities for geometry optimization in architecture are clear, in the reduction of material, waste, and cost, but the use of such programming can also have an effect on the production of architecture; allowing for more expressive and interesting structures to be built. Using the digital chain concept for such a project provides additional advantages. The use of programmed software to describe geometry allows for automated generation of the component drawings. To draw or even to transfer such an illustration of a design in a conventional way into a CAD program opens up the possibility of error, and is time consuming. Any down wind change in the geometry of the building would consume a lot of time in reworking all of the associated CAD representations. With the described automated filling of the faces, new models or iterations can be updated in minimal time. As such it is easy to provide variations of the wooden structure by simply changing the fill style. The software developed provides unique opportunities to both the architect and the structural engineer; to review many solutions in a very efficient manner. The processes outlined in this paper allow for a close inspection of the structure, and allow the components to be dimensioned based on loading rather than standardized on the individually most loaded element. The combination of a GA with structural engineering software has created a positive feedback loop, providing for refinement of the design, but also allowing for advantages of measurability. Additional research and work is still required to develop a strategy for tuning the GA and parameters, but overall the process of optimization through GA is a success. By giving the structural engineer access to this information the structure can be dimensioned rationally, instead of using a highly reduced and abstracted model. The application of such optimization programs is reasonable in projects where the structure and Session 11: Prediction and Evaluation - ecaade 25 513

geometry can be described with a minimum of parameters, however algorithmic optimization is not limited to only the structure of a project. GA programming has been used in the architectural design of forms, architectural layout, landscape, and urban design. The manufacturing data of the timber framework is simplified by choosing a fabricator who is also responsible for the engineering of the connection details. This minimizes requirements for multiple shop drawings and used the digital chain to directly move into the fabrication process allowing for additional savings. The specification of the static loads for each piece is one of the basic data elements passed along the digital chain. By providing the overall geometry, and the load information it is possible for the fabricator to engineer the fixing and assembly patterns for each piece. The results is that the fabricator is responsible for the assembly detailing, not specified by the architect or engineer, but described heuristically only by the load data and the style guide. This process allows for the detailed production data to be generated based on the results of the overall process. This process is also an economic decision The intersection of CAD/CAM software with construction allows for high control over geometry and its physical production. The building industry, for the moment need not completely retool their production methods for buildings using these technologies, like the Monte Rosa shelter. This project is a one-off occurrence, due mostly to the interesting parameters of its site. However, there is much from this project that can migrate to real-world commercial construction. Participants in the Monte Rosa project at Chair for CAAD: Markus Braach, Philipp Dohmen, Kai Rüdenauer Structural engineer consultant: Dr.-Ing. Klaus Kreher Editing, technical writing, and translation: Russell Loveridge, Laboratory for Architectural Production, LAPA - EPFL References Dohmen, Philipp: 2007, Digital Chains in Modern Architecture, ecaade 2007. Raphael, B. and Smith, I.F.C: 2003, Fundamental of Computer Aided Engineering, John Wiley& Sons. UK. (GA- page 171) (Heuristic definition page 191). Acknowledgments Chair for CAAD of the ETH Zurich, Professor Dr. Ludger Hovestadt http://www.caad.arch.ethz.ch http://wiki.arch.ethz.ch/twiki/bin/view/extern/ MonteRosa 514 ecaade 25 - Session 11: Prediction and Evaluation