Architectural layout design optimization

Engineering Optimization

Volumn 34, Issue 5, 2002, Pages 461-484

  Michalek, Jeremy J ^a   Choudhary, Ruchi ^a   Papalambros, Panos Y ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Architectural design; Floorplan; Layout; Optimization

Indexed keywords

ALGORITHMS; ARCHITECTURAL DESIGN; DECISION MAKING; GRADIENT METHODS; PROBLEM SOLVING;

FLOORPLAN; LAYOUT;

OPTIMIZATION;

EID: 0036753503     PISSN: 0305215X     EISSN: None     Source Type: Journal    
DOI: 10.1080/03052150214016     Document Type: Article

References (31)

1. Michalek, J. (2001). Interactive layout design optimization. MS thesis, University of Michigan.
2. Michalek, J. and Papalambros, P. Y. (2002) Interactive design optimization of architectural layouts. Engineering Optimization (this issue).
3. Levin, P. H. (1964). Use of graphs to decide the optimum layout of buildings. Architect, 14, 809-815.
4. Liggett, R. S. and Mitchell, W. J. (1981). Optimal space planning in practice. Computer-Aided Design, 13(5), 277-288.
5. Sharpe, R., Marksjo, B. S., Mitchell, J. R. and Crawford, J. R. (1985). An interactive model for the layout of buildings. Applied Mathematical Modeling, 9, 207-214.
6. Jo, J. H. and Gero, J. S. (1998). Space layout planning using an evolutionary approach. Artificial Intelligence in Engineering, 12, 149-162.
7. Jagielski, R. and Gero, J. S. (1997). A genetic programming approach to the space layout planning problem. CAAD Futures, 875-884.
8. Baykan, C. A. and Fox, M. S. (1997). Spatial synthesis by disjunctive constraint satisfaction. Artificial Intelligence in Engineering Design, 11, 245-262.
9. Schwarz, A., Berry, D. M. and Shaviv, E. (1994). Representing and solving the automated building design problem. Computer-Aided Design, 26(9), 689-698.
10. Medjdoub, B. and Yannou, B. (1999). Separating topology and geometry in space planning. Computer-Aided Design, 32, 39-61.
11. Yin, S. and Cagan, J. (2000). An extended pattern search algorithm for three-dimensional component layout. Transactions of the ASME, 122, 102-108.
12. Cagan, J., Degentesh, D. and Yin, S. (1998). A simulated annealing-based algorithm using hierarchical models for general three-dimensional component layout. Computer-Aided Design, 30(10), 781-790.
13. Szykman, S. and Cagan, J. (1997). Constrained three-dimensional component layout using simulated annealing. ASME Transactions, 119, 28-35.
14. Choo, H. J. and Tommelein, I. D. (1999). Space scheduling using flow analysis. Proc. Seventh Annual Conference of the International Group for Lean Construction, 299-312.
15. Rong, B. (1997). Automated generation of fixture configuration design. Journal of Manufacturing Science and Engineering, 119, 208-219.
16. Koide, T. and Wakabayashi, S. (1999). A timing-driven floorplanning algorithm with the Elmore delay model for building block layout. Integration, the VLSI Journal, 27, 57-76
17. Wang, Y. and Wu, H. (1998). Method of constraint graphs used in spatial layout. Ruan Jian Xue Bao Journal of Software, 9(3), 200-205.
18. Ito, T. (1999). A genetic algorithm approach to piping route path planning. Journal of Intelligent Manufacturing, 10, 103-114.
19. Fadel, G. M., Sinha A. and McKee, T. (2001). Packing optimisation using a rubberband analogy. Proceedings of DETC'01 2001, ASME Design Engineering Technical Conferences, DETC2001/DAC-21051.
20. Kim, J. J. and Gossard, D. C. (1991). Reasoning on the location of components for assembly packaging. Journal of Mechanical Design, Transactions of the ASME, 113(4), 402-407.
21. Chapman, C. D., Saitou, K. and Jakiela, M. J. (1994). Genetic algorithms as an approach to configuration and topology Design. Journal of Mechanical Design, Transactions of the ASME, 116(4), 1005-1012.
22. Papalambros, P. Y. and Wilde, D. J. (2000). Principles of Optimal Design-Modeling and Computation, 2nd ed. Cambridge University Press, Cambridge, England.
23. Kott, G. J. and Gabriele, G. (1998). A tunnel based method for mixed discrete constrained nonlinear optimization. ASME Design Automation Conference, DETC98/DAC-5592.
24. Kott, G. J. (1998). A method for mixed variable constrained nonlinear optimization based on a new function bounding technique. PhD thesis, Rensselaer Polytechnic Institute.
25. Zhou, J. L. and Tits, A. L. (1995). An SQP algorithm for finely discretized continuous minimax problems and other minimax problems with many objective functions. SIAM Journal of Optimization, 6, 461-487.
26. Lawrence, C. T., Zhou, J. L. and Tits, A. (1995). User's guide for CFSQP version 2.3: A C code for solving large scale constrained nonlinear minimax optimization problem, generating iterates satisfying all inequality constraints. Institute for Systems Research, University of Maryland, Technical Report TR-94-16r1.
27. Bartak, R. (1999). Constraint programming: In pursuit of the Holy Grail. http://kti.ms.mff.cuni.cz/~bartak/constraints
28. Wall, M. (1996). GAlib: A C + + library of genetic algorithm components-Version 2.4 -Document revision B. galib-request@mit.edu, http://lancet.mit.edu/ga/dist/galibdoc.pdf
29. Bentley, P. J. (1999). Evolutionary Design by Computers. Morgan Kaufmann Publishers, Inc., San Francisco, CA.
30. ASHRAE (1997). Fundamentals. American Society of Refrigeration, Heating and Air-conditioning Engineers, Atlanta, GA.
31. IESNA (1998). IESNA Lighting Education: Intermediate Level. Illumination Engineers Society of North America.