抄録
An optimal space partitioning method is proposed based on rectangular duals of planar graphs and a simulated annealing algorithm. The layout problem, in which a region should be partitioned into plural subregions of layout components so as to satisfy relationships between neighbors and size conditions for a whole region and respective subregions, occurs in several layout designs. Such layout problems are characterized by the combinatorial property on topological structure among subregions. In our method, rectangular duals of planar graphs are used for representing such a structure, and it is optimized through a simulated annealing algorithm. In the annealing process, topological layouts represented by rectangular duals of planar graphs are manipulated with rules, each of them is embodied into an actual layout using the generalized reduced gradient method which is one of the numerical optimization techniques for constrained nonlinear optimization problems. Finally, we show an example of an access control room layout in a power plant design in order to check the effectiveness and validity of the proposed method.
