A Genetic Programming Approach To The Space Layout Planning Problem (1997) [3 citations — 0 self]
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Romuald Jagielski and John and John S. Gero},
title = {A Genetic Programming Approach To The Space Layout Planning Problem},
journal = {CAAD Futures},
year = {1997},
volume = {875},
pages = {875--884}
}
Bookmarks
OpenURL
Abstract:
. The space layout planning problem belongs to the class of NP-hard problems with a wide range of practical applications. Many algorithms have been developed in the past, however recently evolutionary techniques have emerged as an alternative approach to their solution. In this paper, a genetic programming approach, one variation of evolutionary computation, is discussed. A representation of the space layout planning problem suitable for genetic programming is presented along with some implementation details and results. 1. Introduction Algorithmic solutions of spatial allocation problems were first developed more than thirty years ago. In this paper we discuss space layout planning formulated as a quadratic assignment problem. This is a difficult combinatorial optimisation problem of great importance, reaching beyond formal architectural design. Lately, such spatial allocation problems have again attracted attention, yielding solutions which employed genetic algorithms (Jo and Gero...
Citations
| 5180 | Genetic Algorithms – Goldberg - 1989 |
| 1428 | Genetic algorithms + data structures = evolution programs – Michalewicz - 1992 |
| 713 | Genetic Programming – Koza - 1992 |
| 44 | A genetic approach to the quadratic assignment problem – Tate, Smith - 1995 |
| 10 | Space layout planning using an evolutionary approach – Jo, Gero - 1998 |
| 6 | Optimal spatial arrangement as a quadratic assignment problem – Liggett - 1985 |
