CN113420360A

CN113420360A - Building column net size obtaining method based on room area requirement

Info

Publication number: CN113420360A
Application number: CN202110748055.0A
Authority: CN
Inventors: 尹武先; 王吉辰; 宋扬; 黄礼良; 丁慧超; 陈秀星; 宋芳芳; 姚稼澍
Original assignee: Architecture Design and Research Institute of Tongji University Group Co Ltd
Current assignee: Architecture Design and Research Institute of Tongji University Group Co Ltd
Priority date: 2021-07-02
Filing date: 2021-07-02
Publication date: 2021-09-21
Anticipated expiration: 2041-07-02
Also published as: CN113420360B

Abstract

The invention relates to a building column net size obtaining method based on room area requirements, which comprises the following steps of: s1: acquiring initial information of the size of a building column net; s2: calculating the achievable area number corresponding to the size of each column net; s3: and searching and outputting the column net size with the maximum corresponding achievable area number. Compared with the prior art, the invention provides a uniform column net size obtaining method, improves the efficiency and the accuracy, avoids the error of a non-technical mode selected by a designer according to experience in the past, and effectively improves the economic efficiency of room design and application.

Description

Building column net size obtaining method based on room area requirement

Technical Field

The invention relates to the technical field of constructional engineering, in particular to a method for acquiring the size of a building column net based on room area requirements.

Background

During the building design process, the architect needs to determine the size of the column net to meet the design requirements. Generally, the selection of the column network in the design stage is based on: building type requirements, original column net size, repeat unit area, large space area, numerous small room areas, facility size and the like. Among these bases, information such as building types, original column networks, facility sizes, and the like can be directly used as bases for judging the column network sizes, and room area requirements usually contain a large amount of data information and are difficult to intuitively judge through experience.

Specifically, one of the architect's design tasks is to arrange each room area in the area index into a space defined by a grid of columns of a certain size. A reasonable column net can more efficiently adapt to the space requirement of large and small rooms, namely, most room areas can be realized under the constraint of the column net with the size.

In the prior art, there are some methods for optimizing the size of the net based on economic technical analysis or based on parking efficiency, and in practice, the designer usually makes the selection of the net size empirically. However, this method has the following problems: the area information contains a large amount of data, the area of a column network size which can be realized is also various, efficiency and accuracy are often lacked through empirical evaluation, and a uniform column network size obtaining and confirming method cannot be provided in the prior art.

Disclosure of Invention

The invention aims to overcome the defects of the prior art and provide a building column net size obtaining method based on room area requirements.

The purpose of the invention can be realized by the following technical scheme:

a building column net size obtaining method based on room area requirements comprises the following steps:

s1: acquiring initial information of the size of a building column net;

s2: calculating the achievable area number corresponding to the size of each column net;

s3: and searching and outputting the column net size with the maximum corresponding achievable area number.

Preferably, the initial information includes a room area list _ a, a columnating size list _ s, a corridor width list _ d and a fault tolerance range e.

Preferably, the room area list _ a is:

list_a＝[a_0,a_1,…,a_j,…,a_m]，

wherein a _ j is the jth room area, j belongs to [1, m ],

the list _ s of the sizes of the column nets is as follows:

list_s＝[s_0,s_1,…,s_i,…,s_n]，

wherein s _ i is the size of the ith column net, i belongs to [1, n ],

the corridor width list _ d is:

list_d＝[d_0,d_1,…,d_k,…,d_l]，

where d _ k is the kth corridor width, k ∈ [0, l ].

Preferably, the specific step of S2 includes:

s21: creating a counting list _ c with the same length as the column net size list _ s, wherein the counting list _ c is [ c _0, c _1, …, c _ p, …, c _ m ], c _ p is a p-th counting parameter, and the initial value of the list _ c is 0;

s22: traversing the list _ S of the sizes of the cylindrical nets, executing S23 on each size of the cylindrical nets S _ i, and executing S25 after traversing is finished;

s23: traversing the area list _ a, and executing S24 for each room area a _ j;

s24: judging whether a _ j is the achievable area, if so, adding 1 to c _ i in the counting list in an accumulated mode;

s25: and outputting list _ c.

Preferably, the achievable area judgment of S24 includes:

s241: traversing the corridor width list _ d, and executing S242 for each corridor width d _ k; after the traversal is finished, executing S247;

s242: creating an initial number x of units as 1 and an initial current realization area a _ x as 0;

s243: assigning the upper wheel realization area a _ x-1 as a _ x and updating the current realization area a _ x;

s244: calculating the achievable optimal room aspect ratio r;

s245: if a _ x satisfies the continuation condition, executing step S246; otherwise, k is k +1 and S241 is performed;

s246: if a _ x meets the realizable condition, returning to yes; otherwise, x is x +1 and S243 is performed;

s247: and returning to the NO state.

Preferably, the calculation method of the currently-realized area a _ x of S243 is as follows:

a_x＝a_x+s_i*(s_i-d_k)/2。

preferably, the continuing operation condition of S245 is:

a_x-1＜a_j。

preferably, the achievable conditions of S246 are:

and | a _ x-a _ j | < e × a _ j and r is less than or equal to 2.

Preferably, the specific calculation step of the room aspect ratio r includes:

s2441: and judging whether the width d of the corridor is 0 or not. If yes, go to S2442; if not, executing S2443;

s2442: when a and b are positive integers, a is larger than b, and a is larger than b and is larger than 2, a and b which minimize r is a/b are respectively long side parameters and short side parameters;

s2443: comparing s _ i-d _ k with n x s _ i/2, taking the larger value as a and the smaller value as b;

s2444: and calculating r as a/b.

Preferably, the specific step of S3 includes:

s31: sorting the size list _ s from large to small by taking the counting list _ c as a parameter key;

s32: the first value s _0 of the sorted size list _ s is output.

In the invention, a calculation formula of any parameter is as follows: and d, firstly, changing the lambda to delta + lambda, and then changing the delta to lambda to finish updating the value of any parameter delta, wherein lambda is an intermediate variable.

Compared with the prior art, the invention has the following advantages:

(1) the invention automatically acquires the column network size with the largest achievable area number based on the initial information of the building column network, can accurately and efficiently acquire the building column network size based on the automatic optimal acquisition method, provides a uniform column network size acquisition method, improves the efficiency and the accuracy, avoids the error of a non-technical mode selected by a designer according to experience in the past, and effectively improves the economic efficiency of room design and application;

(2) the invention comprehensively considers and utilizes the room area list, the column network size list, the corridor width list and the fault-tolerant range to sequentially process and screen, obtains and optimizes the column network size with the maximum achievable area number based on the data of the room, the optimal length-width ratio and the like, has perfect data base, improves the accuracy of the column network size selection result, and makes the subsequent design flow more convenient and effective.

Drawings

FIG. 1 is an overall flow chart of the present invention;

FIG. 2 is a detailed flowchart of S2 according to the present invention;

FIG. 3 is a detailed flowchart of S24 according to the present invention;

FIG. 4 is a flowchart illustrating an embodiment of S244 according to the present invention;

FIG. 5 is a schematic diagram illustrating the definition of the achievable area corridor width of 0 according to the present invention;

FIG. 6 is a diagram illustrating the definition of the achievable area corridor width of 0 according to the present invention;

FIG. 7 is a schematic diagram illustrating the definition of the achievable area corridor width of 0 according to the present invention;

FIG. 8 is a diagram illustrating the definition of an achievable area corridor width of 0 according to the present invention;

FIG. 9 is a schematic illustration of the present invention with a achievable area corridor width other than 0;

FIG. 10 is a schematic illustration of the present invention with a achievable area corridor width other than 0;

fig. 11 is a diagram illustrating the definition of the achievable area corridor width of the present invention different from 0.

Detailed Description

The invention is described in detail below with reference to the figures and specific embodiments. Note that the following description of the embodiments is merely a substantial example, and the present invention is not intended to be limited to the application or the use thereof, and is not limited to the following embodiments.

Examples

s1: and acquiring initial information of the size of the building column net.

The initial information comprises initial information including a room area list _ a, a columnating size list _ s, a corridor width list _ d and a fault tolerance range e.

In this embodiment, the room area list is a set of area values of all rooms required in the building design task book, and is expressed in the form of a floating-point number array:

list_a＝[a_0,a_1,…,a_j,…,a_m]

where a _ j is the jth room area, j ∈ [1, m ].

The column size list is a user-defined set of column size selection ranges, represented in the form of an array of floating point numbers:

list_s＝[s_0,s_1,…,s_i,…,s_n]，

wherein s _ i is the ith column net size, and i belongs to [1, n ].

The corridor width list selects a set of ranges for the user-defined corridor width, represented as:

list_d＝[d_0,d_1,…,d_k,…,d_l]，

wherein d _ k is the kth corridor width, k ∈ [1, l ], and it should be noted that the corridor width d may be 0. When d is 0, the method is equivalent to the case of not considering the width of the corridor, as shown in fig. 5 to 8.

The fault tolerance range is the ratio of the difference between the actually realized room area a' and the required area a to the required area a, and is expressed as a floating point number e, and the value range is [0,1], which is defined as: e ═ a' -a |/a.

In this embodiment, the task book area index designed by a certain museum is used as a room area list:

list_a＝[415,415,415,600,50,100,150,36,25,80,310,150,50,36,400,36,100,36,50,187.5,187.5,110,100,130,18,36,36,18,18,36,18,36,36,36,54,72,18,36,72,18,36,25]；

the column net size list adopts a common column net size list:

list_s＝[7.2,7.5,7.8,8.0,8.4,9.0]；

the corridor width list adopts a common corridor width list _ d ═ 0, 2.1; the fault tolerance range is 0.1 according to design practice experience. All dimensions are in meters.

S2: and calculating the number of achievable areas corresponding to each column net size.

In the present embodiment, the achievable areas are defined as shown in FIGS. 5 to 11. The definition conditions are as follows:

1) the area value is a multiple of the unit area. Specifically, the cell area is 1/2 for the cell or 1/2 for the cell area after removal of the corridor area. In one embodiment, for example, when s _ i is 7.2, if d _ k is 0, the unit area is 7.2 × 7.2/2 is 25.92 square meters; if d _ k is 2.1, the unit area is 7.2 (7.2-2.1)/2 is 18.36 square meters.

2) The area value corresponds to an optimal aspect ratio that is less than the recommended room aspect ratio. Specifically, in one embodiment, the recommended room length to width ratio is 2: 1. when the width of the corridor is not 0, only the realization possibility of a single-span deep room is considered, as shown in FIGS. 9-11; when the width of the corridor is 0, besides a single-span deep room, the realization possibility of a multi-span deep large space is also considered, as shown in fig. 5-8.

3) The absolute value of the difference between the area value and the required area value is not less than a certain range. Specifically, the range is the product of the required area value and the fault tolerance range e.

The specific steps of S2 include:

s21: and creating a counting list _ c with the same length as the column net size list _ s, wherein the counting list _ c is [ c _0, c _1, …, c _ p, …, c _ m ], c _ p is the p-th counting parameter, and the initial value of each parameter in the list _ c is 0.

s23: traversing the area list _ a, and executing S24 for each room area a _ j;

s24: and judging whether a _ j is the achievable area, if so, adding 1 to c _ i in the counting list in an accumulated mode.

The method for judging the achievable area of the step S24 includes the following steps:

s243: assigning the upper wheel realization area a _ x-1 to a _ x and updating the current realization area a _ x, a _ x to a _ x + s _ i (s _ i-d _ k)/2;

s244: calculating the best room aspect ratio r achievable: the best room aspect ratio achievable refers to the aspect ratio value of the room at the current implementation area. There are two cases in the calculation of the room aspect ratio, i.e. whether the corridor width d _ k is 0. Since the realization possibility of a large space with multiple spans and depths exists when the width of the corridor is 0, the optimal room aspect ratio needs to be obtained by comparison for the subsequent step to compare whether the requirement of the aspect ratio is met.

s2442: when a and b are positive integers, a > b, and a x b is 2 x, a, b which minimizes r a/b are long side parameters and short side parameters respectively, and the algorithm can adopt an integer programming or an exhaustive method to calculate the values of a and b. In step S2442, a is the ratio of the length of the long side of the room to S _ i/2, and b is the ratio of the length of the short side of the room to S _ i/2.

S2443: comparing S _ i-d _ k with n x S _ i/2, taking the larger value as a, the smaller value as b, and the smaller value as b, in step S2443, the shorter length of the room, i.e. taking:

a＝max(s_i-d_k,n*s_i/2)

b＝min(s_i-d_k,n*s_i/2)

s2444: the room aspect ratio is defined as the ratio of the length of the long side to the length of the short side.

S245: if a _ x satisfies the continuation condition, executing step S246; otherwise, k is k +1 and S241 is executed, specifically, the continued operation condition of S245 is that the upper round implementation area is smaller than the required implementation area, that is, a _ x-1 < a _ j. It should be noted that the reason why the upper wheel implementation area is used instead of the current implementation area is that the current implementation area may be larger than the required implementation area because the achievable area is defined as [ a _ j (1-e), a _ j (1+ e) ].

S246: if a _ x meets the realizable condition, returning to yes; otherwise, x is x +1 and S243 is executed, the achievable conditions of S246 are | a _ x-a _ j | < e × a _ j and r ≦ 2,

s247: and returning to the NO state.

S25: and outputting list _ c.

The specific steps of S3 include:

s31: the size list _ s is sorted from large to small by taking the count list _ c as a parameter key, and specifically, as the length of the list is not large and there is no requirement on the stability of the result of the problem, the sorting can be applied to a commonly used preferred sorting algorithm, such as a heap sorting method, a merging sorting method, a quick sorting method, and the like.

In one embodiment, for the column mesh size list _ s ═ 7.2,7.5,7.8,8.0,8.4,9.0], it corresponds to the count list _ c ═ 42,14,16,21,36, 15; the sorted list of pillar mesh sizes list _ s ═ 7.2,8.4,8.0,7.8,9.0,7.5], indicates the sort of the pillar mesh sizes from good to bad for the area requirements in this example.

S32: and outputting a first value s _0 of the sorted size list _ s as the size of the cylinder net with the largest number of achievable areas. In this embodiment, s _0 is obtained as 7.2 meters.

And if k is equal to k +1, firstly, enabling Λ to be equal to k +1, and then enabling k to be equal to Λ, so as to realize the updating of the parameter k.

The above embodiments are merely examples and do not limit the scope of the present invention. These embodiments may be implemented in other various manners, and various omissions, substitutions, and changes may be made without departing from the technical spirit of the present invention.

Claims

1. A building column net size obtaining method based on room area requirements is characterized by comprising the following steps:

s1: acquiring initial information of the size of a building column net;

2. The method as claimed in claim 1, wherein the initial information includes room area list _ a, post size list _ s, corridor width list _ d and fault tolerance range e.

3. The method for obtaining the size of the building cylinder net based on the room area requirement according to claim 2, wherein the room area list _ a is as follows:

list_a＝[a_0,a_1,…,a_j,…,a_m]，

wherein a _ j is the area of the jth room, j belongs to [0, m ],

the list _ s of the sizes of the column nets is as follows:

list_s＝[s_0,s_1,…,s_i,…,s_n]，

wherein s _ i is the size of the ith column net, i belongs to [0, n ],

the corridor width list _ d is:

list_d＝[d_0,d_1,…,d_k,…,d_l]，

where d _ k is the kth corridor width, k ∈ [0, l ].

4. The method for acquiring the size of the building cylinder net based on the room area requirement according to claim 3, wherein the step S2 comprises the following steps:

s21: creating a counting list _ c with the same length as the column net size list _ s, wherein the counting list _ c is [ c _0, c _1, …, c _ p, …, c _ m ], c _ p is a p-th counting parameter, and the initial values of parameters of the list _ c are all 0;

s23: traversing the area list _ a, and executing S24 for each room area a _ j;

s25: and outputting list _ c.

5. The method for acquiring the size of the building cylinder net based on the room area requirement according to claim 4, wherein the step of judging the achievable area of S24 comprises the following steps:

s244: calculating the achievable optimal room aspect ratio r;

s247: and returning to the NO state.

6. The method for obtaining the size of the building cylinder net based on the room area requirement of claim 5, wherein the calculation manner of the currently realized area a _ x of S243 is as follows:

a_x＝a_x+s_i*(s_i-d_k)/2。

7. the method for acquiring the size of the building cylinder net based on the room area requirement of claim 5, wherein the continuing operation conditions of S245 are as follows:

a_x-1＜a_j。

8. the method for acquiring the dimension of the building cylinder net based on the room area requirement of claim 5, wherein the achievable conditions of S246 are as follows:

and | a _ x-a _ j | < e × a _ j and r is less than or equal to 2.

9. The method for acquiring the size of the building cylinder net based on the room area requirement according to claim 5, wherein the specific calculation step of the room aspect ratio r comprises the following steps:

s2441: judging whether the width of the corridor is 0, if so, executing S2442; if not, executing S2443;

s2444: and calculating r as a/b.

10. The method for acquiring the size of the building cylinder net based on the room area requirement according to claim 3, wherein the step S3 comprises the following steps:

s32: the first value s _0 of the sorted size list _ s is output.