id 
fcb4 
authors 
Loemker, Thorsten Michael 
year 
2006 
title 
Solving RevitalizationProblems by the Use of a Constraint Programming Language 
source 
IKM 2006, International Conference on the Applications of Computer Science and Mathematics in Architecture and Civil Engineering, Weimar, July 2006 
summary 
This research focuses on an approach to describe principles in architectural layout planning within the domain of revitalization. With the aid of mathematical rules, which are executed by a computer, solutions to design problems are generated. Provided that “design” is in principle a combinatorial problem, i.e. a constraintbased search for an overall optimal solution of a problem, an exemplary method will be described to solve such problems in architectural layout planning. To avoid conflicts relating to theoretical subtleness, a customary approach adopted from Operations Research has been chosen in this work [1]. In this approach, design is a synonym for planning, which could be described as a systematic and methodical course of action for the analysis and solution of current or future problems. The planning task is defined as an analysis of a problem with the aim to prepare optimal decisions by the use of mathematical methods. The decision problem of a planning task is represented by an optimization model and the application of an efficient algorithm in order to aid finding one or more solutions to the problem. The basic principle underlying the approach presented herein is the understanding of design in terms of searching for solutions that fulfill specific criteria. This search is executed by the use of a constraint programming language. 
keywords 
Revitalization, Optimization, Constraint Programming, OPL 
series 
other 
type 
short paper 
email 
thorsten.loemker@tudresden.de 
more 
http://euklid.bauing.uniweimar.de/ikm2006cd/data/templates/papers/f26.pdf 
full text 
file.pdf (1,854,072 bytes) 
references 
Contenttype: text/plain

last changed 
2008/10/13 12:02 
