Corpus ID: 235795503

Algorithms for Floor Planning with Proximity Requirements

  title={Algorithms for Floor Planning with Proximity Requirements},
  author={J. Klawitter and Felix Klesen and A. Wolff},
Floor planning is an important and difficult task in architecture. When planning office buildings, rooms that belong to the same organisational unit should be placed close to each other. This leads to the following NP-hard mathematical optimization problem. Given the outline of each floor, a list of room sizes, and, for each room, the unit to which it belongs, the aim is to compute floor plans such that each room is placed on some floor and the total distance of the rooms within each unit is… Expand


Alternative approaches to solve the multi-floor facility layout problem
Abstract Alternative approaches to solve the multi-floor facility layout problem are compared in this paper. In particular, because the multi-floor facility layout problem is NP-complete, theExpand
Rectilinear Floor Plans
An algorithmic approach using graph theoretical tools for generating rectilinear floor plan layouts, while satisfying adjacency and size constraints is presented. Expand
A Graph Theoretical Approach for Creating Building Floor Plans
An algorithm is proposed that generates rectangular and, if required, orthogonal floor plans while satisfying the given adjacency requirements, and introduces circulations within a floor plan to have a required floor plan. Expand
Addressing adjacency constraints in rectangular floor plans using Monte-Carlo Tree Search
The results show the advantages of the proposed algorithm for the targeted problem of highly-dense adjacency constrained floor plan generation, which is more time-efficient, more lightweight to implement, and having a larger capacity than other approaches such as Evolution strategy and traditional on-policy search. Expand
A reduction approach for solving the rectangle packing area minimization problem
A generic approach for solving the RPAMP that is based on two algorithms, one for the 2D Knapsack Problem (KP) and the other for the2D Strip Packing Problem (SPP), and the best variants of the resulting RPAMP heuristics are combined within one procedure. Expand
Automated Generation of Dimensioned Rectangular Floorplans
The regeneration of existing legacy floorplans (corresponding to the user defined dimensions) has been demonstrated, with an additional feature to construct symmetric dimensioned solutions. Expand
A constraint-based approach for the generation of floor plans
  • Philippe Charman
  • Computer Science
  • Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94
  • 1994
A new partial consistency suited to these problems: the semi-geometric arc-consistency is defined; the method for achieving it is based on an inference by propagation rectangle label and interval label. Expand
Optimal Rectangle Packing: An Absolute Placement Approach
These algorithms represent the current state-of-the-art for this problem, outperforming other algorithms by orders of magnitude, depending on the benchmark, and introduce three new benchmarks, avoiding properties that make a benchmark easy, such as rectangles with shared dimensions. Expand
A survey on multi-floor facility layout problems
A comprehensive review on multi-floor facility problem (MFLP) is presented and basic features of the problem to capture different situations are identified and formulation approaches to address the problems and the relevant resolution methodologies are introduced. Expand
Generating Floor Plan Layouts with K-d Trees and Evolutionary Algorithms
The result is a generative mechanism that provides an interesting and promising alternative to existing well- established algorithms for the creative and evolutionary solution of layout problems in architecture and urban design. Expand