Hostname: page-component-74656f9884-6grmk Total loading time: 0 Render date: 2026-11-06T10:06:43.384Z Has data issue: false hasContentIssue false

A fast genetic algorithm for solving architectural design optimization problems

Published online by Cambridge University Press:  07 October 2015

Zhouzhou Su
Affiliation:
Department of Architecture, Texas A&M University, Texas A&M University, College Station, Texas, USA
Wei Yan*
Affiliation:
Department of Architecture, Texas A&M University, Texas A&M University, College Station, Texas, USA
*
Reprint requests to: Wei Yan, Department of Architecture, Langford A 406, Texas A&M University, College Station, TX 77843, USA. E-mail: wyan@tamu.edu
Rights & Permissions [Opens in a new window]

Abstract

Building performance simulation and genetic algorithms are powerful techniques for helping designers make better design decisions in architectural design optimization. However, they are very time consuming and require a significant amount of computing power. More time is needed when two techniques work together. This has become the primary impediment in applying design optimization to real-world projects. This study focuses on reducing the computing time in genetic algorithms when building simulation techniques are involved. In this study, we combine two techniques (offline simulation and divide and conquer) to effectively improve the run time in these architectural design optimization problems, utilizing architecture-specific domain knowledge. The improved methods are evaluated with a case study of a nursing unit design to minimize the nurses’ travel distance and maximize daylighting performance in patient rooms. Results show the computing time can be saved significantly during the simulation and optimization process.

Information

Type
Special Issue Articles
Copyright
Copyright © Cambridge University Press 2015 
Figure 0

Fig. 1. The trade-off between fidelity and computational cost (adapted from Jin, 2011).

Figure 1

Fig. 2. The constant parameters in a possible layout solution.

Figure 2

Fig. 3. (Left) The daylight illuminance subfitness function is nonlinear. (Right) The travel distance subfitness function is nonlinear.

Figure 3

Fig. 4. Unit layouts with the (left) shortest travel distance and (right) furthest travel distance.

Figure 4

Fig. 5. The floor plan is divided into four sections in order to determine the priority of window-opening directions. The windows’ locations are indicated in the figure as dark line segments on the edges of the rooms.

Figure 5

Fig. 6. The traditional genetic algorithm optimization workflow.

Figure 6

Fig. 7. The improved genetic algorithm optimization workflow with offline simulation.

Figure 7

Fig. 8. The working process of the nursing unit layout optimization with the divide and conquer method.

Figure 8

Fig. 9. The final results of the nursing unit layout optimization with different weights in the fitness functions: (left) fitness travel distance: fitness daylighting = 1:1 and (right) fitness travel distance: fitness daylighting = 1:2.

Figure 9

Table 1. Comparison between standard GA and improved GAs