An intelligent sample-making method for longitudinal reinforcement of columns

Abstract

The present invention discloses a method for intelligently redrawing longitudinal steel bars of a column, and belongs to the field of intelligent construction technology. The method for intelligently redrawing longitudinal steel bars of a column provided by the present invention obtains basic information such as the elevation of each floor of the building, the cross-sectional dimensions of the longitudinal column, and the number and diameter of longitudinal steel bars, and calculates the total height of the longitudinal column, the length of the longitudinal steel bar connection area, the elevation of the longitudinal steel bar connection range, and the set K of optional lengths of the longitudinal steel bars, and then uses a genetic algorithm to construct a chromosome of a steel bar redrawing scheme, generate an original scheme library, and select several schemes with the highest fitness for users to choose through means such as crossover and mutation, and form a steel bar redrawing list based on the scheme selected by the user, and output a material list. This method realizes the optimization of the redrawing of longitudinal steel bars of the column while meeting compliance and constructability, and reduces material consumption and improves the efficiency of steel bar redrawing while ensuring compliance and constructability.

Description

Technical Field

[0001] The invention belongs to the field of intelligent construction, and in particular relates to a method for realizing intelligent reshaping of longitudinal reinforcement bars of columns by using a genetic algorithm. Background Art

[0002] The longitudinal reinforcement of the column is generally thick in diameter, heavy in weight and expensive. The re-sampling of the column reinforcement needs to consider many factors such as constructability, material saving and compliance. From the perspective of constructability, the reinforcement that runs from top to bottom needs to be disconnected at each layer and connected through sleeves. From the perspective of material saving, since the raw materials of the reinforcement are generally 9 meters and 12 meters, it is best to combine the disconnected reinforcement of each layer into 9 meters or 12 meters to avoid material waste. From the perspective of compliance, it is mainly that at most 50% of the longitudinal reinforcement can be connected in the same connection interval, and the connection area should avoid non-connection areas such as the upper and lower edges of the beam interval; therefore, the longitudinal reinforcement of a column is generally divided into two batches of reinforcements with low pile length and high pile length. At present, it is often difficult for technicians to take into account all factors and form the optimal re-sampling result of the column longitudinal reinforcement, which leads to problems such as difficulty in construction or waste of materials. In addition, since the floor height and beam height of different floors of the same column are variable, the diameter and number of reinforcement may also change, so it is often difficult for technicians to quickly obtain the best longitudinal reinforcement re-sampling solution. Summary of the invention

[0003] In view of the above-mentioned problems existing in the prior art of making the longitudinal reinforcement pattern of columns, the present invention provides an intelligent making pattern method for the longitudinal reinforcement of columns, which can obtain an optimized making pattern scheme, meet the compliance and constructability, and reduce material consumption.

[0004] In order to solve the above technical problems, the present invention includes the following technical solutions:

[0005] A method for intelligently redrawing longitudinal reinforcement of a column, comprising the following steps:

[0006] Step 1: Obtain the elevation of each floor of the building, obtain the cross-sectional dimensions of the longitudinal column and the number and diameter of the longitudinal steel bars, determine the total height of the longitudinal column, determine the length of the longitudinal steel bar connection area, determine the elevation of the connectable range of the longitudinal steel bars on each floor, and determine the optional length set K of the longitudinal steel bars, wherein the longitudinal steel bars include low pile long steel bars and high pile long steel bars;

[0007] Step 2: Construct the chromosome a of the steel bar remodeling scheme t , a t Includes N values, a t ={sl tj}, j = 1 to N, sl tj The value range is the set K of optional lengths of longitudinal reinforcement, where a t The 2i-1th number a in t[2i-1] is the length of the long steel bar of the i-th layer low pile, where a t The 2ith number a in t [2i] is the length of the long steel bar of the pile at the i-th level;

[0008] Step 3: Set hyperparameters to generate the original solution library A0, A0={a t}, t = 1 to P, P is the population size, which is the preset value;

[0009] Step 4: Calculate the fitness and selection probability of each solution in A0, generate the parent solution A1 according to the selection probability, cross the different solutions in A1 to form the sub-solution library A2, and let A0=A2;

[0010] Step 5: Perform mutation processing on each solution in solution library A0;

[0011] Step 6: After looping through Step 4 and Step 5 Z times, proceed to Step 7, where Z is the evolutionary generation, which is a preset value;

[0012] Step 7: Select the Q solutions with the highest fitness from A0, add them to the result set A4, and output the values ​​of each position of each element in A4, as well as the corresponding material length LF t ;

[0013] Step 8. According to the final solution selected by the user, output the quantity, diameter, length, and specification information of the longitudinal steel bars on each floor, form a steel bar sample list, and output the material cutting list.

[0014] Furthermore, the longitudinal column is a rectangular column, and the cross section of the rectangular column includes a long side length k i and the short side length b i ;

[0015] The longitudinal reinforcement includes angle reinforcement, long side reinforcement and short side reinforcement; wherein the angle reinforcement data, long side reinforcement and short side reinforcement of the i floor are respectively denoted as rfj i 、rfb i 、rfh i ,in,

[0016] rfj i ={diameter rfjd i , quantity rfjn i}, rfb i ={diameter rfbd i , quantity rfbn i}, rfh i ={diameter rfhd i , quantity rfhn i};

[0017] The length of the steel bar connection area is denoted as HK i , meet HKi =35*Max(rfjd i ,rfbd i ,rfhd i ), which is the length by which the long steel bars of low piles and high piles should be staggered.

[0018] Furthermore, the specific elevation range of the longitudinal reinforcement connection on each floor is determined as follows:

[0019] The lowest and highest elevations of the beams on floor i that intersect with the longitudinal columns are denoted as hbd i 、hbu i , calculate the net height hn of floor i i , satisfying hn i =hbd i -hbu i-1 , where i = 1 to M, M is the total number of floors + 1, and hbu0 is the elevation of the bottom structural surface;

[0020] For floor i, calculate the length of the non-connected area mc i , mc i =max(500mm,k i , hn i / 6);

[0021] The elevation range of the connectable area of ​​floor i is recorded as KLJ i , meet: KLJ i =[hbu i-1 +mc i ,hbd i -mc i ].

[0022] Furthermore, the ground elevation of the building floor i is denoted as H, H={h i}, i = 1 to M, M is the total number of floors + 1, H M The finished surface height of the roof structure;

[0023] The total height of the longitudinal column is denoted as H z , satisfying H z =h M -h1.

[0024] Furthermore, N in step 2 satisfies, N=2M-4.

[0025] Furthermore, in step 3, the hyperparameters are set to generate the original solution library A0, specifically:

[0026] Set the population size P, mutation probability bp, evolutionary generation Z, output scheme number Q, material waste weight lft, joint same interval weight pjt, and initialize the generation z=0;

[0027] Randomly select numbers from K to form P chromosomes a t , forming the initial solution library A0={a t}, t=1 to P.

[0028] Furthermore, in step 4, the fitness of each scheme of A0 is recorded as F, F={F t}, the selection probability is recorded as S, S={S t},

[0029] Calculate the number of chromosomes a in A0 t The fitness and selection probability of , and the parent plan A1 is generated according to the selection probability, including:

[0030] A1. Traverse each chromosome a in A0 t ;

[0031] A2. Initialize the fitness of chromosome F t =4M;

[0032] A3. Calculate chromosome a t The number of longitudinal reinforcements present in the non-connection zone is N t , fitness F t =F t -N t ;

[0033] A4. Use integer linear programming method to calculate the total length LF of material waste t ;

[0034] A5. After the traversal is completed, according to the fitness F t Calculate the selection probability S t ,in,

[0035] ;

[0036] A6. If z ≥ Z, go directly to step 6.

[0037] Further, in step A3, chromosome a is calculated t The number of longitudinal reinforcements present in the non-connection zone is N t , specifically:

[0038] Setting N t =0;

[0039] Calculate the connection elevation of the low pile long steel bars on each floor i, and calculate the number of bars that are not in the connectable area; specifically include: setting dh t1 =gjd, join the set DH t , where gjd is the length of the long steel bar of the low pile consolidation of floor 1; dh is calculated by cyclic iteration ti+1 =dhi+a t[2i-1], join the set DH t ; Synchronous calculation dh ti+1 Is it in the connectable area KLJ ti+1 If it is within the range, N t =N t +1;

[0040] Calculate the connection elevation of the long steel bars of the high pile at each floor i; specifically, set gh1=gjg, add the set GH t , where gjg is the length of the long steel bar of the high pile consolidating floor 1; gh is calculated by cyclic iteration ti+1 =gh ti +a t [2i], join the set GH t ; Synchronous calculation gh ti+1 Is it in the connectable area KL Jti+1 If it is within the range, N t =N t +1;

[0041] Calculate the number of low pile long steel bars and high pile long steel bars in the same connection interval; specifically, traverse DH t Each element in dh ti If gh ti -dh ti <HK i, They belong to the same connection area, N t =N t +pjt;

[0042] In step A4, the total length LF of the material waste is calculated using the integer linear programming method. t , specifically:

[0043] For angle bars, rfjn i / 2 length a t [2i], rfjn i / 2 length a t [2i-1];

[0044] For the long side reinforcement, rfhn i The root length is a t [2i], rfhn i The root length is a t [2i-1];

[0045] For short side reinforcement, rfbn i The root length is a t [2i], rfbn i The root length is a t [2i-1];

[0046] The integer linear programming method is used to combine the chromosome elements into the length of the steel bar raw material, and the total length L of the steel bar raw material is calculated. t ; Calculate the length of wasted material LF t =L t -Hz;F t =F t -lft*LF t .

[0047] Furthermore, in step 4, different solutions in A1 are crossed to form a sub-solution library A2, and A0=A2 is set, specifically:

[0048] B1. Set A2 = {};

[0049] B2. Randomly select two different solutions a from A1 i and a j ; and a i and a j Delete from A1; use a random algorithm to randomly select an integer p in N as the intersection point;

[0050] B3. Change the parent chromosome a i and a j Crossover at point p, a i The first p digits of the value and a j The p bits are then combined numerically to generate sub-chromosome a i ',a j ';

[0051] B4. j ',a j+1 'Add to A2; if there is an element in A1, return to step B2; if there is no element in A1, go to step B5;

[0052] B5. Set z=z+1; set A0=A2.

[0053] Furthermore, in step 5, the solution library A0 is mutated, specifically:

[0054] C1. Traverse each element a in A0 j ;

[0055] C2. According to the mutation probability bp, use the roulette method to determine the j Whether to mutate; if not, go back to step C1; if mutation is required, go to step C3;

[0056] C3. Randomly determine the mutation position by with equal probability between 1-N, and randomly select an element from the set K to replace a j The value of the by position completes the mutation.

[0057] Due to the adoption of the above technical scheme, the present invention has the following advantages and positive effects compared with the prior art: the intelligent re-sampling method for the longitudinal reinforcement of the column provided by the present invention obtains the basic information such as the elevation of each floor of the building, the cross-sectional dimensions of the longitudinal column, and the number and diameter of the longitudinal reinforcement reinforcement, calculates the total height of the longitudinal column, the length of the longitudinal reinforcement connection area, the elevation of the longitudinal reinforcement connectable range, and the longitudinal reinforcement optional length set K, and then uses the genetic algorithm to construct the chromosome of the reinforcement re-sampling scheme, generate the original scheme library, and select several schemes with the highest fitness for the user to choose by means of crossover, mutation, etc., and form a reinforcement re-sampling list based on the scheme selected by the user, and output the blanking list. While meeting compliance and constructability, this method realizes the optimization of the re-sampling of the longitudinal reinforcement of the column, while ensuring compliance and constructability, it reduces material consumption and improves the efficiency of re-sampling. In addition, this method also sets the material waste weight lft, the joint same interval weight pjt, and considers the problems that the longitudinal reinforcement is not connected in the connectable area and connected with the same interface, and comprehensively evaluates through fitness, so as to calculate the comprehensive optimal cutting scheme. BRIEF DESCRIPTION OF THE DRAWINGS

[0058] Figure 1 It is a flow chart of a method for intelligently redrawing longitudinal reinforcement of a column in one embodiment of the present invention;

[0059] Figure 2 Schematic diagram of longitudinal columns, beams, and longitudinal reinforcements of floors i and i-1 in one embodiment of the present invention;

[0060] Figure 3 is a cross-sectional view of a longitudinal column of floor i in one embodiment of the present invention;

[0061] Figure 4 is a cross-sectional view of a longitudinal column of floor i-1 in one embodiment of the present invention;

[0062] Figure 5 Schematic diagram of chromosome encoding, crossover and mutation in one embodiment of the present invention.

[0063] The numbers in the figure are as follows:

[0064] 1-longitudinal column; 2-beam; 3-longitudinal reinforcement; 4-connection node; 5-angle reinforcement; 6-long side reinforcement; 7-short side reinforcement. DETAILED DESCRIPTION

[0065] The following is a further detailed description of a column longitudinal reinforcement intelligent redrawing method provided by the present invention in combination with the accompanying drawings and specific embodiments. The advantages and features of the present invention will become clearer in combination with the following description. It should be noted that the accompanying drawings are all in a very simplified form and are not in precise proportions, and are only used to conveniently and clearly assist in explaining the purpose of the embodiments of the present invention.

[0066] The diameter and quantity of longitudinal reinforcement in longitudinal columns may also vary with the height of floors and beams of buildings. The longitudinal reinforcement in longitudinal columns may also include angle reinforcement, long side reinforcement, short side reinforcement and other types. The longitudinal reinforcement also needs to be connected within a certain range, and the connection of reinforcement must meet the requirement of 50% staggered reinforcement connection nodes in the same connection area. The raw materials of reinforcement are usually standard lengths (such as 9m and 12m), and the connection of longitudinal reinforcement must also consider saving materials. Due to the above factors, it is difficult to formulate a better re-sample plan for the longitudinal reinforcement of longitudinal columns.

[0067] This embodiment provides a method for intelligently redrawing longitudinal reinforcement of a column, which can intelligently generate a redrawing scheme for longitudinal reinforcement of a longitudinal column, reduce material consumption and improve the efficiency of redrawing while meeting compliance and constructability. Figure 1 As shown, the column longitudinal reinforcement intelligent re-drawing method comprises the following steps:

[0068] Step 1: Obtain the elevation of each floor of the building, obtain the cross-sectional dimensions of the longitudinal columns and the number and diameter of the longitudinal steel bars, determine the total height of the longitudinal columns, determine the length of the steel bar connection area, determine the elevation of the connectable range of the longitudinal steel bars on each floor, and determine the set K of optional lengths of the longitudinal steel bars, wherein the longitudinal steel bars include low pile long steel bars and high pile long steel bars.

[0069] As an example, the number of the longitudinal column is zb, and the ground structure elevation H of each floor i is H = {h i}, i = 1 to M, M is the total number of floors + 1, calculate the total height of the longitudinal column H z , H z =h F -h1, the top level h F It is the finished surface of the roof structure. Figure 2 As shown in the figure, the lowest and highest elevations of beam 2 on floor i that intersects with longitudinal column 1 are denoted as hbd i 、hbu i , the lowest and highest elevations of beam 2 on floor i-1 are denoted as hbd i-1 、hbu i-1 , without anti-beam, hbu i =h i The net height of floor i is hn i , hn i =hbd i -hbu i-1 For example, hbd i =17600mm, hbu i-1 =14350mm, hn i =3250mm, the total number of floors is 9, M=10.

[0070] As an example, combining Figures 2 to 4 As shown, the longitudinal column 1 of floor i is a rectangular column, and the long side length of the longitudinal column 1 is k i , the short side is recorded as b i The longitudinal reinforcement of the longitudinal column includes angle reinforcement 5, long side reinforcement 6 and short side reinforcement 7. The angle reinforcement data rfj of floor i i ={diameter rfjd i , quantity rfjn i}, long side rib data rfb i ={diameter rfbd i , quantity rfbn i}, short side reinforcement data rfh i ={diameter rfhd i , quantity rfhn i}, longitudinal reinforcement data RF i ={rfh i , rfbi, rfj i}.like Figure 3 As shown, the number of corner bars is 4, the number of long side bars is 2, and the number of short side bars is 2. Figure 4 As shown, the number of corner bars is 4, the number of long side bars is 4, and the number of short side bars is 8. The longitudinal reinforcement can be divided into low pile long reinforcement and high pile long reinforcement according to the location of the connection node 4. The distance between the connection node 4 of the low pile long reinforcement and the high pile long reinforcement of floor i is recorded as Hk i , Hk i That is, the lengths of the low pile long steel bars and the high pile long steel bars should be staggered to meet HK i =35*Max(rfjd i ,rfbd i ,rfhd i ). Beam upper and lower mc i The connection node cannot be set within the range, mc i is the length of the non-connected region, satisfying mc i =max(500mm,k i , hn i / 6); the range of the connection node can be set to KLJ i , called the connectable area elevation range, meeting KLJ i =[hbu i-1 +mc i ,hbd i -mc i ]. For example, combined with Figure 3 and Figure 4 As shown, rfjd i =25mm, rfjn i =4,RFBD i=25mm, RFBN i =2,RFHD i =25mm, rfhn i =2, rfjd i-1 =25mm, rfjn i-1 =4,RFBD i =25mm, RFBN i-1 =4,RFHD i-1 =25mm, rfhn i-1 =8. HK i =35*Max(25mm,25mm,25mm)=875mm. mc i =max(500mm, 600mm, 3250mm / 6) = 600mm. KJ i =[143500mm+600mm,17600mm-600mm]=[14950mm,17000mm].

[0071] According to the length of the steel bar raw material and processing conditions, the optional length set of longitudinal steel bars K = {kl k}, for example, K={3m,4m,4.5m,5m}.

[0072] Step 2: Construct the chromosome a of the steel bar remodeling scheme t , a t Includes N values, a t ={sl tj}, j = 1 to N, sl tj The value range is the set K of optional lengths of longitudinal reinforcement, where a t The 2i-1th number a in t [2i-1] is the length of the long steel bar of the i-th layer low pile, where a t The 2ith number a in t [2i] is the length of the long steel bar of the pile at level i.

[0073] This embodiment uses a genetic algorithm to achieve intelligent re-sampling of longitudinal reinforcement, which requires a chromosome of the component reinforcement re-sampling scheme. The low pile length gjd and high pile length gjg of the consolidation of floor 1 (bottom floor) are generally fixed, but gjg-gjd>HK1 is required; gjd is preferably 1m, and gjg is preferably 2m. Considering that the top layer of reinforcement can be directly obtained by subtracting the length of the reinforcement of all the lower floors from the floor height, the reinforcement parameter that needs to be optimized is N=2F-4. Construct a chromosome, that is, construct a set a including N values t , a t ={sl tj}, j = 1 to N; sl tj The value range is the optional length set K of the steel bar; where at [2i-1] represents the length of the steel bar connected to the long pile of layer i, a t [2i] represents the length of the steel bar in the long connection of the pile at the i-th level.

[0074] Step 3: Set hyperparameters and generate the original solution library A0.

[0075] This embodiment uses a genetic algorithm to set hyperparameters, including setting the population size P, mutation probability bp, evolution generation Z, output scheme number Q, material waste weight lft, and joint same interval weight pjt; initialization generation z=0. Randomly select numbers from the longitudinal steel bar optional length set K to form P chromosomes a t , forming the initial solution library A0={a t}, t=1 to P.

[0076] Step 4: Calculate the fitness and selection probability of each solution in A0, generate the parent solution A1 according to the selection probability, cross the different solutions in A1 to form the sub-solution library A2, and let A0=A2.

[0077] Step 5: Perform mutation processing on solution library A0;

[0078] Step 6: After looping through Step 4 and Step 5 Z times, proceed to Step 7, where Z is the evolutionary generation, which is a preset value;

[0079] Step 7: Select the Q solutions with the highest fitness from A0 and add them to the result set A4. Q is the preset value and can be set as needed. For example, Q=10. Output the values ​​of each position of each element in A4 and the corresponding material length LF. t and the number of non-connected regions N t .

[0080] Step 8. According to the final solution selected by the user, output the quantity, diameter, length, and specification information of the longitudinal steel bars on each floor, form a steel bar sample list, and output the material cutting list.

[0081] The intelligent re-sampling method for longitudinal reinforcement of columns provided in this embodiment obtains basic information such as the elevation of each floor of the building, the cross-sectional dimensions of the longitudinal columns, and the number and diameter of longitudinal reinforcement bars, and calculates the total height of the longitudinal columns, the length of the longitudinal reinforcement connection area, the elevation of the longitudinal reinforcement connection range, and the set K of optional lengths of the longitudinal reinforcement. Then, a genetic algorithm is used to construct a chromosome of reinforcement re-sampling schemes, generate an original scheme library, and select several schemes with the highest fitness for users to choose from through crossover, mutation, and other means. A reinforcement re-sampling list is formed based on the scheme selected by the user, and a material list is output. This method realizes the optimization of column longitudinal reinforcement re-sampling while meeting compliance and constructability, and reduces material consumption and improves the efficiency of reinforcement re-sampling while ensuring compliance and constructability.

[0082] It should be noted that the fitness and selection probability in step 4 are basic concepts in genetic algorithm. The fitness F={F t}, selection probability S={S t}. The following is an introduction to the calculation of fitness and selection probability, which includes the following steps:

[0083] A1. Traverse each chromosome a in A0 t ;

[0084] A2. Initialize the fitness of chromosome F t =4M;

[0085] A3. Calculate chromosome a t The number of longitudinal reinforcements present in the non-connection zone is N t , fitness F t =F t -N t ;

[0086] A4. Use integer linear programming method to calculate the total length LF of material waste t ;

[0087] A5. After the traversal is completed, according to the fitness F t Calculate the selection probability S t ,in,

[0088] ;

[0089] A6. If z ≥ Z, the exit condition is met and go directly to step 6.

[0090] In step A3, chromosome a is calculated t The number of longitudinal reinforcements present in the non-connection zone is N t , specifically:

[0091] Setting N t =0;

[0092] Calculate the connection elevation of the low pile long steel bars on each floor i, and calculate the number that is not in the connectable area; the specific method is to set dh t1 =gjd, join the set DH t ; Loop iterative calculation dh ti+1 =dhi+at[2i-1], join the set DH t ; Synchronous calculation dh ti+1 Is it in the connectable area KLJ ti+1 If it is within the range, N t =N t +1;

[0093] Calculate the connection elevation of the long steel bars of the high pile at each floor i; the specific method is to set gh1=gjg, add the set GH t ; Loop iteration calculation gh ti+1 =gh ti +a t [2i], join the set GH t ; Synchronous calculation gh ti+1 Is it in the connectable area KL Jti+1 If it is within the range, N t =N t +1;

[0094] Calculate the number of low pile length and high pile length steel bars in a connection interval; the specific method is to traverse DH t Each element in dh ti If gh ti -dh ti <HK i, They belong to the same connection area, N t =N t +pjt.

[0095] In step A4, the total length LF of the material waste is calculated using the integer linear programming method. t , specifically:

[0096] For angle bars, rfjn i / 2 length a t [2i], rfjn i / 2 length a t [2i-1];

[0097] For the long side reinforcement, rfhn i The root length is a t [2i], rfhn i The root length is a t [2i-1];

[0098] For short side reinforcement, rfbn i The root length is a t [2i], rfbn i The root length is a t [2i-1];

[0099] The integer linear programming method is used to combine the chromosome elements into the length of the steel bar raw material, and the total length L of the steel bar raw material is calculated. t ; Calculate the length of wasted material LF t =L t -Hz;F t =F t -lft*LF t .

[0100] In step 4, the parent solution set A1 is generated according to the selection probability, and the solution with a higher selection probability in A0 will enter the parent solution set A1 multiple times. Specifically, it includes the following steps:

[0101] A41. Set A1 = {}; dp = 0;

[0102] A42. According to the selection probability S, use the roulette wheel method to select 1 solution from A0 and put it into the parent solution set A1, dp = dp + 1;

[0103] A43. If dp < P, loop and execute step A42; if dp ≥ P, then cross the different solutions in A1 to form the child solution set A2.

[0104] Combined with Figures 1 to 5 as shown, in step 4, cross the different solutions in A1 to form the child solution set A2, and set A0 = A2. Specifically:

[0105] B1. Set A2 = {};

[0106] B2. Randomly select two different solutions a i and a j from A1; and delete a i and a j from A1; use a random algorithm to randomly select an integer p in N as the crossover point;

[0107] B3. Cross the parent chromosomes a i and a j at point p, combine the first p-bit values of a i and the values after the p-th bit of a j to generate the child chromosomes a i ’ and a j ’;

[0108] B4. Add a j ’ and a j+1 ’ to A2; if there are elements in A1, return to step B2; if there are no elements in A1, enter step B5;

[0109] B5. Set z = z + 1; set A0 = A2.

[0110] As Figure 5 shown, cross the parent chromosomes a t and a q at point p to generate the offspring a t ’ and a q ’.

[0111] In step 5, perform mutation processing on the solution set A0. This is a common practice in the genetic algorithm. Specifically:

[0112] C1. Traverse each element a in A0 j ;

[0113] C2. According to the mutation probability bp, use the roulette method to determine the j Whether to mutate; if not, go back to step C1; if mutation is required, go to step C3;

[0114] C3. Randomly determine the mutation position by with equal probability between 1-N, and randomly select an element from the set K to replace a j The value of the by position completes the mutation.

[0115] The technical features of the above-described embodiments may be arbitrarily combined. To make the description concise, not all possible combinations of the technical features in the above-described embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0116] The above-mentioned embodiments only express several implementation modes of the present invention, and the description thereof is relatively specific and detailed, but it cannot be understood as limiting the scope of the invention. It should be pointed out that, for a person of ordinary skill in the art, several modifications and improvements can be made without departing from the concept of the present invention, and these all belong to the protection scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the attached claims.

Claims

1. A method for intelligent re-drawing of longitudinal reinforcement of a column, characterized in that: The steps include: Step 1: Obtain the elevation of each floor of the building, obtain the cross-sectional dimensions of the longitudinal column and the number and diameter of the longitudinal steel bars, determine the total height of the longitudinal column, determine the length of the longitudinal steel bar connection area, determine the elevation of the connectable range of the longitudinal steel bars on each floor, and determine the optional length set K of the longitudinal steel bars, wherein the longitudinal steel bars include low pile long steel bars and high pile long steel bars; Step 2: Construct the chromosome a of the steel bar remodeling scheme t , a t Includes N values, a t ={sl tj }, j = 1 to N, sl tj The value range is the set K of optional lengths of longitudinal reinforcement, where a t The 2i-1th number a in t [2i-1] is the length of the long steel bar of the i-th layer low pile, where a t The 2ith number a in t [2i] is the length of the long steel bar of the pile at the i-th level; Step 3: Set hyperparameters to generate the original solution library A0, A0={a t }, t = 1 to P, P is the population size, which is the preset value; Step 4: Calculate the fitness and selection probability of each solution in A0, generate the parent solution A1 according to the selection probability, cross the different solutions in A1 to form the sub-solution library A2, and let A0=A2; Step 5: Perform mutation processing on each solution in solution library A0; Step 6: After looping through Step 4 and Step 5 Z times, proceed to Step 7, where Z is the evolutionary generation, which is a preset value; Step 7: Select the Q solutions with the highest fitness from A0, add them to the result set A4, and output the values ​​of each position of each element in A4 and the corresponding material length LF t ; Step 8: Output the quantity, diameter, length, and specification information of the longitudinal steel bars of each floor according to the final solution selected by the user, form a steel bar sample list, and output a material list; Among them, in step 4, the fitness of each scheme of A0 is recorded as F, F={F t }, the selection probability is recorded as S, S={S t }, Calculate the number of chromosomes a in A0 t The fitness and selection probability of , and the parent plan A1 is generated according to the selection probability, including: A1. Traverse each chromosome a in A0 t ; A2. Initialize the fitness of chromosome F t =4M; A3. Calculate chromosome a t The number of longitudinal reinforcements present in the non-connection zone is N t , fitness F t =F t -N t ; A4. Use integer linear programming method to calculate the total length LF of material waste t ; A5. After the traversal is completed, according to the fitness F t Calculate the selection probability S t ,in, ； A6. If z ≥ Z, go directly to step 6; Among them, in step A3, chromosome a is calculated t The number of longitudinal reinforcements present in the non-connection zone is N t , specifically: Setting N t =0; Calculate the connection elevation of the low pile long steel bars on each floor i, and calculate the number of bars that are not in the connectable area; specifically include: setting dh t1 =gjd, join the set DH t , where gjd is the length of the long steel bar of the low pile consolidation of floor 1; dh is calculated by cyclic iteration ti+1 =dhi+a t [2i-1], join the set DH t ; Synchronous calculation dh ti+1 Is it in the connectable area KLJ ti+1 If it is within the range, N t =N t +1; Calculate the connection elevation of the long steel bars of the high pile at each floor i; specifically, set gh1=gjg, add the set GH t , where gjg is the length of the long steel bar of the high pile consolidating floor 1; gh is calculated by cyclic iteration ti+1 =gh ti +a t [2i], join the set GH t ; Synchronous calculation gh ti+1 Is it in the connectable area KL Jti+1 If it is within the range, N t =N t +1; Calculate the number of low pile long steel bars and high pile long steel bars in the same connection interval; specifically, traverse DH t Each element in dh ti , if gh ti -dh ti <HK i, They belong to the same connection area, N t =N t +pjt; In step A4, the total length LF of the material waste is calculated using the integer linear programming method. t , specifically: For angle bars, rfjn i / 2 length a t [2i], rfjn i / 2 length a t [2i-1]; For the long side reinforcement, rfhn i The root length is a t [2i], rfhn i The root length is a t [2i-1]; For short side reinforcement, rfbn i The root length is a t [2i], rfbn i The root length is a t [2i-1]; The integer linear programming method is used to combine the chromosome elements into the length of the steel bar raw material, and the total length L of the steel bar raw material is calculated. t ; Calculate the length of wasted material LF t =L t -Hz;F t =F t -lft*LF t .

2. The intelligent re-drawing method for longitudinal reinforcement of a column according to claim 1, characterized in that: The longitudinal column is a rectangular column, and the cross section of the rectangular column includes a long side length k i and the short side length b i ; The longitudinal reinforcement includes angle reinforcement, long side reinforcement and short side reinforcement; wherein the angle reinforcement data, long side reinforcement and short side reinforcement of the i floor are respectively denoted as rfj i 、rfb i 、rfh i ,in, rfj i ={diameter rfjd i , quantity rfjn i }, rfb i ={diameter rfbd i , quantity rfbn i }, rfh i ={diameter rfhd i , quantity rfhn i }; The length of the steel bar connection area is denoted as HK i , meet HK i =35*Max(rfjd i ,rfbd i ,rfhd i ).

3. The intelligent re-drawing method for longitudinal reinforcement of a column according to claim 2, characterized in that: Determine the specific elevation range of the longitudinal reinforcement connection on each floor as follows: The lowest and highest elevations of the beams on floor i that intersect with the longitudinal columns are denoted as hbd i 、hbu i , calculate the net height hn of floor i i , satisfying hn i =hbd i -hbu i-1 , where i = 1 to M, M is the total number of floors + 1, and hbu0 is the elevation of the bottom structural surface; For floor i, calculate the length of the non-connected area mc i , mc i =max(500mm,k i , hn i / 6); The elevation range of the connectable area of ​​floor i is recorded as KLJ i , meet: KLJ i =[hbu i-1 +mc i ,hbd i -mc i ].

4. The column longitudinal reinforcement intelligent re-drawing method according to claim 3, characterized in that: The ground elevation of the building floor i is denoted as H, H={h i }, i = 1 to M, M is the total number of floors + 1, H M The finished surface height of the roof structure; The total height of the longitudinal column is denoted as H z , satisfying H z =h M -h1.

5. The intelligent re-drawing method for longitudinal reinforcement of a column according to claim 4, characterized in that: N in step 2 satisfies, N=2M-4.

6. The intelligent re-drawing method for longitudinal reinforcement of a column according to claim 1, characterized in that: In step 3, set the hyperparameters to generate the original solution library A0, specifically: Set the population size P, mutation probability bp, evolutionary generation Z, output scheme number Q, material waste weight lft, joint same interval weight pjt, and initialize the generation z=0; Randomly select numbers from K to form P chromosomes a t , forming the initial solution library A0={a t }, t=1 to P.

7. The intelligent re-drawing method for longitudinal reinforcement of a column according to claim 6, characterized in that: In step 4, different solutions in A1 are crossed to form a sub-solution library A2, and A0=A2 is set, specifically: B1. Set A2 = {}; B2. Randomly select two different solutions a from A1 i and a j ; and a i and a j Delete from A1; use a random algorithm to randomly select an integer p in N as the intersection point; B3. Change the parent chromosome a i and a j Crossover at point p, a i The first p digits of the value and a j The p bits are then combined numerically to generate sub-chromosome a i ',a j '; B4. j ',a j+1 'Add to A2; if there is an element in A1, return to step B2; if there is no element in A1, go to step B5; B5. Set z=z+1; set A0=A2.

8. The intelligent re-drawing method for longitudinal reinforcement of a column according to claim 6, characterized in that: In step 5, the solution library A0 is mutated, specifically: C1. Traverse each element a in A0 j ; C2. According to the mutation probability bp, the roulette method is used to determine the j Whether to mutate; if not, go back to step C1; if mutation is required, go to step C3; C3. Randomly determine the mutation position by with equal probability between 1-N, and randomly select an element from the set K to replace a j The value of the by position completes the mutation.

Images