Dynamic programming is proving to be an important optimization technique used in building design. There are many design problems which prima facie do not fit the rigorous serial structure of dynamic programming. This paper describes a procedure for the solution of that class of nonserial dynamic programs which contains feedforward loops which do not intersect. The procedure condenses the various independent paths between stages by absorbing them to produce an equivalent serial structure. The method is demonstrated by solving a problem which can readily be solved by serial dynamic programming upon suitable reformulation. It is then used to design the floor-ceiling sandwich of a multi-storey building, a problem formulated with nested feedforward loops.
[1]
John S. Gero.
Note on “Synthesis and Optimization of Small Rectangular Floor Plans” of Mitchell, Steadman, and Liggett¶
,
1977
.
[2]
George L. Nemhauser,et al.
Introduction To Dynamic Programming
,
1966
.
[3]
R. Bellman.
Dynamic programming.
,
1957,
Science.
[4]
Rodolfo J. Aguilar.
Systems analysis and design in engineering, architecture, construction, and planning
,
1973
.
[5]
John S. Gero,et al.
ARCHITECTURAL OPTIMIZATION-A REVIEW
,
1975
.
[6]
John S. Gero,et al.
A DYNAMIC PROGRAMMING APPROACH TO THE OPTIMUM LIGHTING PROBLEM
,
1978
.