Cumincad : CUMINCAD Papers : Search Results

CumInCAD is a Cumulative Index about publications in Computer Aided Architectural Design
supported by the sibling associations ACADIA, CAADRIA, eCAADe, SIGraDi, ASCAAD and CAAD futures

PDF papers
References

Hits 1 to 2 of 2

Reformat results as: short short into frame detailed detailed into frame

_id	caadria2006_179
id	caadria2006_179
authors	KEATRUANGKAMALA K., NILKAEW P.
year	2006
title	STRONG VALID INEQUALITY CONSTRAINTS FOR ARCHITECTURAL LAYOUT DESIGN OPTIMIZATION
source	CAADRIA 2006 [Proceedings of the 11th International Conference on Computer Aided Architectural Design Research in Asia] Kumamoto (Japan) March 30th - April 2nd 2006, 179-185
doi	https://doi.org/10.52842/conf.caadria.2006.x.w5d
summary	In the past decades, many attempts have been made to solve the challenging architectural layout design problem such as non-linear programming and evolutionary algorithm (Michalek and Papalambros, 2002). The Mixed Integer Programming (MIP) (Kamol and Krung, 2005) was recently developed to find the global optimal solution. However, the problem can be shown to belong to the class of NP-hard problem (Michalek and Papalambros, 2002). Hence, only the small instances of the problem can be solved in a reasonable time. In order to deal with large problem sizes, this paper utilizes the strong valid inequalities (George and Laurence). It cut off the infeasible points in the integral search space by formulated the disconnected constraints involved with line configurations of three rooms. It is shown to significantly increase the computational speed to more than thirty percents. This exhibits the practical use of the MIP formulation to solve the medium size architectural layout design problems.
series	CAADRIA
email
last changed	2022/06/07 07:49

_id	cf2005_1_38_111
id	cf2005_1_38_111
authors	KEATRUANGKAMALA Kamol and SINAPIROMSARAN Krung
year	2005
title	Optimizing Architectural Layout Design via Mixed Integer Programming
source	Computer Aided Architectural Design Futures 2005 [Proceedings of the 11th International Conference on Computer Aided Architectural Design Futures / ISBN 1-4020-3460-1] Vienna (Austria) 20–22 June 2005, pp. 175-184
summary	For many decades, solving the optimal architectural layout design is unattainable for the reasonable problem sizes. Architects have to settle for acceptable layouts instead of the favourable optimal solution. With today technologies, various optimization techniques have been used to alleviate the optimal search according to diversified goals. This paper formulates the optimal architectural layout design as the multiobjective mixed integer programming model solved by the MIP solver. The main idea is to capture functional constraints, dimensional constraints and the objective function using only linear formulae with binary variables. Functional constraints are the connectivities, the unused grid cells, the fixed room location, the boundary and the fixed border location while dimension constraints are the non-intersecting, the overlapping, the length and the ratio constraints. The objective function is designed to minimize the absolute distance among rooms and maximize room spaces. Due to the nonlinearity of area computation, the linear approximation of width and height constraints have been utilized. Architects can control these different objectives within the model. By specifying the rigid restriction and the time limits, the problem can be solved within a reasonable amount of time.
keywords	layout design, linear programming, mixed integer programming, optimization
series	CAAD Futures
email
last changed	2006/11/07 07:27

No more hits.