@article{KoenigStandfestSchmitt, author = {K{\"o}nig, Reinhard and Standfest, Matthias and Schmitt, Gerhard}, title = {Evolutionary multi-criteria optimization for building layout planning: Exemplary application based on the PSSA framework}, series = {32nd eCAADe Conference - Volume 2}, journal = {32nd eCAADe Conference - Volume 2}, editor = {Thompson, Emine Mine}, doi = {10.25643/bauhaus-universitaet.2513}, url = {http://nbn-resolving.de/urn:nbn:de:gbv:wim2-20160121-25139}, pages = {567 -- 574}, abstract = {When working on urban planning projects there are usually multiple aspects to consider. Often these aspects are contradictory and it is not possible to choose one over the other; instead, they each need to be fulfilled as well as possible. Planners typically draw on past experience when subjectively prioritising which aspects to consider with which degree of importance for their planning concepts. This practice, although understandable, places power and authority in the hands of people who have varying degrees of expertise, which means that the best possible solution is not always found, because it is either not sought or the problem is regarded as being too complex for human capabilities. To improve this situation, the project presented here shows the potential of multi-criteria optimisation algorithms using the example of a new housing layout for an urban block. In addition it is shown, how Self-Organizing-Maps can be used to visualise multi-dimensional solution spaces in an easy analysable and comprehensible form.}, subject = {Architektur}, language = {en} } @article{KoenigKnecht, author = {K{\"o}nig, Reinhard and Knecht, Katja}, title = {Comparing two evolutionary algorithm based methods for layout generation: Dense packing versus subdivision}, series = {Artificial Intelligence for Engineering Design, Analysis and Manufacturing}, journal = {Artificial Intelligence for Engineering Design, Analysis and Manufacturing}, pages = {285 -- 299}, abstract = {We present and compare two evolutionary algorithm based methods for rectangular architectural layout generation: dense packing and subdivision algorithms.We analyze the characteristics of the two methods on the basis of three floor plan sce- narios. Our analyses include the speed with which solutions are generated, the reliability with which optimal solutions can be found, and the number of different solutions that can be found overall. In a following step, we discuss the methods with respect to their different user interaction capabilities. In addition, we show that each method has the capability to generate more complex L-shaped layouts. Finally,we conclude that neither of the methods is superior but that each of them is suitable for use in distinct application scenarios because of its different properties.}, subject = {Architektur}, language = {en} }