Abstract
The architectural layout design problem, which is concerned with the finding of the best adjacencies between functional spaces among many possible ones under given constraints, can be formulated as a combinatorial optimization problem and can be solved with an Evolutionary Algorithm (EA). We present functional spaces and their adjacencies in form of graphs and propose an EA called EvoArch that works with a graph-encoding scheme. EvoArch encodes topological configuration in the adjacency matrices of the graphs that they represent and its reproduction operators operate on these adjacency matrices. In order to explore the large search space of graph topologies, these reproduction operators are designed to be unbiased so that all nodes in a graph have equal chances of being selected to be swapped or mutated. To evaluate the fitness of a graph, EvoArch makes use of a fitness function that takes into consideration preferences for adjacencies between different functional spaces, budget and other design constraints. By means of different experiments, we show that EvoArch can be a very useful tool for architectural layout design tasks.
| Original language | English |
|---|---|
| Pages (from-to) | 649-667 |
| Number of pages | 19 |
| Journal | CAD Computer Aided Design |
| Volume | 41 |
| Issue number | 9 |
| DOIs | |
| Publication status | Published - 1 Sept 2009 |
Keywords
- Architectural space topology
- Crossover
- Evolutionary algorithm
- Genetic algorithm
- Graph algorithm
- Mutation
ASJC Scopus subject areas
- Computer Science Applications
- Computer Graphics and Computer-Aided Design
- Industrial and Manufacturing Engineering