Title:
Author:
岡崎甚幸，伊藤明宏
Publication/Publisher:
日本建築学会論文報告集 第311号 昭和57年1月
Abstract:
本論は通路と出入口の配置のモデル化を主目的とする。グラフ理論等による室関係の解析も、建築空間の場合には通路に異種の動線の共存を許すため、厳密な理論大系の一部あるいはそれをあいまいにした形でしか応用できない。また室間距離は通常室の中心間距離により考えられるが、実際には出入口間距離であり、出入口の位置によっては、二室間距離は大きく変化する。したがって通路と出入口の検討が平面計画モデルの急務である。本モデルにおける敷地や室の表現、室の連結方法は「平面型の電算処理に関する研究」を参考にしている。
This paper presents a method of assignment
of rooms to location and method of addition of communication path
and doorsways. A grid is placed over a given site and each rooms,
dividing them into cells of a size decide by archtect. The first
room to be positioned is located at the center of the site. The
second is located contiguous to the first with the virtual path
area between. A communication path between two rooms, both of
which have the largest number of contacts, is assigned first in
the virtual communication path area. As the communication path
between two rooms is generated, a doorways of each room is located
such that the path is the shortest. Unnecessary vbirtual path
area between two rooms is eliminated by the convergent shift of
rooms'position .
Title:
Author:
岡崎甚幸，伊藤明宏
Publication/Publisher:
日本建築学会論文報告集 第339号 昭和59年5月
Abstract:
本論は所与の面積と形状を持つ諸室の配置を、敷地条件を考慮しつつ「空間親近度cijと室相互の距離dijの積」の総和を最小にすることを目標にheuristicな方法によって求め、続いて必要な室間に最短経路となる通路を求める研究である。
We descrived the use of comouterized layout
model as design aids in developing alternative layout designs.
Input date to the model are the following:
1) shape and size of each rectangle room.
2) types of room, movable, fixed semimovable x, semimovable y,
and movable within a territory, and bartype comonent.
3) association chart of cij which denotes communication
frequency between room i and j.
Rooms are located adjacently by heuristic methoh so as to minimize
the total of the product of cij and the Euclidian distance
dij taking into account of the site. The total force on
room i in the x and y direction is given
by the equations,
M+L
xFi
=Σ{cij-cR(ri+rj)/dij }xj-xi)/dij
j
M+L
xFi
=Σ{cij-cR(ri+rj)/dij }yj-yi)/dij
j
where
CR = UR
for cij =0
RR for cij /=0
UR is
the magnitude of the repulsion force between the two rooms whose
frequency of communication is 0. RR is constant ratio of
a tension and a repulsion force. M is anumber of rooms
total (fixed, movable, and semi movable). L is a number
of components.
Following formulas present the mathematical concept of forced
directed location of moveable rooms. Try to find location to these
equations by the method of successive approximation. UV
is a constant to move every room quradually.
new old
xi =
xi + UR ・xFi
new
yi + UR ・yFi
The location procedure is broken down into
three phases"forced directed location phase", "room
overlap resolution phase" and"convergence phase".
All boundaries between rooms being regarded as potential paths
are considered a circulation path network for this layout. A vertex
of a room is considered anode of the network. Find paths of minimum
total length between every two given rooms by the Dijkstra Method.
These paths construct the path communicating every room. Rooms
along the path are moved to give the dimension to the path.
Title:
Author:
松下 聡，岡崎甚幸，国枝 毅
Publication/Publisher:
日本建築学会論文報告集 第380号, 56-63頁(1987年), 1987年10月
Abstract:
既存の室配置モデルの多くは「２次元室配置モデル」である。「２次元室配置モデル」では最初に最適室は位置を求め、それに従って通路を追加する方法がとられている。ところが実際の設計では、室の最適配置を求める以前に、通路パターン室配置の最適性に優先して決定されることが多い。そこで通路の各位相幾何学的形態ごとにその最適室配置を求める方法を考察する。通路の位相幾何学形態は直線型、環状型、T字型、十字形に分類される。そこで本論ではまずその中野直線型に属する片廊下型室配置を取り上げ、その最適室配置を求める「一次元室配置モデル」を論じている。
This is a study of amodel for sub-optimal
lienear ordering of rooms to be allocated along alinear communication
path. The pattern of communication path, such as linear,loop,TY-shape
and cross, tends to be imaged as abasic form of architectural
planatthe beginning of the design. Criteria for the sub-optimum
ordering of rooms are those that follow.
1)Maximizingor minimizing themaxmmum or minimum number of communication
movements passing through between each possible subset of rooms
and its complementary set of rooms.
2)Maximizing or minimising the total length of communication movents
between rooms.
The study is also developed in this paper to deal with allocation
when rooms are different in size and some rooms are fixed at the
given place in advance.
The problem to find the sub-optimum ordering turns out to be equivalent
to find the shortest directed path from the start vertex to the
goal vertex in a state-space graph. Each vertex of this graph
consists of subset of rooms.The start vertex consists of empty
set and universal set respectively.