Title:
Author:
Shigeyuki Okazaki
Akihiro Ito
Publication/Publisher:
Journal of Archit. Plann. Environ. Engng. AIJ, No.311, Jan., 1982
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:
Shigeyuki Okazaki
Akihiro Ito
Publication/Publisher:
Journal of Archit. Plann. Environ. Engng. AIJ, No.339, May, 1984
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:
Shigeyuki Okazaki
Satoshi Matsushita
Tuyoshi Kunieda
Publication/Publisher:
Journal of Archit. Plann. Environ. Engng. AIJ, No.380, Oct., 1987
Abstract:
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.