CN102289597A - Method for identifying pre-stressed secondary tensioning inflection point - Google Patents

Method for identifying pre-stressed secondary tensioning inflection point Download PDF

Info

Publication number
CN102289597A
CN102289597A CN2011102464187A CN201110246418A CN102289597A CN 102289597 A CN102289597 A CN 102289597A CN 2011102464187 A CN2011102464187 A CN 2011102464187A CN 201110246418 A CN201110246418 A CN 201110246418A CN 102289597 A CN102289597 A CN 102289597A
Authority
CN
China
Prior art keywords
point
value
data
flex point
chromosome
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.)
Granted
Application number
CN2011102464187A
Other languages
Chinese (zh)
Other versions
CN102289597B (en
Inventor
但远宏
刘恒洋
曹琼
黄贤英
刘贞
施於人
阎建明
朱新才
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Chongqing University of Technology
Original Assignee
Chongqing University of Technology
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Chongqing University of Technology filed Critical Chongqing University of Technology
Priority to CN 201110246418 priority Critical patent/CN102289597B/en
Publication of CN102289597A publication Critical patent/CN102289597A/en
Application granted granted Critical
Publication of CN102289597B publication Critical patent/CN102289597B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Abstract

The invention discloses a method for identifying a pre-stressed secondary tensioning inflection point, belonging to the field of identification of pre-stressed anchor system inflection points in engineering. The method comprises the following steps of: pre-processing an actual measurement data point set; removing death section data, nonlinear section data and descending section data; filtering abnormal data points; re-collecting effective data; optimizing and searching to obtain optimized inflection point parameters; and finally, judging the effectiveness of the inflection points so that the inflection points are identified. By means of the method disclosed by the invention, the manual operation is unnecessary; and the inflection points can be identified rapidly, reliably, precisely and automatically.

Description

Prestress two times tensioning flex point discrimination method
Technical field
The present invention relates to prestress two times tensioning flex point discrimination method, especially a kind of method of utilizing the automatic identification prestress of computer two times tensioning flex point.
Background technology
The accurate identification of prestressed stretch-draw point of inflexion on a curve has significance in actual engineering.Slope data such as (being the elastic deformation coefficient) before and after flex point place tension force (also claiming " load ") and the flex point can be used for: the detection of dynamic of the quality testing of prestress equipment (as cable wire, rod iron, prestressed anchor etc.), disaster (as landslide, earthquake etc.), the examination of engineering construction (bridge, highway, tunnel etc.).Now the engineering application case briefly is listed below.
1. slope and land slide disaster monitoring
Installation method: be similar to installation method shown in Figure 1, the monitoring that A point among Fig. 1 and B point is fixed on side slope is with, and applies tension force at AB section cable wire in advance F 0When carrying out the landslide disaster monitoring, obtain tension force-elongation curve by applying external tension, and be by identification algorithm acquisition flex point tension force F 1, can calculate the relative displacement that A point and B are ordered on the side slope thus and be:
Figure 2011102464187100002DEST_PATH_IMAGE002
In the following formula k 1Be known AB section cable wire elasticity coefficient.Can carry out the monitoring and the early warning of landslide disaster according to this relative displacement.
2. acceptance of engineering quality
At present prestressing technique has been widely used in the middle of all kinds of engineerings, promotes with reinforcing as the prestress of the super span building of supporting, ultra-high overweight (as station, theatre, bridge) of the slope reinforcement in the hydraulic engineering, building foundation pit excavation etc.These engineerings tension force to the prestress anchoraging system when the design phase has the strict design standard, need carry out the strictness test to these rated tensions in the acceptance of work stage.Can detect tension force-elongation data by the prestress anchoraging system as shown in Figure 1 that reserves, use the flex point identification technique then and obtain flex point tension force (load), the contrast design standards can check whether installation and design requires to construct.
3. prestressed anchor quality testing
Whether the prestressed stretch-draw anchor system is safe and reliable, not only is directly connected to the normal use of structure, also is related to engineering staff's the security and the permanance of construction quality simultaneously.The quality of presstressed reinforcing steel can guarantee, and prestressed anchor and connector product are little in batches because specification is more, cause product quality stable inadequately.Therefore before selecting a kind of prestressed anchor for use, to carry out pick test to product.Wherein a kind of important method of inspection is installed according to method shown in Figure 1 with regard to being to use sampling ground tackle and standard cable wire, carry out repeatedly stretch-draw test, and use the flex point discrimination method and obtain slope before and after flex point tension force and the flex point, contrast the data that repeatedly stretch-draw identification obtains and can judge whether ground tackle has the retraction loss of loosening and two times tensioning whether to reach design standards etc.(annotate: the variation explanation ground tackle clamping shakiness or the ground tackle generation deformation of flex point tension force, and variation has taken place in the length of two sections cable wires of the same explanation of the variation of slope, under the qualified situation of cable wire, illustrates that then ground tackle is out of joint).
All kinds of elastic utensils of using always in building operation (as presstressed reinforcing steel, rod iron, cable wire, screw-thread steel etc.) are followed Hooke's law in certain elastic deformation scope, promptly the elongation of reinforcing bar (amount of elastic deformation) is directly proportional with tension force (elastic force).Its relation can be expressed as:
Figure 2011102464187100002DEST_PATH_IMAGE004
, wherein FFor tension force, xFor elongation, kBe elasticity coefficient.Elasticity coefficient wherein kWith specifically relevant by the physical parameter of tension reinforcing steel bar, as: the reinforcing bar radical of reinforcing bar material, bar cross section size, reinforcing bar length, simultaneous tension etc.Know that according to Hooke's law elasticity coefficient and reinforcing bar length are inversely proportional to, be directly proportional with simultaneous tension reinforcing bar radical that promptly the long more elasticity coefficient of reinforcing bar is more little, the many more elasticity coefficient of tension reinforcing steel bar radical are big more.
In actual engineering, produced the cable wire quality by detecting, or dynamic monitoring engineering situation, the anchoring of usually cable wire being carried out is as shown in Figure 1 installed.In Fig. 1, earlier cable wire one end is fixed on the A point, applying prescribed tension F 0Make cable wire uphold the back and fix by clamping device, if the elasticity coefficient of note AB section cable wire is at the B point k 1, then the tension force of AB section cable wire-elongation concerns as the formula (1).Outside the B point, reserve designated length L 2Cable wire so that the follow-up two times tensioning that carries out.
Figure 2011102464187100002DEST_PATH_IMAGE006
(1)
When the C point carries out two times tensioning in Fig. 1, if the tension force that applies less than F 0The time, only BC section cable wire carries out stretch-draw, and original length is designated as L 2, elasticity coefficient is designated as k 2, then BC section cable tension-elongation concerns as the formula (2).When the tension force that applies greater than F 0The time, the clamping device at B point place is loosening, and AB section cable wire and BC section cable wire constitute integral body and carry out stretch-draw simultaneously, and according to the series connection formula of Hooke's law, this moment, the elasticity coefficient of AC section cable wire was k 1 k 2/ ( k 1+ k 2), its tension force-elongation concerns as the formula (3).
Figure 2011102464187100002DEST_PATH_IMAGE008
(2)
Figure 2011102464187100002DEST_PATH_IMAGE010
(3)
Because k 1, k 2Be arithmetic number, as can be known
Figure 2011102464187100002DEST_PATH_IMAGE012
,, the tension force-elongation curve in the two times tensioning journey of prestress anchoraging shown in Figure 1 system can be depicted as curve as shown in Figure 2 again according to formula (1)-(3).OG section straight line is for having reflected BC section cable tension among Fig. 1-elongation relation among the figure, and straight slope is k 2(BC section cable wire elasticity coefficient).When the tension force that applies greater than F 0The time, the stretch-draw cable wire is from BC section (elasticity coefficient k 2) become AC section (elasticity coefficient k 1 k 2/ ( k 1+ k 2)), tension force-elongation relation curve of this moment is the GP section straight line among Fig. 2, slope is k 1 k 2/ ( k 1+ k 2), and the OG slope over 10 is greater than the GP slope over 10.
As previously mentioned, the tension force that applies is from 0 process that increases gradually, and tension force-elongation relation will experience the process shown in Fig. 2 curve.The actual measurement tension force at flex point G place F 0And the actual measurement slope of flex point G front and back straight line ( k 2, k 1 k 2/ ( k 1+ k 2)) in all kinds of engineerings significance and effect are arranged.
Yet the practical project data are not to be made of two sections straight lines as shown in fig. 2, but curve as shown in Figure 3.Often exist in the measured data: 1. because the dead band characteristic section (as the OA section curve among Fig. 3 a) that pick-up unit and pressue device dead band characteristic cause, 2. the non-linear section that is caused by nonlinear characteristic outside the cable wire effective elasticity deformation interval is (as the AB section among Fig. 3 a, and the OA section among Fig. 3 b), 3. the abnormal data (being marked) that causes by sensor or other reason as Fig. 3,4. cause by the retraction loss of ground tackle two times tensioning with the ascent stage (as the OC section curve among Fig. 3 a, and the OD section curve among Fig. 3 b) the diverse descending branch of characteristic (CD section among Fig. 3 a reaches DE section among Fig. 3 b), 5. because actual tension applies the lack of uniformity that the randomness of process causes the sampled data space distribution.And flex point also changed into by ideally single point (G point among Fig. 2) may interval range (BC segment among Fig. 3 b).
In sum, because every interference of measured data, its flex point can not directly calculate as ideally, or accurately obtains by range estimation.But must carry out identification by effective and reasonable algorithm.
Present actual engineering mainly adopts the method for artificial cognition, is about to detect data and is printed on the paper, and the technician is according to the geometric configuration of personal experience and curve then, and conventional tool such as employing ruler pencil mark and measure flex point on drawing.The shortcoming of this method has: the ⑴ poor reliability, depend critically upon engineering staff's personal experience and visual experience, and can't accomplish repeatability; ⑵ accuracy of identification is poor, and the measurement of flex point value only relies on conventional tool such as ruler, can't draw exact value; ⑶ real-time is poor, owing to adopt manually-operated, recognition speed is relatively slow, can't realize online in real time monitoring and follow-up intelligent decision.
Summary of the invention
The purpose of this invention is to provide a kind of prestress two times tensioning flex point discrimination method, need not manual operations, can fast, reliably and accurately automatic identification flex point.
To achieve these goals, the invention provides a kind of prestress two times tensioning flex point discrimination method, it may further comprise the steps:
S1, collection obtain the set of measured data point
Figure 2011102464187100002DEST_PATH_IMAGE014
, wherein
Figure 2011102464187100002DEST_PATH_IMAGE016
Be the measured data point,
Figure 2011102464187100002DEST_PATH_IMAGE018
Be the actual measurement tension value,
Figure 2011102464187100002DEST_PATH_IMAGE020
Be the actual measurement elongation, wherein i, n are the integer greater than 1;
Dead track data, non-linear section data and descending branch data in the described measured data point set are promptly removed in significant figure strong point in S2, the described measured data point set of screening, obtain the set of valid data point
Figure 2011102464187100002DEST_PATH_IMAGE022
S3, the described valid data point set of filtration
Figure 648234DEST_PATH_IMAGE022
The middle exceptional data point that exists obtains filtered valid data point set , wherein i, m are the integer greater than 1;
S4, equidistantly gather described filtered valid data point set again
Figure 2011102464187100002DEST_PATH_IMAGE026
, set of data points after the acquisition pre-service
Figure 2011102464187100002DEST_PATH_IMAGE028
, wherein i, m 'Be integer greater than 1;
Two equation of line are expressed as in S5, the desirable prestress two times tensioning of setting and the flex point curve
Figure 2011102464187100002DEST_PATH_IMAGE030
, wherein
Figure 2011102464187100002DEST_PATH_IMAGE032
,
Figure 2011102464187100002DEST_PATH_IMAGE034
The slope of representing two equation of line respectively,
Figure 2011102464187100002DEST_PATH_IMAGE036
,
Figure 2011102464187100002DEST_PATH_IMAGE038
The intercept of representing two equation of line respectively,
Figure 2011102464187100002DEST_PATH_IMAGE040
The coordinate at expression flex point place,
Figure 2011102464187100002DEST_PATH_IMAGE042
The actual measurement tension value at expression flex point place,
Figure 2011102464187100002DEST_PATH_IMAGE044
The actual measurement stretch value at expression flex point place, wherein subscript G is the integer greater than 1;
S6, according to set of data points after the pre-service Ask for parameter
Figure 619732DEST_PATH_IMAGE032
,
Figure 16822DEST_PATH_IMAGE034
, ,
Figure 958550DEST_PATH_IMAGE038
With
Figure 2011102464187100002DEST_PATH_IMAGE048
The central point of feasible span
Figure 2011102464187100002DEST_PATH_IMAGE050
,
Figure 2011102464187100002DEST_PATH_IMAGE052
,
Figure 2011102464187100002DEST_PATH_IMAGE054
,
Figure 2011102464187100002DEST_PATH_IMAGE056
With
Figure 2011102464187100002DEST_PATH_IMAGE058
, wherein
Figure 355028DEST_PATH_IMAGE048
,
Figure 542427DEST_PATH_IMAGE058
Be used to represent the subscript position of described flex point, and both are the integer greater than 1;
S7, with the central point of described feasible span
Figure 527700DEST_PATH_IMAGE050
,
Figure 24409DEST_PATH_IMAGE052
,
Figure 32817DEST_PATH_IMAGE054
,
Figure 771709DEST_PATH_IMAGE056
With
Figure 611489DEST_PATH_IMAGE058
Be the center, expansion obtains feasible span, described feasible span is optimized searches for the parameter that is optimized
Figure 29832DEST_PATH_IMAGE032
, ,
Figure 304005DEST_PATH_IMAGE036
,
Figure 998291DEST_PATH_IMAGE038
With
S8, according to described parameters optimization
Figure 321267DEST_PATH_IMAGE032
,
Figure 716477DEST_PATH_IMAGE034
,
Figure 452220DEST_PATH_IMAGE036
,
Figure 540262DEST_PATH_IMAGE038
With
Figure 744978DEST_PATH_IMAGE048
Judging the validity of flex point, if effectively then judge that described flex point is effective flex point, otherwise is invalid flex point.
Screening significant figure strong point is made up of following steps among the described step S2:
The tension range of S20, the single presstressed reinforcing steel of setting is:
Figure 2011102464187100002DEST_PATH_IMAGE060
, wherein
Figure 2011102464187100002DEST_PATH_IMAGE062
Be the tension force lower bound,
Figure 2011102464187100002DEST_PATH_IMAGE064
Be the tension force upper bound, then described valid data point set
Figure 629364DEST_PATH_IMAGE022
The subscript of middle valid data starting point is expressed as
Figure 2011102464187100002DEST_PATH_IMAGE066
, wherein
Figure 2011102464187100002DEST_PATH_IMAGE068
, m is a simultaneous tension presstressed reinforcing steel radical,
Figure 2011102464187100002DEST_PATH_IMAGE070
,
Figure 2011102464187100002DEST_PATH_IMAGE072
Be given constant, promptly minimum effective elasticity deformation quantity;
S21, the set of described valid data point
Figure 94981DEST_PATH_IMAGE022
The subscript of middle valid data end point is expressed as
Figure 2011102464187100002DEST_PATH_IMAGE074
, wherein:
Figure 2011102464187100002DEST_PATH_IMAGE076
Figure 2011102464187100002DEST_PATH_IMAGE078
S22, the described valid data point set of acquisition
Figure 2011102464187100002DEST_PATH_IMAGE080
, wherein D is the set of measured data point, wherein i, n are the integer greater than 1.
Filtering exceptional data point among the described step S3 adopts median average filter algorithm that described valid data point is gathered Tension data and elongation data carry out filtering, form by following steps:
S30, for the significant figure strong point , with the tension data at significant figure strong point in its R radius
Figure 921303DEST_PATH_IMAGE018
With the elongation data
Figure 658314DEST_PATH_IMAGE020
Sort respectively, remove tension data
Figure 119383DEST_PATH_IMAGE018
Maximal value and minimum value, ask for the mean value of residue tension data, promptly obtain the value of tension data in the described significant figure strong point
Figure 2011102464187100002DEST_PATH_IMAGE084
, formulate is:
Figure 2011102464187100002DEST_PATH_IMAGE086
S31, removal elongation data
Figure 234713DEST_PATH_IMAGE020
Maximal value and minimum value, ask for the mean value of residual elongation amount data, promptly obtain the value of elongation data in the described significant figure strong point
Figure 2011102464187100002DEST_PATH_IMAGE088
, formulate is: , wherein , and the value of R is 3;
S32, the valid data point that obtains are after filtering gathered
Figure 335393DEST_PATH_IMAGE026
, wherein
Figure 876096DEST_PATH_IMAGE024
Described step S4 intermediate reach is gathered again and is adopted Lagrangian parabolic interpolation algorithm, to valid data point set after filtering
Figure 457250DEST_PATH_IMAGE026
Wait elongation interpolation at interval, form by following steps:
S40, setting elongation are spaced apart
Figure 2011102464187100002DEST_PATH_IMAGE094
, and the elongation upper bound and lower bound are respectively
Figure 2011102464187100002DEST_PATH_IMAGE096
,
Figure 2011102464187100002DEST_PATH_IMAGE098
, get The integer conduct Value, promptly
Figure 2011102464187100002DEST_PATH_IMAGE104
, then the elongation interpolation point is
Figure 2011102464187100002DEST_PATH_IMAGE106
,
Figure 2011102464187100002DEST_PATH_IMAGE108
Tension value after the elongation interval interpolation such as S41, the acquisition of the Lagrangian parabolic interpolation algorithm of employing
Figure 2011102464187100002DEST_PATH_IMAGE110
With the elongation value
Figure 2011102464187100002DEST_PATH_IMAGE112
:
Figure 2011102464187100002DEST_PATH_IMAGE114
,
Wherein
Figure 2011102464187100002DEST_PATH_IMAGE116
And
Figure 2011102464187100002DEST_PATH_IMAGE118
,
Figure 2011102464187100002DEST_PATH_IMAGE120
For
Figure 2011102464187100002DEST_PATH_IMAGE122
In be positioned at the interval Interior elongation sampled point,
Figure 2011102464187100002DEST_PATH_IMAGE126
For
Figure 41684DEST_PATH_IMAGE120
Pairing tension value,
Figure 2011102464187100002DEST_PATH_IMAGE128
For
Figure 393774DEST_PATH_IMAGE122
In be positioned at this interval sampled data points number, wBe the interpolation exponent number;
Set of data points after the pre-service after the interpolation of elongation such as S42, acquisition interval
Figure 2011102464187100002DEST_PATH_IMAGE130
Asking for feasible span central point among the described step S6 forms after by following steps:
S60, initiation parameter
Figure 659539DEST_PATH_IMAGE050
,
Figure 783616DEST_PATH_IMAGE052
,
Figure 289683DEST_PATH_IMAGE054
, With
Figure 326089DEST_PATH_IMAGE058
, and initialization slope differences e kBe zero, e wherein k=| k 1-k 2|;
S61, after the pre-service set of data points
Figure 865524DEST_PATH_IMAGE046
First data point
Figure 2011102464187100002DEST_PATH_IMAGE132
Travel through set of data points after the whole pre-service
Figure 431241DEST_PATH_IMAGE046
, write down current data point
Figure 2011102464187100002DEST_PATH_IMAGE134
S62, calculated candidate parameter central point
Figure 2011102464187100002DEST_PATH_IMAGE136
, ,
Figure 2011102464187100002DEST_PATH_IMAGE140
,
Figure 2011102464187100002DEST_PATH_IMAGE142
,
Figure 2011102464187100002DEST_PATH_IMAGE144
, wherein
Figure 2011102464187100002DEST_PATH_IMAGE146
Figure 2011102464187100002DEST_PATH_IMAGE148
Figure 2011102464187100002DEST_PATH_IMAGE150
S63, judge whether
Figure 2011102464187100002DEST_PATH_IMAGE156
, if then:
Figure 2011102464187100002DEST_PATH_IMAGE158
Figure 2011102464187100002DEST_PATH_IMAGE160
Figure 2011102464187100002DEST_PATH_IMAGE162
Figure 2011102464187100002DEST_PATH_IMAGE164
Figure 2011102464187100002DEST_PATH_IMAGE168
S64, judge whether to have traveled through set of data points after the described pre-service In all data points, if judge and to have traveled through all data points then continue execution, otherwise carry out described step S62~S64;
The central point of S65, the feasible span of acquisition
Figure 562498DEST_PATH_IMAGE050
,
Figure 972751DEST_PATH_IMAGE052
,
Figure 820621DEST_PATH_IMAGE054
,
Figure 932802DEST_PATH_IMAGE056
With
Figure 157110DEST_PATH_IMAGE058
Feasible span is as follows among the described step S7:
Figure 2011102464187100002DEST_PATH_IMAGE170
Figure 2011102464187100002DEST_PATH_IMAGE174
Figure 2011102464187100002DEST_PATH_IMAGE176
Figure 2011102464187100002DEST_PATH_IMAGE178
Wherein
Figure 2011102464187100002DEST_PATH_IMAGE180
Be the region of search spreading coefficient,
Figure 2011102464187100002DEST_PATH_IMAGE182
The big more possibility that then searches globally optimal solution of value just heals big, but institute's time-consuming is just long more, and speed of convergence is also slow more; Otherwise value is more little, and then to obtain the possibility of globally optimal solution just more little, but speed of convergence can be faster, consuming time shorter;
And adopt genetic algorithm that described feasible span is optimized search: to set gene and be respectively 5 parameter to be optimized: k 1, k 2, b 1, b 2Idx, 5 parameters constitute chromosome in the mode of real coding, a plurality of chromosomes constitute population, population is from the pursue parameter optimisation procedure that for evolutionary process then constituted genetic algorithm of parent to filial generation, and adopt fitness function to calculate each chromosomal fitness value in the genetic algorithm, thereby estimate each chromosomal adaptability, so that the natural evolution rule of simulation " survival of the fittest ".
Described feasible span is optimized search to be made up of following steps:
S70, initialization population: adopt the field mouth orthogonal experimental method in the statistics, carry out the initialization operation of population, all be evenly distributed in the feasible span so that guarantee all chromosome, orthogonal arrage is designated as
Figure 2011102464187100002DEST_PATH_IMAGE184
, the initialization algorithm of population is as follows:
Figure 2011102464187100002DEST_PATH_IMAGE186
Wherein The value of j chromosomal i gene in the expression population, inf (g i) expression i gene the value lower bound, sup (g i) expression i gene the value upper bound, L 100The capable i row of a j element of [i] [j] expression orthogonal arrage, setting the population size is w, i.e. and the parent chromosome number that initialization generates is w, and wherein w is the integer greater than zero;
S71, calculating fitness value: adopt fitness function, each chromosomal fitness value is:
Figure 2011102464187100002DEST_PATH_IMAGE190
Wherein
Figure 2011102464187100002DEST_PATH_IMAGE192
, Be the value of the 1st gene in i chromosome in the population, i.e. k 1
Figure 2011102464187100002DEST_PATH_IMAGE196
Be the value of the 2nd gene in i chromosome in the population, i.e. k 2
Figure 2011102464187100002DEST_PATH_IMAGE198
Be the value of the 3rd gene in i chromosome in the population, i.e. b 1
Figure 2011102464187100002DEST_PATH_IMAGE200
Be the value of the 4th gene in i chromosome in the population, i.e. b 2
Figure 2011102464187100002DEST_PATH_IMAGE202
Be the value of the 5th gene in i chromosome in the population, i.e. idx;
Figure 2011102464187100002DEST_PATH_IMAGE204
S72, intersection:
Matching operation based on the hamming distance: for avoiding inbreeding, before carrying out interlace operation, calculate the hamming distance between the chromosome earlier, only the distance of the hamming between chromosome just can be matched two chromosomes greater than 2 o'clock ,
Figure 2011102464187100002DEST_PATH_IMAGE208
Between the hamming distance definition as follows:
Figure 2011102464187100002DEST_PATH_IMAGE210
Figure 2011102464187100002DEST_PATH_IMAGE212
The interlace operation of variable precision: two chromosomes ,
Figure 703291DEST_PATH_IMAGE208
Variable precision interlace operation algorithm as follows:
Produce the position, point of crossing at first at random:
Figure 2011102464187100002DEST_PATH_IMAGE214
, wherein
Figure 2011102464187100002DEST_PATH_IMAGE216
Expression produces random number;
Suppose that the new individuality after i=3 intersects is as follows:
Figure 2011102464187100002DEST_PATH_IMAGE218
Wherein:
Figure 2011102464187100002DEST_PATH_IMAGE220
,
Figure 2011102464187100002DEST_PATH_IMAGE222
Be the random weighting number, inf (g 3) expression gene g 3The value lower bound, sup (g 3) expression gene g 3The value upper bound, if certain gene is repeatedly selected, the precision of this gene will increase gradually in search procedure, the setting crossing-over rate is v, then generates the new chromosome of v * w behind cross match, wherein v gets less than 1 greater than 0 fractional value;
S73, variation: the mixovariation operation of adopting the variation of 2 variations and multiple spot to combine, 2 mutation operations;
S74, selection: adopt the mode of roulette to select, to safeguard the gene diversity of population, w parent chromosome and fitness is the highest in v * w the new chromosome that cross match generates chromosome directly as population of future generation, are chosen w-1 again as population of future generation from remaining chromosome;
S75, continue to carry out above-mentioned steps S72~S74, reach to specify until two the straight-line equation tracks and the measured data goodness of fit and require or evolutionary generation reaches designated value, then withdraw from the described parameters optimization k of acquisition 1, k 2, b 1, b 2, idx.
The judgement of flex point validity comprises among the described step S8:
The judgement of elasticity coefficient validity, if
Figure 2011102464187100002DEST_PATH_IMAGE224
Judge that then elasticity coefficient is invalid, the flex point that searches is invalid flex point;
The judgement of flex point tension force validity, if
Figure DEST_PATH_IMAGE226
With F 0Existence judges that then the flex point that searches is invalid flex point, wherein than big-difference Be actual measurement flex point tension force, F 0Be desirable flex point tension force.
Described w value is 100, and described v value is 0.8.
In sum, owing to adopted technique scheme, the invention has the beneficial effects as follows:
The prestress two times tensioning flex point discrimination method that the present invention adopts can fast, reliably and accurately automatic identification flex point.
Description of drawings
The present invention will illustrate by example and with reference to the mode of accompanying drawing, wherein:
Fig. 1 is the fixing and stretch-draw synoptic diagram of anchor cable;
Fig. 2 is desirable two times tensioning curve and flex point synoptic diagram;
Fig. 3 is engineering measurement tension force-elongation curve figure;
Fig. 4 is overall flow figure of the present invention;
Fig. 5 is that chromosome is formed synoptic diagram;
Fig. 6 is that population constitutes synoptic diagram;
Fig. 7 is a population evolutionary process synoptic diagram;
Fig. 8 is the process flow diagram of optimization searching flex point;
Fig. 9 is the flex point identification result figure of measured data 1;
Figure 10 is the flex point identification result figure of measured data 2.
Embodiment
Disclosed all features in this instructions, or the step in disclosed all methods or the process except mutually exclusive feature and/or step, all can make up by any way.
Disclosed arbitrary feature in this instructions (comprising any accessory claim, summary and accompanying drawing) is unless special narration all can be replaced by other equivalences or the alternative features with similar purpose.That is, unless special narration, each feature is an example in a series of equivalences or the similar characteristics.
The flex point of prestress two times tensioning is defined as: applying in the hypertension point of interface between two sections different elasticity coefficient stretch-draw curves gradually to the prestress anchoraging system.Definition according to flex point, the essence of flex point identification can be described as: find two straight-line equations, make the track of these two straight lines in measurement range with the trajectory error minimum of measured data, then the slope of these two straight lines is the elasticity coefficient of cable wire, the intersection point of these two straight lines is flex point.The mathematical description of this problem is as follows:
Search parameter
Figure 552036DEST_PATH_IMAGE032
(straight-line equation 1 slope),
Figure 314455DEST_PATH_IMAGE034
(straight-line equation 2 slopes),
Figure 433721DEST_PATH_IMAGE036
(straight-line equation 1 intercept),
Figure 888973DEST_PATH_IMAGE038
(straight-line equation 2 intercepts),
Figure DEST_PATH_IMAGE230
(two straight lines are preset intersecting point coordinate, and promptly certain in the measured data a bit)
Make measured data
Figure 975747DEST_PATH_IMAGE014
Wherein
Figure DEST_PATH_IMAGE232
Be the measured data point, Be the actual measurement tension value,
Figure DEST_PATH_IMAGE236
Be the actual measurement elongation.
With two straight-line equations
Figure DEST_PATH_IMAGE238
The discrete sampling data:
Figure 165026DEST_PATH_IMAGE030
(4)
The absolute error minimum:
Figure DEST_PATH_IMAGE240
(5)
Then satisfy this condition Be optimum flex point,
Figure 764952DEST_PATH_IMAGE032
,
Figure 339022DEST_PATH_IMAGE034
It is the elasticity coefficient of two sections different stretching processes.
Yet because the actual data that record exist various interference, therefore before carrying out the flex point identification, need data are carried out pre-service, comprising:
⑴ screening valid data section: reject dead band, non-linear and descending branch data in the measurement data;
⑵ filter exceptional data point: adopt low-pass filtering, the abnormal data in the measurement data is rejected;
⑶ equidistant resampling: adopt interpolation algorithm, measurement data is waited displacement interpolation at interval, eliminate the space lack of uniformity of measured data.
After executing aforesaid data pretreatment operation, can enter flex point identification link, this link comprises following steps:
⑴ calculate feasible flex point scope: according to the geometrical feature of data and curves after the pre-service, use algebraic method and tentatively determine the possible span of flex point, as the basis of follow-up optimization;
⑵ search for optimum flex point: according to possibility flex point scope, the application enhancements genetic algorithm is searched for two sections stretch-draw slope of a curves and corner position, finds out optimal resilience coefficient and corner position.
⑶ flex point validity is judged: Given information carries out the rationality judgement to the flex point and the elasticity coefficient that search out.
As shown in Figure 4, this prestress two times tensioning flex point discrimination method may further comprise the steps:
S1, collection obtain the set of measured data point
Figure 443244DEST_PATH_IMAGE014
, wherein
Figure 537102DEST_PATH_IMAGE016
Be the measured data point,
Figure 334156DEST_PATH_IMAGE018
Be the actual measurement tension value,
Figure 942992DEST_PATH_IMAGE020
Be the actual measurement elongation, wherein i, n are the integer greater than 1;
S2, Screening valid data section: screen the significant figure strong point in the described measured data point set, promptly remove dead track data, non-linear section data and descending branch data in the described measured data point set, obtain the set of valid data point
Figure 804900DEST_PATH_IMAGE022
Specifically carry out according to following steps:
S20, set single presstressed reinforcing steel (steel strand wires, rod iron etc.) and follow the tension range of Hooke's law and be:
Figure 815582DEST_PATH_IMAGE060
, wherein
Figure 721221DEST_PATH_IMAGE062
Be the tension force lower bound, Be the tension force upper bound, the measured data point set is combined into:
Figure 263377DEST_PATH_IMAGE014
, wherein
Figure 581095DEST_PATH_IMAGE232
Be the measured data point, f i Be the actual measurement tension value, s i Be the actual measurement elongation, then described valid data point set
Figure 719952DEST_PATH_IMAGE022
The subscript of middle valid data starting point is expressed as
Figure 241064DEST_PATH_IMAGE066
,
Wherein: , m is a simultaneous tension presstressed reinforcing steel radical,
Figure 476053DEST_PATH_IMAGE070
,
Figure 471297DEST_PATH_IMAGE072
Be given constant, promptly minimum effective elasticity deformation quantity;
S21, the set of described valid data point
Figure 542022DEST_PATH_IMAGE022
The subscript of middle valid data end point is expressed as
Figure 595428DEST_PATH_IMAGE074
, wherein:
Figure 372891DEST_PATH_IMAGE076
Figure 853551DEST_PATH_IMAGE078
S22, the described valid data point set of acquisition
Figure 332943DEST_PATH_IMAGE080
, wherein D is the set of measured data point, wherein i, n are the integer greater than 1.
S3, Filter exceptional data point: filter described valid data point set
Figure 190041DEST_PATH_IMAGE022
The middle exceptional data point that exists obtains filtered valid data point set , wherein i, m are the integer greater than 1.Consider that therefore main interference source adopts median average filter algorithm that tension force and elongation data are carried out filtering based on impulse disturbances in the set of measured data point, specifically form by following steps:
S30, for the significant figure strong point , with the tension data at significant figure strong point in its R radius
Figure 518888DEST_PATH_IMAGE018
With the elongation data
Figure 602513DEST_PATH_IMAGE020
Sort respectively, remove tension data
Figure 151306DEST_PATH_IMAGE018
Maximal value and minimum value, ask for the mean value of residue tension data, promptly obtain the value of tension data in the described significant figure strong point
Figure 239347DEST_PATH_IMAGE084
, formulate is:
Figure 444064DEST_PATH_IMAGE086
S31, removal elongation data
Figure 564335DEST_PATH_IMAGE020
Maximal value and minimum value, ask for the mean value of residual elongation amount data, promptly obtain the value of elongation data in the described significant figure strong point
Figure 233214DEST_PATH_IMAGE088
, formulate is:
Figure 492157DEST_PATH_IMAGE086
, wherein
Figure 918590DEST_PATH_IMAGE092
, and the value of R is relevant with measured data point itself with the sample frequency of measured data point, and the R value is 3 in an embodiment of the present invention;
S32, the valid data point that obtains are after filtering gathered
Figure 921181DEST_PATH_IMAGE026
, wherein
Figure 444567DEST_PATH_IMAGE024
S4, Equidistantly gather again: generally, the actual data point set that sampling obtains spatially is very unbalanced.Because the artificial origin may stop for a long time in a certain tension level, causes same tension force-elongation data to be repeated sampling repeatedly, also possible tension force increase is very fast, causes this regional sampled data space interval very big.For eliminating the unbalanced interference in space of measured data, need equidistantly to gather again described filtered valid data point set to the flex point identification , set of data points after the acquisition pre-service
Figure DEST_PATH_IMAGE242
, wherein i, m 'Be integer greater than 1; Adopt Lagrangian parabolic interpolation algorithm that valid data point is after filtering gathered among the present invention
Figure 473626DEST_PATH_IMAGE026
Wait elongation interpolation at interval, form by following steps:
S40, setting elongation are spaced apart , and the elongation upper bound and lower bound are respectively
Figure 392221DEST_PATH_IMAGE096
,
Figure 179917DEST_PATH_IMAGE098
, get
Figure 643259DEST_PATH_IMAGE100
The integer conduct
Figure 925336DEST_PATH_IMAGE102
Value, promptly
Figure 423314DEST_PATH_IMAGE104
, then the elongation interpolation point is
Figure 929381DEST_PATH_IMAGE106
,
Figure 834014DEST_PATH_IMAGE108
Tension value after the elongation interval interpolation such as S41, the acquisition of the Lagrangian parabolic interpolation algorithm of employing
Figure 716520DEST_PATH_IMAGE110
With the elongation value :
Figure 683656DEST_PATH_IMAGE114
,
Wherein
Figure DEST_PATH_IMAGE244
And
Figure DEST_PATH_IMAGE246
,
Figure 308541DEST_PATH_IMAGE120
For
Figure 994737DEST_PATH_IMAGE122
In be positioned at the interval
Figure 139411DEST_PATH_IMAGE124
Interior elongation sampled point,
Figure 252860DEST_PATH_IMAGE126
For
Figure 178091DEST_PATH_IMAGE120
Pairing tension value,
Figure 87885DEST_PATH_IMAGE128
For
Figure 414961DEST_PATH_IMAGE122
In be positioned at this interval sampled data points number, wBe the interpolation exponent number;
Set of data points after the pre-service after the interpolation of elongation such as S42, acquisition interval
Figure 636995DEST_PATH_IMAGE130
Two equation of line are expressed as in S5, the desirable prestress two times tensioning of setting and the flex point curve
Figure 783943DEST_PATH_IMAGE030
, wherein
Figure 811941DEST_PATH_IMAGE032
,
Figure 180475DEST_PATH_IMAGE034
The slope of representing two equation of line respectively,
Figure 635727DEST_PATH_IMAGE036
,
Figure 473233DEST_PATH_IMAGE038
The intercept of representing two equation of line respectively,
Figure 39343DEST_PATH_IMAGE040
The coordinate at expression flex point place,
Figure 75432DEST_PATH_IMAGE042
The actual measurement tension value at expression flex point place,
Figure 390001DEST_PATH_IMAGE044
The actual measurement stretch value at expression flex point place, wherein subscript G is the integer greater than 1;
S6, Calculate feasible flex point scope: before the optimization searching of carrying out flex point, 5 parameters in the mathematical problem that needs to determine to sum up the front (
Figure 511541DEST_PATH_IMAGE032
,
Figure 881343DEST_PATH_IMAGE034
, ,
Figure 772255DEST_PATH_IMAGE038
,
Figure 568042DEST_PATH_IMAGE230
) feasible span.At first according to set of data points after the pre-service Ask for
Figure 486636DEST_PATH_IMAGE032
,
Figure 392275DEST_PATH_IMAGE034
,
Figure 488407DEST_PATH_IMAGE036
,
Figure 908935DEST_PATH_IMAGE038
With The central point of feasible span
Figure 178559DEST_PATH_IMAGE050
,
Figure 434091DEST_PATH_IMAGE052
, , With
Figure 431369DEST_PATH_IMAGE058
, wherein
Figure 236514DEST_PATH_IMAGE048
,
Figure 227604DEST_PATH_IMAGE058
Be used to represent the subscript position of described flex point, promptly
Figure DEST_PATH_IMAGE248
And
Figure 67384DEST_PATH_IMAGE048
,
Figure 236459DEST_PATH_IMAGE058
Be integer greater than 1.Particularly, carry out according to following steps:
S60, initiation parameter
Figure 794479DEST_PATH_IMAGE050
,
Figure 323681DEST_PATH_IMAGE052
,
Figure 283547DEST_PATH_IMAGE054
,
Figure 935108DEST_PATH_IMAGE056
With , and initialization slope differences e kBe zero, e wherein k=| k 1-k 2|;
S61, after the pre-service set of data points
Figure 297005DEST_PATH_IMAGE046
First data point Travel through set of data points after the whole pre-service
Figure 871523DEST_PATH_IMAGE046
, write down current data point
Figure 138556DEST_PATH_IMAGE134
S62, calculated candidate parameter central point
Figure 22942DEST_PATH_IMAGE136
,
Figure 691821DEST_PATH_IMAGE138
,
Figure 685185DEST_PATH_IMAGE140
,
Figure 377197DEST_PATH_IMAGE142
,
Figure 379788DEST_PATH_IMAGE144
, wherein
Figure 90124DEST_PATH_IMAGE146
Figure 254389DEST_PATH_IMAGE148
Figure 496015DEST_PATH_IMAGE150
Figure 974401DEST_PATH_IMAGE152
Figure 352292DEST_PATH_IMAGE154
S63, judge whether , if then:
Figure 104796DEST_PATH_IMAGE158
Figure 449189DEST_PATH_IMAGE160
Figure 390918DEST_PATH_IMAGE164
Figure 341556DEST_PATH_IMAGE166
Figure 411012DEST_PATH_IMAGE168
S64, judge whether to have traveled through set of data points after the described pre-service
Figure 763496DEST_PATH_IMAGE046
In all data points, if judge and to have traveled through all data points then continue execution, otherwise carry out described step S62~S64;
The central point of S65, the feasible span of acquisition
Figure 643727DEST_PATH_IMAGE050
, ,
Figure 767858DEST_PATH_IMAGE054
,
Figure 660335DEST_PATH_IMAGE056
With
Figure 773784DEST_PATH_IMAGE058
S7, Search for optimum flex point parameter: with the central point of described feasible span
Figure 636698DEST_PATH_IMAGE050
,
Figure 861006DEST_PATH_IMAGE052
,
Figure 188082DEST_PATH_IMAGE054
,
Figure 393804DEST_PATH_IMAGE056
With Be the center, expansion obtains feasible span, described feasible span is optimized searches for the parameter that is optimized
Figure 834330DEST_PATH_IMAGE032
,
Figure 953596DEST_PATH_IMAGE034
,
Figure 408848DEST_PATH_IMAGE036
,
Figure 731507DEST_PATH_IMAGE038
With
Figure 297617DEST_PATH_IMAGE048
Feasible span is as follows:
Figure 599286DEST_PATH_IMAGE170
Figure 163122DEST_PATH_IMAGE172
Figure 284662DEST_PATH_IMAGE174
Figure 841414DEST_PATH_IMAGE176
Wherein Be the region of search spreading coefficient, the big more possibility that then searches globally optimal solution of value just heals big, but institute's time-consuming is just long more, and speed of convergence is also slow more; Otherwise value is more little, and then to obtain the possibility of globally optimal solution just more little, but speed of convergence can be faster, consuming time shorter.
The present invention adopts the improvement genetic algorithm, optimization searching in above-mentioned feasible span.Certainly, to parameters optimization k 1, k 2, b 1, b 2, the optimization searching of idx can also adopt other mode to carry out.As shown in Figure 5, set gene (gene) and be respectively 5 parameter to be optimized: k 1, k 2, b 1, b 2, idx, 5 parameters constitute chromosome (chromosome) in the mode of real coding.As shown in Figure 6, a plurality of chromosomes constitute population, population is from the pursue parameter optimisation procedure that for evolutionary process then constituted genetic algorithm of parent to filial generation, as shown in Figure 7, and adopt fitness function to calculate each chromosomal fitness value in the genetic algorithm, thereby estimate each chromosomal adaptability (good and bad degree), so that the natural evolution rule of simulation " survival of the fittest ".The present invention selects for use fitness function to calculate each chromosomal fitness value:
Figure DEST_PATH_IMAGE252
Wherein
Figure DEST_PATH_IMAGE254
,
Figure DEST_PATH_IMAGE256
,
Figure DEST_PATH_IMAGE258
,
Figure DEST_PATH_IMAGE260
,
Figure DEST_PATH_IMAGE262
Be constant (actual value is 0.001). FitnessValue big more, adaptability that then should individuality is high more, corresponding parameters (gene) is just good more.
As shown in Figure 8, described feasible span being optimized search is made up of following steps:
S70, initialization population: adopt the field mouth orthogonal experimental method in the statistics, carry out the initialization operation of population, all be evenly distributed in the feasible span so that guarantee all chromosome, orthogonal arrage is designated as
Figure 355496DEST_PATH_IMAGE184
, orthogonal arrage can be regarded as
Figure DEST_PATH_IMAGE264
Matrix.The initialization algorithm of population is as follows:
Figure 151282DEST_PATH_IMAGE186
Wherein
Figure 59196DEST_PATH_IMAGE188
The value of j chromosomal i gene in the expression population, inf (g i) expression i gene the value lower bound, sup (g i) expression i gene the value upper bound, L 100The capable i row of a j element of [i] [j] expression orthogonal arrage, setting the population size is w, be that the parent chromosome number that initialization generates is w, wherein w is the integer greater than 1, be set at 100 such as the population size, be that the chromosome number that initialization generates is 100, each later on population chromosome number of future generation that generates through the back of evolving also is 100;
S71, calculating fitness value: adopt fitness function, each chromosomal fitness value is:
Figure 69877DEST_PATH_IMAGE190
Wherein
Figure 975516DEST_PATH_IMAGE192
, Be the value of the 1st gene in i chromosome in the population, i.e. k 1
Figure 471668DEST_PATH_IMAGE196
Be the value of the 2nd gene in i chromosome in the population, i.e. k 2
Figure 336855DEST_PATH_IMAGE198
Be the value of the 3rd gene in i chromosome in the population, i.e. b 1
Figure 475713DEST_PATH_IMAGE200
Be the value of the 4th gene in i chromosome in the population, i.e. b 2
Figure 996824DEST_PATH_IMAGE202
Be the value of the 5th gene in i chromosome in the population, i.e. idx;
Figure 512119DEST_PATH_IMAGE204
S72, intersection: the link of intersecting comprises two steps: based on the matching operation of hamming distance, the interlace operation of variable precision.
Matching operation based on the hamming distance: for avoiding inbreeding, before carrying out interlace operation, calculate the hamming distance between the chromosome earlier, just can match two chromosomes when only the distance of the hamming between chromosome is greater than set-point
Figure 418764DEST_PATH_IMAGE206
,
Figure 728522DEST_PATH_IMAGE208
Between the hamming distance definition as follows:
Figure 799247DEST_PATH_IMAGE210
Figure 790336DEST_PATH_IMAGE212
When the hamming between two individualities distance just can be matched more than or equal to 2 the time.
The interlace operation of variable precision: two chromosomes
Figure 630116DEST_PATH_IMAGE206
,
Figure 110776DEST_PATH_IMAGE208
Variable precision interlace operation algorithm as follows:
Produce the position, point of crossing at first at random: , wherein
Figure 945801DEST_PATH_IMAGE216
Expression produces random number;
Suppose that the new individuality after i=3 intersects is as follows:
Figure 577770DEST_PATH_IMAGE218
Wherein:
Figure 494911DEST_PATH_IMAGE220
,
Figure 274648DEST_PATH_IMAGE222
Be the random weighting number, inf (g 3) expression gene g 3The value lower bound, sup (g 3) expression gene g 3The value upper bound, if certain gene is repeatedly selected, the precision of this gene will increase gradually in search procedure, the setting crossing-over rate is v, wherein v is less than 1 greater than 0 given fractional value, then generates v * w new chromosome behind cross match, is 0.8 such as setting crossing-over rate, promptly to carry out 40 times cross match, generate 80 new chromosomes.
S73, variation: for avoiding the precocious convergence of algorithm, the mixovariation operation of having adopted 2 variations and multiple spot variation to combine in the algorithm.The execution of 2 mutation operations is selected in the mode of probability.Wherein, the multiple spot mutation operation comes from the Convex Set Theory in the management, a plurality of genes of individual chromosome are selected to carry out the convex combination variation randomly in the operation. and the multiple spot mutation operation has strengthened the meticulous regulating power of variation, what they were different with the single-point variation is the selected variation of carrying out convex combination of a plurality of genes of individual chromosome.If chromosome
Figure 856808DEST_PATH_IMAGE206
The the 2nd and the 4th gene is selected makes a variation, variation generates new chromosome
Figure DEST_PATH_IMAGE266
, wherein:
Figure DEST_PATH_IMAGE268
,
Figure 608863DEST_PATH_IMAGE222
, be random number.
S74, selection: adopt the mode of roulette to select, allow the lower individuality of fitness that selecteed chance is also arranged, to safeguard the gene diversity of population.With w parent chromosome and fitness is the highest in v * w the new chromosome that cross match generates chromosome directly as population of future generation, from remaining chromosome, choose w-1 again as population of future generation, scope in the present embodiment to be selected is 100 chromosome of parent and 80 chromosomes that interlace operation generates, and promptly selects 100 chromosomes as population of future generation from 180 chromosomes.Wherein the unconditional reservation of these 180 the individual quilts of the highest chromosomal fitness enters the next generation, promptly only need select 99 chromosomes.Algorithm is as follows:
The calculated population fitness:
Figure DEST_PATH_IMAGE270
The selected probability of each chromosome is:
Figure DEST_PATH_IMAGE272
Generate random number:
Figure DEST_PATH_IMAGE274
, if
Figure DEST_PATH_IMAGE276
Then iIndividual chromosome is selected, repeats this operation up to choosing 99 chromosomes.
S75, continue to carry out above-mentioned steps S72~S74, reach until two the straight-line equation tracks and the measured data goodness of fit and specify requirement or evolutionary generation to reach designated value, then withdraw from.
S8, Flex point validity is judged: according to described parameters optimization
Figure 57424DEST_PATH_IMAGE032
,
Figure 324458DEST_PATH_IMAGE034
,
Figure 710309DEST_PATH_IMAGE036
,
Figure 379187DEST_PATH_IMAGE038
With
Figure 372551DEST_PATH_IMAGE048
Judging the validity of flex point, if effectively then judge that described flex point is effective flex point, otherwise is invalid flex point.The judgement of flex point validity comprises:
The judgement of elasticity coefficient validity, if
Figure 64564DEST_PATH_IMAGE224
Judge that then elasticity coefficient is invalid, the flex point that searches is invalid flex point;
The judgement of flex point tension force validity, if
Figure 801575DEST_PATH_IMAGE226
With F 0Existence judges that then the flex point that searches is invalid flex point, wherein than big-difference
Figure 10446DEST_PATH_IMAGE228
Be actual measurement flex point tension force, F 0Be desirable flex point tension force.
An experimental result of the present invention as shown in Figure 9, thin curve is the engineering measurement data among the figure, bold curve is through the data and curves after the data pre-service (selection of valid data section, exceptional data point filter, equidistantly sample), thin straight line is the straight-line equation track after the optimization searching, the corner position that bullet obtains for search.Wherein technical parameter is as follows.
Parameter before the optimization searching:
Straight-line equation
Figure DEST_PATH_IMAGE278
, fitness value: 0.0626
Parameter after the optimization searching
Figure DEST_PATH_IMAGE280
, fitness value: 0.8620
Flex point tension force: 1160.89 KN, flex point elongation: 15.73 mm.
Another experimental result of the present invention as shown in figure 10, thin curve is the engineering measurement data among the figure, bold curve is through the data and curves after the data pre-service (selection of valid data section, exceptional data point filter, equidistantly sample), thin straight line is the straight-line equation track after the optimization searching, the corner position that bullet obtains for search.Wherein technical parameter is as follows.
Parameter before the optimization searching:
Straight-line equation
Figure DEST_PATH_IMAGE282
, fitness value: 0.2370
Parameter after the optimization searching
Figure DEST_PATH_IMAGE284
, fitness value: 0.9372
Flex point tension force: 985.02 KN, flex point elongation: 12.50 mm.
The present invention is not limited to aforesaid embodiment.The present invention expands to any new feature or any new combination that discloses in this manual, and the arbitrary new method that discloses or step or any new combination of process.

Claims (9)

1. prestress two times tensioning flex point discrimination method, it may further comprise the steps:
S1, collection obtain the set of measured data point
Figure 2011102464187100001DEST_PATH_IMAGE002
, wherein
Figure 2011102464187100001DEST_PATH_IMAGE004
Be the measured data point,
Figure 2011102464187100001DEST_PATH_IMAGE006
Be the actual measurement tension value,
Figure 2011102464187100001DEST_PATH_IMAGE008
Be the actual measurement elongation, wherein i, n are the integer greater than 1;
Dead track data, non-linear section data and descending branch data in the described measured data point set are promptly removed in significant figure strong point in S2, the described measured data point set of screening, obtain the set of valid data point
Figure 2011102464187100001DEST_PATH_IMAGE010
S3, the described valid data point set of filtration
Figure 957760DEST_PATH_IMAGE010
The middle exceptional data point that exists obtains filtered valid data point set
Figure 2011102464187100001DEST_PATH_IMAGE012
, wherein i, m are the integer greater than 1;
S4, equidistantly gather described filtered valid data point set again
Figure 2011102464187100001DEST_PATH_IMAGE014
, set of data points after the acquisition pre-service
Figure 2011102464187100001DEST_PATH_IMAGE016
, wherein i, m 'Be integer greater than 1;
Two equation of line are expressed as in S5, the desirable prestress two times tensioning of setting and the flex point curve
Figure 2011102464187100001DEST_PATH_IMAGE018
, wherein
Figure 2011102464187100001DEST_PATH_IMAGE020
,
Figure 2011102464187100001DEST_PATH_IMAGE022
The slope of representing two equation of line respectively,
Figure 2011102464187100001DEST_PATH_IMAGE024
,
Figure 2011102464187100001DEST_PATH_IMAGE026
The intercept of representing two equation of line respectively,
Figure 2011102464187100001DEST_PATH_IMAGE028
The coordinate at expression flex point place,
Figure 2011102464187100001DEST_PATH_IMAGE030
The actual measurement tension value at expression flex point place,
Figure 2011102464187100001DEST_PATH_IMAGE032
The actual measurement stretch value at expression flex point place, wherein subscript G is the integer greater than 1;
S6, according to set of data points after the pre-service
Figure 2011102464187100001DEST_PATH_IMAGE034
Ask for parameter ,
Figure 527074DEST_PATH_IMAGE022
,
Figure 859967DEST_PATH_IMAGE024
,
Figure 674339DEST_PATH_IMAGE026
With
Figure 2011102464187100001DEST_PATH_IMAGE036
The central point of feasible span
Figure 2011102464187100001DEST_PATH_IMAGE038
, ,
Figure 2011102464187100001DEST_PATH_IMAGE042
, With
Figure 2011102464187100001DEST_PATH_IMAGE046
, wherein
Figure 309851DEST_PATH_IMAGE036
,
Figure 514567DEST_PATH_IMAGE046
Be used to represent the subscript position of described flex point, and both are the integer greater than 1;
S7, with the central point of described feasible span
Figure 713467DEST_PATH_IMAGE038
,
Figure 382346DEST_PATH_IMAGE040
,
Figure 61195DEST_PATH_IMAGE042
,
Figure 815525DEST_PATH_IMAGE044
With
Figure 490220DEST_PATH_IMAGE046
Be the center, expansion obtains feasible span, described feasible span is optimized searches for the parameter that is optimized
Figure 13605DEST_PATH_IMAGE020
, ,
Figure 872026DEST_PATH_IMAGE024
, With
S8, according to described parameters optimization
Figure 63470DEST_PATH_IMAGE020
,
Figure 480807DEST_PATH_IMAGE022
, ,
Figure 995282DEST_PATH_IMAGE026
With
Figure 766929DEST_PATH_IMAGE036
Judging the validity of flex point, if effectively then judge that described flex point is effective flex point, otherwise is invalid flex point.
2. prestress two times tensioning flex point discrimination method according to claim 1 is characterized in that: screening significant figure strong point is made up of following steps among the described step S2:
The tension range of S20, the single presstressed reinforcing steel of setting is:
Figure 2011102464187100001DEST_PATH_IMAGE048
, wherein
Figure 2011102464187100001DEST_PATH_IMAGE050
Be the tension force lower bound,
Figure 2011102464187100001DEST_PATH_IMAGE052
Be the tension force upper bound, then described valid data point set
Figure 842201DEST_PATH_IMAGE010
The subscript of middle valid data starting point is expressed as , wherein
Figure 2011102464187100001DEST_PATH_IMAGE056
, m is a simultaneous tension presstressed reinforcing steel radical,
Figure 2011102464187100001DEST_PATH_IMAGE058
,
Figure 2011102464187100001DEST_PATH_IMAGE060
Be given constant, promptly minimum effective elasticity deformation quantity;
S21, the set of described valid data point
Figure 347875DEST_PATH_IMAGE010
The subscript of middle valid data end point is expressed as
Figure 2011102464187100001DEST_PATH_IMAGE062
, wherein:
Figure 2011102464187100001DEST_PATH_IMAGE064
Figure 2011102464187100001DEST_PATH_IMAGE066
S22, the described valid data point set of acquisition
Figure 2011102464187100001DEST_PATH_IMAGE068
, wherein D is the set of measured data point, wherein i, n are the integer greater than 1.
3. prestress two times tensioning flex point discrimination method according to claim 1 is characterized in that: filter exceptional data point among the described step S3 and adopt median average filter algorithm that described valid data point is gathered Tension data and elongation data carry out filtering, form by following steps:
S30, for the significant figure strong point , with the tension data at significant figure strong point in its R radius
Figure 455957DEST_PATH_IMAGE006
With the elongation data
Figure 893891DEST_PATH_IMAGE008
Sort respectively, remove tension data
Figure 314508DEST_PATH_IMAGE006
Maximal value and minimum value, ask for the mean value of residue tension data, promptly obtain the value of tension data in the described significant figure strong point
Figure 2011102464187100001DEST_PATH_IMAGE072
, formulate is:
Figure 2011102464187100001DEST_PATH_IMAGE074
S31, removal elongation data
Figure 911712DEST_PATH_IMAGE008
Maximal value and minimum value, ask for the mean value of residual elongation amount data, promptly obtain the value of elongation data in the described significant figure strong point
Figure 2011102464187100001DEST_PATH_IMAGE076
, formulate is:
Figure 2011102464187100001DEST_PATH_IMAGE078
, wherein
Figure 2011102464187100001DEST_PATH_IMAGE080
, and the value of R is 3;
S32, the valid data point that obtains are after filtering gathered
Figure 962844DEST_PATH_IMAGE014
, wherein
Figure 573561DEST_PATH_IMAGE012
4. prestress two times tensioning flex point discrimination method according to claim 1 is characterized in that: described step S4 intermediate reach is gathered again and is adopted Lagrangian parabolic interpolation algorithm, to valid data point set after filtering Wait elongation interpolation at interval, form by following steps:
S40, setting elongation are spaced apart , and the elongation upper bound and lower bound are respectively
Figure 2011102464187100001DEST_PATH_IMAGE084
,
Figure 2011102464187100001DEST_PATH_IMAGE086
, get
Figure 2011102464187100001DEST_PATH_IMAGE088
The integer conduct
Figure 2011102464187100001DEST_PATH_IMAGE090
Value, promptly
Figure 2011102464187100001DEST_PATH_IMAGE092
, then the elongation interpolation point is ,
Tension value after the elongation interval interpolation such as S41, the acquisition of the Lagrangian parabolic interpolation algorithm of employing
Figure 2011102464187100001DEST_PATH_IMAGE098
With the elongation value
Figure 2011102464187100001DEST_PATH_IMAGE100
:
Figure 2011102464187100001DEST_PATH_IMAGE102
,
Wherein And
Figure 2011102464187100001DEST_PATH_IMAGE106
,
Figure 2011102464187100001DEST_PATH_IMAGE108
For
Figure 2011102464187100001DEST_PATH_IMAGE110
In be positioned at the interval
Figure 2011102464187100001DEST_PATH_IMAGE112
Interior elongation sampled point,
Figure 2011102464187100001DEST_PATH_IMAGE114
For
Figure 672415DEST_PATH_IMAGE108
Pairing tension value,
Figure 2011102464187100001DEST_PATH_IMAGE116
For
Figure 642252DEST_PATH_IMAGE110
In be positioned at this interval sampled data points number, wBe the interpolation exponent number;
Set of data points after the pre-service after the interpolation of elongation such as S42, acquisition interval
Figure 2011102464187100001DEST_PATH_IMAGE118
5. prestress two times tensioning flex point discrimination method according to claim 1 is characterized in that: ask for feasible span central point among the described step S6 and form after by following steps:
S60, initiation parameter
Figure 992462DEST_PATH_IMAGE038
,
Figure 20460DEST_PATH_IMAGE040
,
Figure 388994DEST_PATH_IMAGE042
,
Figure 578667DEST_PATH_IMAGE044
With , and initialization slope differences e kBe zero, e wherein k=| k 1-k 2|;
S61, after the pre-service set of data points
Figure 982283DEST_PATH_IMAGE034
First data point
Figure 2011102464187100001DEST_PATH_IMAGE120
Travel through set of data points after the whole pre-service
Figure 972367DEST_PATH_IMAGE034
, write down current data point
Figure 2011102464187100001DEST_PATH_IMAGE122
S62, calculated candidate parameter central point
Figure 2011102464187100001DEST_PATH_IMAGE124
,
Figure 2011102464187100001DEST_PATH_IMAGE126
,
Figure 2011102464187100001DEST_PATH_IMAGE128
, ,
Figure 2011102464187100001DEST_PATH_IMAGE132
, wherein
Figure 2011102464187100001DEST_PATH_IMAGE134
Figure 2011102464187100001DEST_PATH_IMAGE138
Figure 2011102464187100001DEST_PATH_IMAGE142
S63, judge whether
Figure 2011102464187100001DEST_PATH_IMAGE144
, if then:
Figure 2011102464187100001DEST_PATH_IMAGE146
Figure 2011102464187100001DEST_PATH_IMAGE148
Figure 2011102464187100001DEST_PATH_IMAGE150
Figure 2011102464187100001DEST_PATH_IMAGE152
Figure 2011102464187100001DEST_PATH_IMAGE154
Figure 2011102464187100001DEST_PATH_IMAGE156
S64, judge whether to have traveled through set of data points after the described pre-service In all data points, if judge and to have traveled through all data points then continue execution, otherwise carry out described step S62~S64;
The central point of S65, the feasible span of acquisition
Figure 218595DEST_PATH_IMAGE038
,
Figure 588397DEST_PATH_IMAGE040
,
Figure 416676DEST_PATH_IMAGE042
,
Figure 213730DEST_PATH_IMAGE044
With
Figure 9517DEST_PATH_IMAGE046
6. prestress two times tensioning flex point discrimination method according to claim 1, it is characterized in that: feasible span is as follows among the described step S7:
Figure 2011102464187100001DEST_PATH_IMAGE158
Figure 2011102464187100001DEST_PATH_IMAGE162
Wherein
Figure 2011102464187100001DEST_PATH_IMAGE168
Be the region of search spreading coefficient,
Figure 2011102464187100001DEST_PATH_IMAGE170
The big more possibility that then searches globally optimal solution of value just heals big, but institute's time-consuming is just long more, and speed of convergence is also slow more; Otherwise value is more little, and then to obtain the possibility of globally optimal solution just more little, but speed of convergence can be faster, consuming time shorter;
And adopt genetic algorithm that described feasible span is optimized search: to set gene and be respectively 5 parameter to be optimized: k 1, k 2, b 1, b 2Idx, 5 parameters constitute chromosome in the mode of real coding, a plurality of chromosomes constitute population, population is from the pursue parameter optimisation procedure that for evolutionary process then constituted genetic algorithm of parent to filial generation, and adopt fitness function to calculate each chromosomal fitness value in the genetic algorithm, thereby estimate each chromosomal adaptability, so that the natural evolution rule of simulation " survival of the fittest ".
7. prestress two times tensioning flex point discrimination method according to claim 6 is characterized in that: described feasible span is optimized search is made up of following steps:
S70, initialization population: adopt the field mouth orthogonal experimental method in the statistics, carry out the initialization operation of population, all be evenly distributed in the feasible span so that guarantee all chromosome, orthogonal arrage is designated as
Figure 2011102464187100001DEST_PATH_IMAGE172
, the initialization algorithm of population is as follows:
Wherein
Figure 2011102464187100001DEST_PATH_IMAGE176
The value of j chromosomal i gene in the expression population, inf (g i) expression i gene the value lower bound, sup (g i) expression i gene the value upper bound, L 100The capable i row of a j element of [i] [j] expression orthogonal arrage, setting the population size is w, i.e. and the parent chromosome number that initialization generates is w, and wherein w is the integer greater than zero;
S71, calculating fitness value: adopt fitness function, each chromosomal fitness value is:
Figure 2011102464187100001DEST_PATH_IMAGE178
Wherein
Figure 2011102464187100001DEST_PATH_IMAGE180
,
Figure 2011102464187100001DEST_PATH_IMAGE182
Be the value of the 1st gene in i chromosome in the population, i.e. k 1
Figure 2011102464187100001DEST_PATH_IMAGE184
Be the value of the 2nd gene in i chromosome in the population, i.e. k 2
Figure 2011102464187100001DEST_PATH_IMAGE186
Be the value of the 3rd gene in i chromosome in the population, i.e. b 1
Figure 2011102464187100001DEST_PATH_IMAGE188
Be the value of the 4th gene in i chromosome in the population, i.e. b 2
Figure 2011102464187100001DEST_PATH_IMAGE190
Be the value of the 5th gene in i chromosome in the population, i.e. idx;
S72, intersection:
Matching operation based on the hamming distance: for avoiding inbreeding, before carrying out interlace operation, calculate the hamming distance between the chromosome earlier, only the distance of the hamming between chromosome just can be matched two chromosomes greater than 2 o'clock
Figure 2011102464187100001DEST_PATH_IMAGE194
, Between the hamming distance definition as follows:
Figure 2011102464187100001DEST_PATH_IMAGE198
Figure 2011102464187100001DEST_PATH_IMAGE200
The interlace operation of variable precision: two chromosomes
Figure 642665DEST_PATH_IMAGE194
,
Figure 653346DEST_PATH_IMAGE196
Variable precision interlace operation algorithm as follows:
Produce the position, point of crossing at first at random:
Figure 2011102464187100001DEST_PATH_IMAGE202
, wherein
Figure 2011102464187100001DEST_PATH_IMAGE204
Expression produces random number;
Suppose that the new individuality after i=3 intersects is as follows:
Figure 2011102464187100001DEST_PATH_IMAGE206
Wherein:
Figure 2011102464187100001DEST_PATH_IMAGE208
,
Figure 2011102464187100001DEST_PATH_IMAGE210
Be the random weighting number, inf (g 3) expression gene g 3The value lower bound, sup (g 3) expression gene g 3The value upper bound, if certain gene is repeatedly selected, the precision of this gene will increase gradually in search procedure, the setting crossing-over rate is v, then generates the new chromosome of v * w behind cross match, wherein v gets less than 1 greater than 0 fractional value;
S73, variation: the mixovariation operation of adopting the variation of 2 variations and multiple spot to combine, 2 mutation operations;
S74, selection: adopt the mode of roulette to select, to safeguard the gene diversity of population, w parent chromosome and fitness is the highest in v * w the new chromosome that cross match generates chromosome directly as population of future generation, are chosen w-1 again as population of future generation from remaining chromosome;
S75, continue to carry out above-mentioned steps S72~S74, reach to specify until two the straight-line equation tracks and the measured data goodness of fit and require or evolutionary generation reaches designated value, then withdraw from the described parameters optimization k of acquisition 1, k 2, b 1, b 2, idx.
8. prestress two times tensioning flex point discrimination method according to claim 1, it is characterized in that: the judgement of flex point validity comprises among the described step S8:
The judgement of elasticity coefficient validity, if
Figure 2011102464187100001DEST_PATH_IMAGE212
Judge that then elasticity coefficient is invalid, the flex point that searches is invalid flex point;
The judgement of flex point tension force validity, if
Figure 2011102464187100001DEST_PATH_IMAGE214
With F 0Existence judges that then the flex point that searches is invalid flex point, wherein than big-difference
Figure 2011102464187100001DEST_PATH_IMAGE216
Be actual measurement flex point tension force, F 0Be desirable flex point tension force.
9. prestress two times tensioning flex point discrimination method according to claim 7, it is characterized in that: described w value is 100, described v value is 0.8.
CN 201110246418 2011-08-25 2011-08-25 Method for identifying pre-stressed secondary tensioning inflection point Expired - Fee Related CN102289597B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 201110246418 CN102289597B (en) 2011-08-25 2011-08-25 Method for identifying pre-stressed secondary tensioning inflection point

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 201110246418 CN102289597B (en) 2011-08-25 2011-08-25 Method for identifying pre-stressed secondary tensioning inflection point

Publications (2)

Publication Number Publication Date
CN102289597A true CN102289597A (en) 2011-12-21
CN102289597B CN102289597B (en) 2013-06-05

Family

ID=45336018

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 201110246418 Expired - Fee Related CN102289597B (en) 2011-08-25 2011-08-25 Method for identifying pre-stressed secondary tensioning inflection point

Country Status (1)

Country Link
CN (1) CN102289597B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109670144A (en) * 2018-11-16 2019-04-23 北京交通大学 A kind of missing values processing method based on Lagrange's interpolation
CN114319348A (en) * 2022-03-14 2022-04-12 四川交达预应力工程检测科技有限公司 Rock mass deformation detection method, self-adaptive prestress tensioning method and tensioning system
CN114486495A (en) * 2022-01-26 2022-05-13 中铁七局集团有限公司 Pipeline internal pressure and deformation experimental device and detection method
CN115157437A (en) * 2022-06-28 2022-10-11 中电建路桥集团有限公司 Standardization and datamation method for quality control of prefabricated box girder

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102095594A (en) * 2010-12-17 2011-06-15 西南交通大学 Test water pressure applying device for shield tunnel structural model

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102095594A (en) * 2010-12-17 2011-06-15 西南交通大学 Test water pressure applying device for shield tunnel structural model

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
吴小陆;许斌: "浅析二次张拉钢绞线竖向预应力锚固系统", 《中国新技术新产品》 *

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109670144A (en) * 2018-11-16 2019-04-23 北京交通大学 A kind of missing values processing method based on Lagrange's interpolation
CN114486495A (en) * 2022-01-26 2022-05-13 中铁七局集团有限公司 Pipeline internal pressure and deformation experimental device and detection method
CN114486495B (en) * 2022-01-26 2024-04-12 中铁七局集团有限公司 Method for detecting internal pressure and deformation of pipeline
CN114319348A (en) * 2022-03-14 2022-04-12 四川交达预应力工程检测科技有限公司 Rock mass deformation detection method, self-adaptive prestress tensioning method and tensioning system
CN114319348B (en) * 2022-03-14 2022-05-27 四川交达预应力工程检测科技有限公司 Self-adaptive prestress tensioning method and tensioning system
CN115157437A (en) * 2022-06-28 2022-10-11 中电建路桥集团有限公司 Standardization and datamation method for quality control of prefabricated box girder
CN115157437B (en) * 2022-06-28 2024-01-16 中电建路桥集团有限公司 Standardization and datamation method for quality control of prefabricated box girder

Also Published As

Publication number Publication date
CN102289597B (en) 2013-06-05

Similar Documents

Publication Publication Date Title
CN103969176A (en) Method for testing seawater corrosion of low-alloy steel under stress state
CN102289597B (en) Method for identifying pre-stressed secondary tensioning inflection point
CN104457956B (en) Fundamental frequency identification method in a kind of Cable power detection
CN108846197A (en) A kind of crane's major girder non-destructive tests and degree of injury quantitative analysis method
KR101493231B1 (en) Integration system for interworking seismic instrumentation and electrical resistivity monit0ring and hydraulic structure monitoring method using the same
CN108505458B (en) Method for monitoring whole suspension bridge dismantling process
Gillich et al. How to correlate vibration measurements with FEM results to locate damages in beams
CN104407045A (en) Device and method for catching broken wire of bridge dragline based on metal magnetic memory technique
CN106198870B (en) A kind of anchor rod body damage location identification method based on neural network
Schoefs et al. The αδ method for modeling expert Judgment and combination of NDT tools in RBI context: application to Marine Structures
Li et al. Real-time warning and risk assessment of tailings dam disaster status based on dynamic hierarchy-grey relation analysis
CN109490072A (en) A kind of civil engineering work detection system and its detection method
CN107358363A (en) Coal work incidence of disease Forecasting Methodology based on radial basis function neural network built-up pattern
CN110889440A (en) Rockburst grade prediction method and system based on principal component analysis and BP neural network
CN105976025A (en) BP neural network gas prediction method based on genetic algorithm optimization
CN107064228A (en) A kind of monitoring steel bar corrosion method
CN102323075B (en) Progressive method for identifying damaged cable, slack cable and support generalized displacement on basis of angle monitoring
Thompson Evaluation of high-level lighting poles subjected to fatigue loading
CN101793629B (en) Method for monitoring health of progressive cable structure based on strain monitor
CN114663840B (en) Tunnel environment inspection equipment monitoring method and system
CN110501127A (en) A kind of uniform beam damnification recognition method based on faulted condition inclination angle slope
CN106844861B (en) Orthotropic Steel Bridge Deck welding node measured stress width dynamic probability modeling method
CN114323246A (en) Pipeline safety monitoring method and device
CN113567247A (en) Bridge detection information management system
CN107478170B (en) A kind of colored implementation method with smart coat integrated sensor of fibre strain

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20130605

Termination date: 20140825

EXPY Termination of patent right or utility model