| authors |
Jagielski, Romuald and Gero, John S. |
| year |
1997 |
| title |
A Genetic Programming Approach to the Space Layout Planning Problem |
| source |
CAAD Futures 1997 [Conference Proceedings / ISBN 0-7923-4726-9] München (Germany), 4-6 August 1997, pp. 875-884 |
| summary |
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. |
| series |
CAAD Futures |
| email |
|
| full text |
 file.pdf (49,491 bytes) |
| references |
Content-type: text/plain
|
Goldberg, D.E. (1989)
 Genetic Algorithms in Search, Optimization, and Machine Learning
, Addison-Wesley, Reading
|
|
|
|
|
Jo, J.H. and Gero, J.S. (1997)
Space layout planning using an evolutionary approach
, Artificial Intelligence in Engineering (to appear)
|
|
|
|
|
Koza, J. (1992)
Genetic Programming
, NBT Press, Cambridge, MA
|
|
|
|
|
Liggett, R.S. (1985)
Optimal spatial arrangement as a quadratic assignment problem
, J. S. Gero (ed), Design Optimization, Academic Press, New York, pp. 1-40
|
|
|
|
|
Michalewicz, Z. (1994)
Genetic Algorithms + Data Structures = Evolution Programs
, Springer-Verlag, Berlin
|
|
|
|
|
Tate, D.M. (1995)
A genetic approach to the quadratic assignment problem
, Computers Opns Res. 22: 1, 73-83
|
|
|
|
| last changed |
2003/02/23 11:00 |
|
