CN113420360B - Building column net size acquisition method based on room area requirement - Google Patents
Building column net size acquisition method based on room area requirement Download PDFInfo
- Publication number
- CN113420360B CN113420360B CN202110748055.0A CN202110748055A CN113420360B CN 113420360 B CN113420360 B CN 113420360B CN 202110748055 A CN202110748055 A CN 202110748055A CN 113420360 B CN113420360 B CN 113420360B
- Authority
- CN
- China
- Prior art keywords
- list
- size
- area
- column net
- room
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/10—Geometric CAD
- G06F30/13—Architectural design, e.g. computer-aided architectural design [CAAD] related to design of buildings, bridges, landscapes, production plants or roads
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/20—Design optimisation, verification or simulation
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Geometry (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computer Hardware Design (AREA)
- Evolutionary Computation (AREA)
- General Engineering & Computer Science (AREA)
- Structural Engineering (AREA)
- Computational Mathematics (AREA)
- Civil Engineering (AREA)
- Mathematical Analysis (AREA)
- Mathematical Optimization (AREA)
- Pure & Applied Mathematics (AREA)
- Architecture (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention relates to a building column net size acquisition method based on room area requirements, which comprises the following steps: s1: acquiring initial information of the size of a building column net; s2: calculating the number of the achievable areas corresponding to the size of each column net; s3: searching and outputting the size of the column net corresponding to the maximum achievable area. Compared with the prior art, the invention provides a unified column net size acquisition method, improves the efficiency and the accuracy, avoids errors of non-technical modes selected by the traditional designers according to experience, and effectively improves the economic efficiency of room design and use.
Description
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
In the building design process, architects need to dimension the mesh of columns to meet design requirements. Typically, the choice of the mesh in the design phase is based on: building type requirements, original column mesh size, repeat unit area, large space area, numerous small room areas, facility size, etc. In these references, information such as building type, original column net, facility size and the like can be directly used as the reference for judging column net size, and room area requirements usually contain a large amount of data information, so that the information is difficult to judge intuitively through experience.
Specifically, one of the design tasks of an architect is to arrange each room area in an area index in a space defined by a column net of a certain size. A reasonable column net can more efficiently adapt to the space requirements of large and small rooms, i.e. most of the room area can be realized under the constraint of the column net with the size.
In the prior art, there are some methods of optimizing the size of the mesh based on economic analysis or based on parking efficiency, and in practice, designers often make the selection of mesh size empirically. However, this method has the following problems: the area information contains a large amount of data, and the area in which a size of a columnar net can be realized is also various, so that experience evaluation often lacks efficiency and accuracy, and a unified columnar net size acquisition and confirmation 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 acquisition method based on room area requirements.
The aim of the invention can be achieved by the following technical scheme:
a building column net size acquisition 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 number of the achievable areas corresponding to the size of each column net;
s3: searching and outputting the size of the column net corresponding to the maximum achievable area.
Preferably, the initial information includes initial information including a room area list list_a, a mesh size list list_s, a corridor width list list_d, and a fault tolerance range e.
Preferably, the room area list list_a is:
list_a＝[a_0,a_1,…,a_j,…,a_m]，
where a_j is the jth room area, j e 1, m,
the column net size list list_s is:
list_s＝[s_0,s_1,…,s_i,…,s_n]，
wherein s_i is the size of the ith column net, i.e. [1, n ],
the corridor width list 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 list_c equal to the column net size list list_s in length, wherein list_c= [ c_0, c_1, …, c_p, …, c_m ], c_p is the p-th counting parameter, and the initial values of list_c are all 0;
s22: traversing the column net size list list_s, executing S23 for each column net size s_i, and executing S25 after traversing;
s23: traversing the area list list_a, and executing S24 on each room area a_j;
s24: judging whether a_j is an achievable area, if so, adding 1 to the accumulation of c_i in the counting list;
s25: and outputting list_c.
Preferably, the step of determining the achievable area of S24 specifically includes:
s241: traversing the corridor width list d, and executing S242 for each corridor width d_k; ending the traversal, executing S247;
s242: creating an initial number x=1 of units and an initial current implementation area a_x=0;
s243: assigning an upper wheel realization area a_x-1=a_x and updating a current realization area a_x;
s244: calculating an achievable optimal room aspect ratio r;
s245: if a_x satisfies the continued operation condition, then S246 is executed; otherwise, k=k+1 and S241 is performed;
s246: if a_x meets the achievable condition, returning to yes; otherwise, x=x+1 and S243 is performed;
s247: and returning to no.
Preferably, the calculation manner of the current implementation area a_x of S243 is:
a_x＝a_x+s_i*(s_i-d_k)/2。
preferably, the continuous operation condition of S245 is:
a_x-1＜a_j。
preferably, the achievable conditions of S246 are:
i a_x-a_j < e a_j and r.ltoreq.2.
Preferably, the specific calculating step of the room aspect ratio r includes:
s2441: it is determined whether the corridor width d is 0. If yes, executing S2442; if not, executing S2443;
s2442: calculating a, b, which minimize r=a/b, when a, b are positive integers, a > b, a= 2*x, the a, b being long-side parameters and short-side parameters, respectively;
s2443: comparing s_i-d_k with n x s_i/2, and taking a larger value as a and a smaller value as b;
s2444: r=a/b is calculated.
Preferably, the specific step of S3 includes:
s31: sorting the size list list_s from big to small by taking the count list_c as a parameter key;
s32: the first value s_0 of the ordered size list list_s is output.
In the present invention, the calculation formula for any parameter is as follows: delta=delta+lambda, meaning that let lambda=delta+lambda, let delta=lambda, and then finish updating the delta value of any parameter, where lambda is an intermediate variable.
Compared with the prior art, the invention has the following advantages:
(1) The invention automatically acquires the column net size with the largest area based on the initial information of the building column net, can accurately and efficiently acquire the building column net size based on the automatic optimization acquisition method, provides a unified column net size acquisition method, improves the efficiency and the accuracy, avoids the errors of non-technical modes selected by the previous designers according to experience, and effectively improves the economic efficiency of room design and use;
(2) The invention comprehensively considers and utilizes the room area list, the column net size list, the corridor width list and the fault tolerance range to sequentially process and screen, optimizes the column net size with the largest area number based on the data acquisition optimization of the achievable area, the optimal length-width ratio and the like of the room, has perfect data base, improves the accuracy of the column net size selection result, and ensures that the subsequent design flow is more convenient and effective.
Drawings
FIG. 1 is an overall flow chart of the present invention;
FIG. 2 is a flowchart showing the embodiment of S2 of the present invention;
FIG. 3 is a flowchart showing the embodiment of S24 of the present invention;
FIG. 4 is a flowchart showing the steps S244 of the present invention;
FIG. 5 is a schematic diagram of definition of the width of the corridor of the present invention at 0;
FIG. 6 is a schematic diagram of the definition of the width of the corridor of the present invention at 0;
FIG. 7 is a schematic diagram of definition of the width of the corridor of the present invention at 0;
FIG. 8 is a schematic diagram of the definition of the invention when the width of the corridor of the achievable area is 0;
FIG. 9 is a schematic diagram of definition of the invention when the width of the corridor of the achievable area is not 0;
FIG. 10 is a schematic diagram of definition of the invention when the width of the corridor of the achievable area is not 0;
FIG. 11 is a schematic diagram of definition of the achievable area corridor width of the present invention when it is not 0.
Detailed Description
The invention will now be described in detail with reference to the drawings and specific examples. Note that the following description of the embodiments is merely an example, and the present invention is not intended to be limited to the applications and uses thereof, and is not intended to be limited to the following embodiments.
Examples
A building column net size acquisition method based on room area requirements comprises the following steps:
s1: and obtaining initial information of the size of the building column net.
The initial information includes initial information including a room area list list_a, a mesh size list list_s, a corridor width list 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 architectural design task book, 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 j-th room area, j e [1, m ].
The column net size list is a user-defined set of column net size selection ranges, expressed in the form of a floating point number array:
list_s＝[s_0,s_1,…,s_i,…,s_n]，
where s_i is the i-th mesh size, i.e. [1, n ].
The corridor width list is a user-defined set of corridor width selection ranges, expressed as:
list_d＝[d_0,d_1,…,d_k,…,d_l]，
where d_k is the kth corridor width, k e 1, l, it should be noted that corridor width d may be 0. When d=0, this is equivalent to the case where the corridor width is not considered, as shown in fig. 5 to 8.
The fault tolerance range is the ratio of the difference value between the actually realized room area a' and the required area a to the required area a, 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, a 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 mesh size list uses a common column mesh 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 list_d= [0,2.1]; the fault tolerance range takes a value of 0.1 according to design practice experience. All dimensions are in meters.
S2: and calculating the number of the achievable areas corresponding to the size of each column net.
In the present embodiment, the definition of the achievable area is shown in fig. 5 to 11. The definition conditions are as follows:
1) The area value is a multiple of the cell area. Specifically, the unit area is 1/2 of the unit cell or 1/2 of the unit cell area after the corridor area is removed. In one embodiment, for example, s_i=7.2, if d_k=0, the cell area is 7.2×7.2/2=25.92 square meters; if d_k=2.1, the cell area is 7.2×7.2-2.1/2= 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 proposed room aspect ratio value is 2, based on building design practice experience: 1. when the corridor width is not 0, only the implementation possibility of a single-span deep room is considered, as shown in fig. 9-11; when the corridor width is 0, in addition to the single-span deep room, the implementation possibility of a multi-span deep large space is also considered, as shown in fig. 5 to 8.
3) The absolute value of the difference between the area value and the required area value is not smaller 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: a counting list list_c with equal length to the column net size list list_s is created, wherein list_c= [ c_0, c_1, …, c_p, …, c_m ] and c_p are p-th counting parameters, and initial values of all parameters in list_c are 0.
S22: traversing the column net size list list_s, executing S23 for each column net size s_i, and executing S25 after traversing;
s23: traversing the area list list_a, and executing S24 on each room area a_j;
s24: judging whether a_j is an achievable area, if so, adding 1 to the accumulation of c_i in the counting list.
The step S24 of judging the achievable area comprises the following specific steps:
s241: traversing the corridor width list d, and executing S242 for each corridor width d_k; ending the traversal, executing S247;
s242: creating an initial number x=1 of units and an initial current implementation area a_x=0;
s243: assigning an upper round realization area a_x-1=a_x and updating a current realization area a_x, a_x=a_x+s_i (s_i-d_k)/2;
s244: calculating the best room aspect ratio r that can be achieved: the best achievable room aspect ratio refers to the aspect ratio value of the room at the current implementation area. The calculation of the aspect ratio of the room is in two cases, namely if the corridor width d_k is 0. Since there is a possibility of implementation of a large space with multiple depths when the corridor width is 0, it is necessary to compare to obtain the optimal room aspect ratio for the subsequent step to compare whether the aspect ratio is satisfied.
S2441: it is determined whether the corridor width d is 0. If yes, executing S2442; if not, executing S2443;
s2442: when a and b are positive integers, a is greater than b, a is greater than b= 2*x, a, b, a and b which minimize r=a/b are long-side parameters and short-side parameters respectively, and the algorithm can calculate a and b values by adopting an integer programming or exhaustive method. 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, and taking a larger value as a, wherein a in step S2443 represents the length of the long side of the room, and b is a smaller value as b, and b in step S2443 represents the length of the short side of the room, namely:
a＝max(s_i-d_k,n*s_i/2)
b＝min(s_i-d_k,n*s_i/2)
s2444: r=a/b is calculated and 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 continued operation condition, then S246 is executed; otherwise, k=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, here, the upper-wheel implementation area is not the current implementation area, because the range is [ a_j (1-e), a_j (1+e) ] according to the definition of the achievable area, and thus the current implementation area should be larger than the required implementation area.
S246: if a_x meets the achievable condition, returning to yes; otherwise, x=x+1 and executing S243, the achievable condition of S246 is that |a_x-a_j| < e a_j and r is equal to or less than 2,
s247: and returning to no.
S25: and outputting list_c.
S3: searching and outputting the size of the column net corresponding to the maximum achievable area.
The specific steps of S3 include:
s31: the size list list_s is sorted from large to small by taking the count list list_c as a parameter key, and particularly, a common preferred sorting algorithm such as a heap sorting method, a parallel sorting method, a quick sorting method and the like can be applied to sorting due to the fact that the list length is not large and the stability of the result is not required by the problem.
In one embodiment, for the bin size list list_s= [7.2,7.5,7.8,8.0,8.4,9.0], it corresponds to the count list list_c= [42,14,16,21,36,15]; post-ordering bin size list list_s= [7.2,8.4,8.0,7.8,9.0,7.5] shows the ordering of bin sizes from good to bad for the area requirements in this embodiment.
S32: the first value s_0 of the ordered size list list_s is output as the mesh size with the largest achievable area number. In this embodiment, s_0=7.2 meters is acquired.
In the present invention, the calculation formula for any parameter is as follows: delta=delta+lambda, meaning that let lambda=delta+lambda, let delta=lambda, and then finish updating the delta value of any parameter, where lambda is an intermediate variable.
Let Λ=k+1, let k=Λ, and then update 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 various other ways, and various omissions, substitutions, and changes may be made without departing from the scope of the technical idea of the present invention.
Claims (4)
1. The method for acquiring the size of the building column net based on the room area requirement is characterized by comprising the following steps of:
s1: acquiring initial information of the size of a building column net;
s2: calculating the number of the achievable areas corresponding to the size of each column net;
s3: searching and outputting the size of the column net with the maximum corresponding realizable area number;
the initial information comprises a room area list list_a, a column net size list list_s, a corridor width list list_d and a fault tolerance range e;
the room area list list_a is:
list_a＝[a_0,a_1,…,a_j,…,a_m]，
where a_j is the jth room area, j e 0, m,
the column net size list list_s is:
list_s＝[s_0,s_1,…,s_i,…,s_n]，
wherein s_i is the size of the ith column net, i is [0, n ],
the corridor width list list_d is:
list_d＝[d_0,d_1,…,d_k,…,d_l]，
wherein d_k is the kth corridor width, k e [0,l ];
the specific steps of the S2 comprise:
s21: creating a count list list_c of equal length to the bin size list list_s:
list_c＝[c_0,c_1,…,c_p,…,c_m]
wherein c_p is the p-th counting parameter, and the initial values of the middle parameters of list_c are all 0;
s22: traversing the column net size list list_s, executing S23 for each column net size s_i, and executing S25 after traversing;
s23: traversing the area list list_a, and executing S24 on each room area a_j;
s24: judging whether a_j is an achievable area, if so, adding 1 to the accumulation of c_i in the counting list;
s25: outputting list_c;
the step S24 of judging the achievable area comprises the following specific steps:
s241: traversing the corridor width list d, and executing S242 for each corridor width d_k; ending the traversal, executing S247;
s242: creating an initial number x=1 of units and an initial current implementation area a_x=0;
s243: assigning an upper wheel realization area a_x-1=a_x and updating a current realization area a_x;
s244: calculating an achievable optimal room aspect ratio r;
s245: if a_x satisfies the continued operation condition, then S246 is executed; otherwise, k=k+1 and S241 is performed;
s246: if a_x meets the achievable condition, returning to yes; otherwise, x=x+1 and S243 is performed;
the realizable conditions are specifically as follows:
a_x-a_j < e a_j and r.ltoreq.2
S247: returning to no;
the specific steps of the S3 comprise:
s31: sorting the size list list_s from big to small by taking the count list_c as a parameter key;
s32: the first value s_0 of the ordered size list list_s is output.
2. The method for obtaining the size of the building column network based on the room area requirement according to claim 1, wherein the current calculation mode of the area a_x of S243 is:
a_x＝a_x+s_i*(s_i-d_k)/2。
3. the method for obtaining the size of the building column network based on the room area requirement according to claim 1, wherein the following conditions are adopted in the step S245:
a_x-1＜a_j。
4. the method for obtaining the size of the building column network based on the room area requirement according to claim 1, wherein the specific calculation step of the room aspect ratio r comprises the following steps:
s2441: judging whether the corridor width is 0, if so, executing S2442; if not, executing S2443;
s2442: calculating a, b, which minimize r=a/b, when a, b are positive integers, a > b, a= 2*x, the a, b being long-side parameters and short-side parameters, respectively;
s2443: comparing s_i-d_k with n x s_i/2, and taking a larger value as a and a smaller value as b;
s2444: r=a/b is calculated.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110748055.0A CN113420360B (en) | 2021-07-02 | 2021-07-02 | Building column net size acquisition method based on room area requirement |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110748055.0A CN113420360B (en) | 2021-07-02 | 2021-07-02 | Building column net size acquisition method based on room area requirement |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113420360A CN113420360A (en) | 2021-09-21 |
| CN113420360B true CN113420360B (en) | 2023-05-26 |
Family
ID=77720037
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110748055.0A Active CN113420360B (en) | 2021-07-02 | 2021-07-02 | Building column net size acquisition method based on room area requirement |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113420360B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110442892A (en) * | 2019-04-10 | 2019-11-12 | 南京五视界网络科技有限公司 | A kind of hotel guest room layer plane automation arrangement method |
| CN112632658A (en) * | 2020-12-08 | 2021-04-09 | 四川蓉信开工程设计有限公司 | BIM-based method for rapidly generating comprehensive building |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2756266A1 (en) * | 2011-10-26 | 2013-04-26 | Charles Michael Gryba | Undercut excavation method with continuous concrete floors |
| CN105545038B (en) * | 2015-12-28 | 2017-12-08 | 南阳师范学院 | A kind of rationally control parking stall distribution and the underground garage of parking stall space-consuming |
| CN107989193A (en) * | 2017-12-10 | 2018-05-04 | 湖南金海钢结构股份有限公司 | Compound orthogonal spatial space lattice boxlike tube-in-tube structure and production method |
-
2021
- 2021-07-02 CN CN202110748055.0A patent/CN113420360B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110442892A (en) * | 2019-04-10 | 2019-11-12 | 南京五视界网络科技有限公司 | A kind of hotel guest room layer plane automation arrangement method |
| CN112632658A (en) * | 2020-12-08 | 2021-04-09 | 四川蓉信开工程设计有限公司 | BIM-based method for rapidly generating comprehensive building |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113420360A (en) | 2021-09-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Muller et al. | A systematic literature review of interoperability in the green Building Information Modeling lifecycle | |
| Eastman | Guide to GIS and image processing | |
| CN106171047B (en) | intelligent lighting system with predictive maintenance scheduling and method of operation thereof | |
| CN104240163A (en) | Intelligent district recommendation method and intelligent district recommendation device | |
| US20150310063A1 (en) | Processing queries using hybrid access paths | |
| CN105138600B (en) | Based on the matched social network analysis method of graph structure | |
| JP2018109996A (en) | Data meta-scaling apparatus and method for continuous learning | |
| Chen | An interval‐valued Pythagorean fuzzy compromise approach with correlation‐based closeness indices for multiple‐criteria decision analysis of bridge construction methods | |
| CN1763745A (en) | Structure oriented data migration method and system | |
| Biswas et al. | From design to pre-certification using building information modeling | |
| CN113420360B (en) | Building column net size acquisition method based on room area requirement | |
| Orehounig et al. | CESAR-P: A dynamic urban building energy simulation tool | |
| Baldauf et al. | Using BIM for modeling client requirements for low-income housing | |
| Angrisano et al. | A literature review about life cycle assessment as a tool to support circular economy innovation in the built environment sector | |
| CN111503524B (en) | Method for matching urban gas users with pressure regulating box | |
| KR20180080111A (en) | Data meta-scaling Apparatus and method for continuous learning | |
| Sen et al. | Efficient traversal in data warehouse based on concept hierarchy using Galois connections | |
| Ostrouchov et al. | Uncertainty analysis of a heavily instrumented building at different scales of simulation | |
| CN112580828B (en) | Method for determining operation and maintenance time and operation and maintenance task allocation system | |
| CN117076454B (en) | Engineering quality acceptance form data structured storage method and system | |
| CN117196224B (en) | Intelligent repair management method and system for ancient building | |
| CN112308165B (en) | Storm-based real-time spatial nearest neighbor classification prediction method and system | |
| Ranganathan | Decision support systems for energy efficiency in buildings: a review of existing models and its potentials | |
| CN111291485B (en) | Method and system for solving problems found in pipeline integrated design | |
| Kiss | Multi-Objective Environmental Optimization of Buildings |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |