# Structural Damage Identification of Pipe Based on GA and SCE-UA Algorithm

Authors: Yaojin Bao; He Xia; Zhenming Bao; Shuiping Ke; Yahui Li
Journal: Mathematical Problems in Engineering
 (2013)

---

## Abstract

Structure of offshore platform is very huge, which is easy to be with crack caused by a variety of environmental factors including winds, waves, and ice and threatened by some unexpected factors such as earthquake, typhoon, tsunami, and ship collision. Thus, as a main part of the jacket offshore platform, pipe is often with crack. However, it is difficult to detect the crack due to its unknown location. Genetic algorithm (GA) and SCE-UA algorithm are used to detect crack in this paper, respectively. In the experiment, five damages of the pipe in the platform model can be intelligently identified by genetic algorithm (GA) and SCE-UA. The network inputs are the differences between the strain mode shapes. The results of the two algorithms for structural damage diagnosis show that both of the two algorithms have high identification accuracy and good adaptability. Furthermore, the error of SCE-UA algorithm is smaller. The results also suggest that the structural damage of pipe can be identified by intelligent algorithm.


---

## Body

## 1. Introduction

Nondestructive testing of fault diagnosis can detect whether the construction has flaws under the condition that the construction is not assembled and destroyed, because of properties of material changing with the flaws. General nondestructive testing such as impact-echo method, infrared method, and ultrasonic method is all local damage detection technology that need check damaged points of the constructions first. Although these technologies do not need many instruments and their consequences are accurate, they spend long time and high cost to detect structural damage. In addition, they are hard to detect and evaluate some invisible components about some large-scale complicated structures completely and accurately. Heuristic algorithm is often a first choice to solve complicated problem [1–4]. Thus, this paper attempts to identify the structural damage for pipe with intelligent algorithm.One of the most important problems of damage identification is to determine damage signature. The damage index of strain is more sensitive than the displacement damage index; therefore, the application fields of strain modal are more widely. Hillary and Ewins [5] proposed the concept of strain modal and applied the strain transfer function to the identification of exciting force. Staker [6] utilized the strain transfer function to estimate the fatigue lifetime. Bernasconi and Ewins [7] and Yam et al. [8] deduced and discussed the theory of strain modal by using displacement modal differential operation method. Tsang [9] used element format to verify the correlation theory of strain modal that was verified by numerical simulation and experiment. Hong et al. [10] used the property of Wavelet Transform which could forecast the Lipshitz index and combined the Wavelet Transform with Lipshitz index to estimate damage. Ren et al. [11] applied Wavelet Transform and Lipshitz index to locate the damage and identify the degree of the damage under the moving load. Kirkegaard and Rytter [12] took advantage of the frequency change before and after damage, applying BP neural networks to locate and identify the damage of steel beam. Mitsuru et al. [13] took relative displacement and relative speed between structure layers as input of the whole network and took the recovery ability between layers as output, using the steel structure data of seven layers before and after repair to verify the effectiveness of the proposed method. Ruotolo and Surace [14] put BP neural networks into use to diagnose the damage of slab construction. Masri et al. [15] proved that BP neural network is a powerful tool to dissolve the typical structural dynamic system identification problem. Chiang and Lai [16] did relative researches about construe damage identification using GA: first, approximate location of a structural damage is estimated by using modal residual force; then, the possibility of non unique recognition results will be reduced by using GA; at last, possible damage location will be determined by using optimization method. Chou and Ghaboussi [17] regarded a damage problem as an optimization problem and adopted GA to solve it. Cross-sectional area and change of structure modulus of elasticity could be estimated by measuring the freedom to the static displacement. Different from other algorithms, GA confirms the optimum value of objective function by searching a lot of points. It is found that GA can identify the structural damage even with little information. Yi and Liu [18] employed the weighted combination of vibration mode errors and frequency errors to do some numerical simulation about damage of fixed beam, five-span continuous beams, and three spans ten layer framework. They considered that global search ability of GA is useful to identify the structural damage. Zhu and Xiao [19] defined the relative error summation of stress test and stress analysis of all point in the structure as objective function and imposed inequality constraint condition and penalty function. They identified the damage of the Zhaobaoshan bridge.The effectiveness of construal damage identification based on GA dependeds on the stability of the objective function and algorithm. Considering that GA can perform optimization search based on multiparameter, the objective function based on multiple information can enhance the accuracy of damage identification on some degree. This paper adopted the intelligent algorithm based on strain modal to identify the damage of the nonpenetrative platform pipe crack. Selecting five damages of the platform as an example, this paper used GA and SCE-UA algorithm with better parallel effect to obtain the signal damage degree output of the platform model. At the same time, two methods were evaluated by using the same data.


## 2. Improved GA for Pipe Structure Damage Identification

### 2.1. Coarse-Grained Strategies

GA has disadvantages such as precocity and low search efficiency in a practical application. Therefore, the eventual result is local optimal solution, not global optimal solution. For this reason, this paper drew upon predecessors and introduced genetic algorithm to prevent the breeding between relatives. Coarse-grain genetic algorithm is also known as MIMD or distributed genetic algorithm. Individuals are exchanged between the islands, which is called the migration. The division of population and the migration strategy are the pivotal issues of the coarse-grain genetic algorithm.If the terminal conditions are the same, serial genetic algorithm and coarse-grain genetic algorithm have different iteration time and number of times. That is because that the genetic operators of serial genetic algorithm are operated in the local environment. At present, coarse-grain genetic algorithm has some difficulties, the most important one of which is how to determine the right migration policies.


### 2.2. Parallel Strategy

Step  1 (Migration Operation). To improve the path diversity, new paths need to be exploited so that better solutions could be obtained. Thus, migration operation is introduced, which means that some excellent individuals are migrated to other subgroups in search of more optimal paths [20]. When external individuals immigrated into a stable new local environment, some individual of the original subgroup will be stimulated by the environment and make the leap of progress, which is very similar to nature.Step  2 (Convergence Judgment). If the operation reaches the maximum number of iterations or satisfies the convergence condition, then exit sub. Otherwise go to Step  2. The specific flow chart is as in Figure 1.Figure 1
Flow chart of coarse-grained parallel genetic algorithm.


### 2.3. GA Parameters Determination for Damage Identification

(1) Design Variable. The damage degree of cell αi (i is on behalf of cell number) is treated as design variable. If αi=0, this cell has no damage. The number of design variable should be equal to the number of possible damage cells.(2) Fitness Function. Due to the fact that it is a minimization problem, GA does the selective operation according to individual fitness value. The bigger the fitness value is, the greater the probability chosen into the next generation was. Therefore, a fitness function should be used to transform the individual objective function values. After transforming, the fitness value will be larger if the objective function value is smaller. The fitness function is as follows:
(1)fitness=11+∑i=1N∑j=1M|uijm-uija|.(3) Genetic Manipulation. This example uses real coding to describe the individuals, and the value of genes of chromosome is viewed as the damage degree of corresponding cell. Assume that there is a line with a certain length; each parent corresponds to the part of the line according to the fitness value with the ratio. The algorithm moves along the line in the same size of the step. Every step of the algorithm determines the location of the parent based on landing position, and the value of the first step is uniform random value of a less step. Then, mutation and crossover operation should be fulfilled by creating a new binary vector. If one digit of the vector is 1, the gene comes from the first generation, and if it is 0, the gene is generated by the second generation and these genes should be merged to form a new individual.(4) Parallel Strategies. First, the individual similarity of the current population ought to be calculated. It is shown that all the differences are small and value of the population is closed to the global optimal target value if the individual similarity of the current population is less than the minimum. For increasing the diversity of population, the current population should accept an individual of other population with maximum similarity to the current one. On the other hand, when the individual similarity is bigger than the maximum, the differences between individuals are great, meaning that the individual is far from the global optimal value. So the individual can accept an optimal individual from other population to hasten convergence. This migration strategy could save the optimal individual of population directly to the next generation.


## 2.1. Coarse-Grained Strategies

GA has disadvantages such as precocity and low search efficiency in a practical application. Therefore, the eventual result is local optimal solution, not global optimal solution. For this reason, this paper drew upon predecessors and introduced genetic algorithm to prevent the breeding between relatives. Coarse-grain genetic algorithm is also known as MIMD or distributed genetic algorithm. Individuals are exchanged between the islands, which is called the migration. The division of population and the migration strategy are the pivotal issues of the coarse-grain genetic algorithm.If the terminal conditions are the same, serial genetic algorithm and coarse-grain genetic algorithm have different iteration time and number of times. That is because that the genetic operators of serial genetic algorithm are operated in the local environment. At present, coarse-grain genetic algorithm has some difficulties, the most important one of which is how to determine the right migration policies.


## 2.2. Parallel Strategy

Step  1 (Migration Operation). To improve the path diversity, new paths need to be exploited so that better solutions could be obtained. Thus, migration operation is introduced, which means that some excellent individuals are migrated to other subgroups in search of more optimal paths [20]. When external individuals immigrated into a stable new local environment, some individual of the original subgroup will be stimulated by the environment and make the leap of progress, which is very similar to nature.Step  2 (Convergence Judgment). If the operation reaches the maximum number of iterations or satisfies the convergence condition, then exit sub. Otherwise go to Step  2. The specific flow chart is as in Figure 1.Figure 1
Flow chart of coarse-grained parallel genetic algorithm.


## 2.3. GA Parameters Determination for Damage Identification

(1) Design Variable. The damage degree of cell αi (i is on behalf of cell number) is treated as design variable. If αi=0, this cell has no damage. The number of design variable should be equal to the number of possible damage cells.(2) Fitness Function. Due to the fact that it is a minimization problem, GA does the selective operation according to individual fitness value. The bigger the fitness value is, the greater the probability chosen into the next generation was. Therefore, a fitness function should be used to transform the individual objective function values. After transforming, the fitness value will be larger if the objective function value is smaller. The fitness function is as follows:
(1)fitness=11+∑i=1N∑j=1M|uijm-uija|.(3) Genetic Manipulation. This example uses real coding to describe the individuals, and the value of genes of chromosome is viewed as the damage degree of corresponding cell. Assume that there is a line with a certain length; each parent corresponds to the part of the line according to the fitness value with the ratio. The algorithm moves along the line in the same size of the step. Every step of the algorithm determines the location of the parent based on landing position, and the value of the first step is uniform random value of a less step. Then, mutation and crossover operation should be fulfilled by creating a new binary vector. If one digit of the vector is 1, the gene comes from the first generation, and if it is 0, the gene is generated by the second generation and these genes should be merged to form a new individual.(4) Parallel Strategies. First, the individual similarity of the current population ought to be calculated. It is shown that all the differences are small and value of the population is closed to the global optimal target value if the individual similarity of the current population is less than the minimum. For increasing the diversity of population, the current population should accept an individual of other population with maximum similarity to the current one. On the other hand, when the individual similarity is bigger than the maximum, the differences between individuals are great, meaning that the individual is far from the global optimal value. So the individual can accept an optimal individual from other population to hasten convergence. This migration strategy could save the optimal individual of population directly to the next generation.


## 3. SCE-UA Algorithm for Damage Identification of Pipe Structure

### 3.1. Principle and Description of SCE-UA Algorithm

SCE-UA algorithm is a global optimization algorithm, which integrates the advantages of random search algorithm simplex method, clustering analysis and biological evolution method, and so on. It can effectively deal with the objective function with rough reflecting surface, not sensitive area [21]. Moreover, the algorithm is not interfered from the local minimum point [22]. It combines the complex search technology based on the deterministic with the biological competition principle of evolution in nature, and its key point is CCE. In CCE algorithm, each compound vertex is potential parent and could be involved in the calculation of producing the next generation. In the process of building, the child compound is selected by random, which leads to the search in the feasible region more thorough.


### 3.2. Parallel Strategy

SCE-UA algorithm has high intrinsic parallelism. Its process conforms to the Master-Slave pattern, so it is paralleled easily without changing any structure. In Master-Slave pattern, Master process performs the operation including sample space, initialization, compound sorting, and other global mixing operations; Slave process does the evolutionary operation. The figure of SCE-UA algorithm based on the Master-Slave is as in Figure2.Figure 2
Parallel SCE-UA algorithm based on Master-Slave strategies.First, the Master program performs the initialization operation, inputs the data of the model, and generatess samples randomly in the sample space. Then, the samples are sorted according to the new objective function. Finally, the compound types divided are delivered to the Slave process. If the number of processor n>p, a processor is assigned to process a Slave; otherwise, a processor will be assigned to process more than a Slave. After that, a Slave process will be divided to some child compound types that generates next generation. When the evolutionary operation is completed, slave process will transfer the results to Master process for performing the mixing process. Then, the above processes are performed continuously, until the results are converged.


## 3.1. Principle and Description of SCE-UA Algorithm

SCE-UA algorithm is a global optimization algorithm, which integrates the advantages of random search algorithm simplex method, clustering analysis and biological evolution method, and so on. It can effectively deal with the objective function with rough reflecting surface, not sensitive area [21]. Moreover, the algorithm is not interfered from the local minimum point [22]. It combines the complex search technology based on the deterministic with the biological competition principle of evolution in nature, and its key point is CCE. In CCE algorithm, each compound vertex is potential parent and could be involved in the calculation of producing the next generation. In the process of building, the child compound is selected by random, which leads to the search in the feasible region more thorough.


## 3.2. Parallel Strategy

SCE-UA algorithm has high intrinsic parallelism. Its process conforms to the Master-Slave pattern, so it is paralleled easily without changing any structure. In Master-Slave pattern, Master process performs the operation including sample space, initialization, compound sorting, and other global mixing operations; Slave process does the evolutionary operation. The figure of SCE-UA algorithm based on the Master-Slave is as in Figure2.Figure 2
Parallel SCE-UA algorithm based on Master-Slave strategies.First, the Master program performs the initialization operation, inputs the data of the model, and generatess samples randomly in the sample space. Then, the samples are sorted according to the new objective function. Finally, the compound types divided are delivered to the Slave process. If the number of processor n>p, a processor is assigned to process a Slave; otherwise, a processor will be assigned to process more than a Slave. After that, a Slave process will be divided to some child compound types that generates next generation. When the evolutionary operation is completed, slave process will transfer the results to Master process for performing the mixing process. Then, the above processes are performed continuously, until the results are converged.


## 4. Applying GA and SCE-UA Algorithm for Damage Identification of Pipe Structure

### 4.1. Input Parameters of the Algorithms

GA and SCE-UA algorithm must constitute an objective function when they are applied to damage identification of pipe structure. At present, the structural modal parameters are widely adopted (vibration mode and frequency), but strain modal can achieve high accuracy [8], so this paper chooses strain modal as input parameter.Displacement modal calculated by finite element could be transferred to strain modal which is very accurate. The objective function of GA and SCE-UA algorithm is the difference value of strain modal between the intact and damage structure.


### 4.2. Damage Degree Identification and Evaluation of Pipe Structure

Generally, damage could reduce structural stiffness. Then, assuming that there areR variables, the descripiton of structural damage follows:
(2)αi∈(0,1),i=1~R,
where αi is the damage degree of cell i, so stiffness matrix of cell i is shown as (4)
(3)Keid=αiKei0,
where Kei0 stands for a stiffness matrix generated in an undamaged condition and Keid stands for a stiffness matrix generated in a damaged condition. Then, global stiffness matrix in damaged condition is as follows:
(4)Kd(α1,α2,…,αR)=∑i=1RKeid.
This paper calculated the strain modal in N different damage cases, collected M displacement data in each working condition, and obtained the corresponding strain modal. uija denotes the strain modal j under damage case i; uijm means corresponding strain modal in undamaged condition. By adjusting damage variable αi(i=1~R), uija will be approached to uijm:
(5)min∑i=1N∑j=1M|uijm-uija|,0<αi<1.
Thus, the problem is transferred to the mentioned objective function (5). As a result, GA and SCE-UA algorithm with powerful searching ability are applied for structural damage identification.


## 4.1. Input Parameters of the Algorithms

GA and SCE-UA algorithm must constitute an objective function when they are applied to damage identification of pipe structure. At present, the structural modal parameters are widely adopted (vibration mode and frequency), but strain modal can achieve high accuracy [8], so this paper chooses strain modal as input parameter.Displacement modal calculated by finite element could be transferred to strain modal which is very accurate. The objective function of GA and SCE-UA algorithm is the difference value of strain modal between the intact and damage structure.


## 4.2. Damage Degree Identification and Evaluation of Pipe Structure

Generally, damage could reduce structural stiffness. Then, assuming that there areR variables, the descripiton of structural damage follows:
(2)αi∈(0,1),i=1~R,
where αi is the damage degree of cell i, so stiffness matrix of cell i is shown as (4)
(3)Keid=αiKei0,
where Kei0 stands for a stiffness matrix generated in an undamaged condition and Keid stands for a stiffness matrix generated in a damaged condition. Then, global stiffness matrix in damaged condition is as follows:
(4)Kd(α1,α2,…,αR)=∑i=1RKeid.
This paper calculated the strain modal in N different damage cases, collected M displacement data in each working condition, and obtained the corresponding strain modal. uija denotes the strain modal j under damage case i; uijm means corresponding strain modal in undamaged condition. By adjusting damage variable αi(i=1~R), uija will be approached to uijm:
(5)min∑i=1N∑j=1M|uijm-uija|,0<αi<1.
Thus, the problem is transferred to the mentioned objective function (5). As a result, GA and SCE-UA algorithm with powerful searching ability are applied for structural damage identification.


## 5. Case Studies

There is a jacket offshore platform, which can be seen in Figure3. The platform is made of Q235 steel pipe. There are seven points selected for damage identification, which are noted as A, B, C, D, E, F, and G. Their locations can be seen in Figure 3. This paper considered five locations under 4 different damage cases. Damage cases are shown in Table 1.(1)
Location 1: damage is in Point A at Platform jacket leg.(2)
Location 2: damage is in Point B at horizontal pipe BC.(3)
Location 3: damage is in Point D at inclined pipe DG.(4)
Location 4: damage is in Point C at horizontal pipe AE.(5)
Location 5: damage is in Point G of the second layer jacket FG.Table 1
The list of damage cases.
The label of damage cases
Damage degree (%)
1
10
2
20
3
30
4
40Figure 3
The structure of jacket offshore platform.


### 5.1. Damage Identification of Horizontal Pipe Structure

GA and SCE-UA algorithm are used to identify the structural damage of spud leg FG, horizontal pipe AE, and inclined pipe BC. Strain modal data were input to GA and SCE-UA algorithm, the number of groups is 50, and the iterations are 1000. Specific damage degree of two methods is shown as in Tables2 and 3.Table 2
The damage degree table of Point A at platform jacket leg in genetic algorithm.
Cell number
1–304
305
306–21600
Case1
Design value of damage degree
0.000
0.100
0.000
Identification value of damage degree
0.000
0.098
0.000
Case2
Design value of damage degree
0.000
0.200
0.000
Identification value of damage degree
0.000
0.187
0.000
Case3
Design value of damage degree
0.000
0.300
0.000
Identification value of damage degree
0.000
0.291
0.000
Case4
Design value of damage degree
0.000
0.400
0.000
Identification value of damage degree
0.000
0.383
0.000Table 3
The damage degree table of Point A at platform jacket leg in SCE-UA algorithm.
Cell number
1–304
305
306–21600
Case1
Design value of damage degree
0.000
0.100
0.000
Identification value of damage degree
0.000
0.098
0.000
Case2
Design value of damage degree
0.000
0.200
0.000
Identification value of damage degree
0.000
0.189
0.000
Case3
Design value of damage degree
0.000
0.300
0.000
Identification value of damage degree
0.000
0.293
0.000
Case4
Design value of damage degree
0.000
0.400
0.000
Identification value of damage degree
0.000
0.391
0.000


### 5.2. Analysis of Results

It is indicated that both GA and SCE-UA algorithm have accurate identification results from Tables3, 4, 5, 6, 7, 8, 9, 10, and 11. Although some identification values are not the same as the design values, the errors are very small. By comparing the two algorithms in Table 12, it is found that the results of SCE-UA are more exact. SCE-UA algorithm obtained better identification accuracy than GA did, which proves that SCE-UA is a powerful approach for damage identification of signal crack.Table 4
The damage degree table of Point B at horizontal pipe BC in genetic algorithm.
Cell number
1–8754
8755
8756–21600
Case1
Design value of damage degree
0.000
0.100
0.000
Identification value of damage degree
0.000
0.089
0.000
Case2
Design value of damage degree
0.000
0.200
0.000
Identification value of damage degree
0.000
0.191
0.000
Case3
Design value of damage degree
0.000
0.300
0.000
Identification value of damage degree
0.000
0.271
0.000
Case4
Design value of damage degree
0.000
0.400
0.000
Identification value of damage degree
0.000
0.387
0.000Table 5
The damage degree table of Point B at horizontal pipe BC in SCE-UA algorithm.
Cell number
1–8754
8755
8756–21600
Case1
Design value of damage degree
0.000
0.100
0.000
Identification value of damage degree
0.000
0.091
0.000
Case2
Design value of damage degree
0.000
0.200
0.000
Identification value of damage degree
0.000
0.193
0.000
Case3
Design value of damage degree
0.000
0.300
0.000
Identification value of damage degree
0.000
0.284
0.000
Case4
Design value of damage degree
0.000
0.400
0.000
Identification value of damage degree
0.000
0.393
0.000Table 6
The degree damage table of Point D at inclined pipe DG in genetic algorithm.
Cell number
1–15
16
17–3300
Case1
Design value of damage degree
0.000
0.100
0.000
Identification value of damage degree
0.000
0.092
0.000
Case2
Design value of damage degree
0.000
0.200
0.000
Identification value of damage degree
0.000
0.189
0.000
Case3
Design value of damage degree
0.000
0.300
0.000
Identification value of damage degree
0.000
0.281
0.000
Case4
Design value of damage degree
0.000
0.400
0.000
Identification value of damage degree
0.000
0.387
0.000Table 7
The damage degree table of Point D at inclined pipe DG in SCE-UA algorithm.
Cell number
1–15
16
17–3300
Case1
Design value of damage degree
0.000
0.100
0.000
Identification value of damage degree
0.000
0.097
0.000
Case2
Design value of damage degree
0.000
0.200
0.000
Identification value of damage degree
0.000
0.192
0.000
Case3
Design value of damage degree
0.000
0.300
0.000
Identification value of damage degree
0.000
0.286
0.000
Case4
Design value of damage degree
0.000
0.400
0.000
Identification value of damage degree
0.000
0.392
0.000Table 8
The damage degree table of Point C at horizontal pipe AE in genetic algorithm.
Cell number
1–26695
26696
26697–56400
Case1
Design value of damage degree
0.000
0.100
0.000
Identification value of damage degree
0.000
0.086
0.000
Case2
Design value of damage degree
0.000
0.200
0.000
Identification value of damage degree
0.000
0.191
0.000
Case3
Design value of damage degree
0.000
0.300
0.000
Identification value of damage degree
0.000
0.286
0.000
Case4
Design value of damage degree
0.000
0.400
0.000
Identification value of damage degree
0.000
0.391
0.000Table 9
The damage degree table of Point C at horizontal pipe AE in SCE-UA algorithm.
Cell number
1–26695
26696
26697–56400
Case1
Design value of damage degree
0.000
0.100
0.000
Identification value of damage degree
0.000
0.093
0.000
Case2
Design value of damage degree
0.000
0.200
0.000
Identification value of damage degree
0.000
0.192
0.000
Case3
Design value of damage degree
0.000
0.300
0.000
Identification value of damage degree
0.000
0.286
0.000
Case4
Design value of damage degree
0.000
0.400
0.000
Identification value of damage degree
0.000
0.394
0.000Table 10
The damage degree table of Point G of the second layer jacket FG in genetic algorithm.
Cell number
1–22004
22005
22006–56400
Case1
Design value of damage degree
0.000
0.100
0.000
Identification value of damage degree
0.000
0.083
0.000
Case2
Design value of damage degree
0.000
0.200
0.000
Identification value of damage degree
0.000
0.197
0.000
Case3
Design value of damage degree
0.000
0.300
0.000
Identification value of damage degree
0.000
0.274
0.000
Case4
Design value of damage degree
0.000
0.400
0.000
Identification value of damage degree
0.000
0.388
0.000Table 11
The damage degree table of Point G of the second layer jacket FG in genetic algorithm.
Cell number
1–22004
22005
22006–56400
Case1
Design value of damage degree
0.000
0.100
0.000
Identification value of damage degree
0.000
0.082
0.000
Case2
Design value of damage degree
0.000
0.200
0.000
Identification value of damage degree
0.000
0.199
0.000
Case3
Design value of damage degree
0.000
0.300
0.000
Identification value of damage degree
0.000
0.281
0.000
Case4
Design value of damage degree
0.000
0.400
0.000
Identification value of damage degree
0.000
0.394
0.000Table 12
Damage determination analysis of the two methods.
Type
Damage degree (%)
Accuracy of GA
Accuracy of SCE-UA
Single crack
10
100%
100%
20
99.8%
99.9%
30
100%
100%
40
99.9%
100%


### 5.3. Comparison of Algorithms

The parameters of this paper are shown as in Table13, and we compared the evolution results of two algorithms as in Figure 4.Table 13
Parameters in GA and SCE-UA.
Algorithm
Population size
Evolutional generation
Computation time
GA
50
1000
293.7
SCE-UA
50
1000
231.2Figure 4
Fitness of each calculation.We can find that operation time of SCE-UA algorithm is less under the same population size and evolutional generation. Although two algorithms almost did not change afterwards, SCE-UA has better convergence and higher robustness [23]. The fitness of SCE-UA did not change after 800th. The fitness of GA increased rapidly before 500th generation, but it changed smoothly after 500th generation. GA had good convergence rate only in the initial stage of evolution, but when the distance is close to the optimal solution, GA was unable to search the optimal solution of this area quickly.


## 5.1. Damage Identification of Horizontal Pipe Structure

GA and SCE-UA algorithm are used to identify the structural damage of spud leg FG, horizontal pipe AE, and inclined pipe BC. Strain modal data were input to GA and SCE-UA algorithm, the number of groups is 50, and the iterations are 1000. Specific damage degree of two methods is shown as in Tables2 and 3.Table 2
The damage degree table of Point A at platform jacket leg in genetic algorithm.
Cell number
1–304
305
306–21600
Case1
Design value of damage degree
0.000
0.100
0.000
Identification value of damage degree
0.000
0.098
0.000
Case2
Design value of damage degree
0.000
0.200
0.000
Identification value of damage degree
0.000
0.187
0.000
Case3
Design value of damage degree
0.000
0.300
0.000
Identification value of damage degree
0.000
0.291
0.000
Case4
Design value of damage degree
0.000
0.400
0.000
Identification value of damage degree
0.000
0.383
0.000Table 3
The damage degree table of Point A at platform jacket leg in SCE-UA algorithm.
Cell number
1–304
305
306–21600
Case1
Design value of damage degree
0.000
0.100
0.000
Identification value of damage degree
0.000
0.098
0.000
Case2
Design value of damage degree
0.000
0.200
0.000
Identification value of damage degree
0.000
0.189
0.000
Case3
Design value of damage degree
0.000
0.300
0.000
Identification value of damage degree
0.000
0.293
0.000
Case4
Design value of damage degree
0.000
0.400
0.000
Identification value of damage degree
0.000
0.391
0.000


## 5.2. Analysis of Results

It is indicated that both GA and SCE-UA algorithm have accurate identification results from Tables3, 4, 5, 6, 7, 8, 9, 10, and 11. Although some identification values are not the same as the design values, the errors are very small. By comparing the two algorithms in Table 12, it is found that the results of SCE-UA are more exact. SCE-UA algorithm obtained better identification accuracy than GA did, which proves that SCE-UA is a powerful approach for damage identification of signal crack.Table 4
The damage degree table of Point B at horizontal pipe BC in genetic algorithm.
Cell number
1–8754
8755
8756–21600
Case1
Design value of damage degree
0.000
0.100
0.000
Identification value of damage degree
0.000
0.089
0.000
Case2
Design value of damage degree
0.000
0.200
0.000
Identification value of damage degree
0.000
0.191
0.000
Case3
Design value of damage degree
0.000
0.300
0.000
Identification value of damage degree
0.000
0.271
0.000
Case4
Design value of damage degree
0.000
0.400
0.000
Identification value of damage degree
0.000
0.387
0.000Table 5
The damage degree table of Point B at horizontal pipe BC in SCE-UA algorithm.
Cell number
1–8754
8755
8756–21600
Case1
Design value of damage degree
0.000
0.100
0.000
Identification value of damage degree
0.000
0.091
0.000
Case2
Design value of damage degree
0.000
0.200
0.000
Identification value of damage degree
0.000
0.193
0.000
Case3
Design value of damage degree
0.000
0.300
0.000
Identification value of damage degree
0.000
0.284
0.000
Case4
Design value of damage degree
0.000
0.400
0.000
Identification value of damage degree
0.000
0.393
0.000Table 6
The degree damage table of Point D at inclined pipe DG in genetic algorithm.
Cell number
1–15
16
17–3300
Case1
Design value of damage degree
0.000
0.100
0.000
Identification value of damage degree
0.000
0.092
0.000
Case2
Design value of damage degree
0.000
0.200
0.000
Identification value of damage degree
0.000
0.189
0.000
Case3
Design value of damage degree
0.000
0.300
0.000
Identification value of damage degree
0.000
0.281
0.000
Case4
Design value of damage degree
0.000
0.400
0.000
Identification value of damage degree
0.000
0.387
0.000Table 7
The damage degree table of Point D at inclined pipe DG in SCE-UA algorithm.
Cell number
1–15
16
17–3300
Case1
Design value of damage degree
0.000
0.100
0.000
Identification value of damage degree
0.000
0.097
0.000
Case2
Design value of damage degree
0.000
0.200
0.000
Identification value of damage degree
0.000
0.192
0.000
Case3
Design value of damage degree
0.000
0.300
0.000
Identification value of damage degree
0.000
0.286
0.000
Case4
Design value of damage degree
0.000
0.400
0.000
Identification value of damage degree
0.000
0.392
0.000Table 8
The damage degree table of Point C at horizontal pipe AE in genetic algorithm.
Cell number
1–26695
26696
26697–56400
Case1
Design value of damage degree
0.000
0.100
0.000
Identification value of damage degree
0.000
0.086
0.000
Case2
Design value of damage degree
0.000
0.200
0.000
Identification value of damage degree
0.000
0.191
0.000
Case3
Design value of damage degree
0.000
0.300
0.000
Identification value of damage degree
0.000
0.286
0.000
Case4
Design value of damage degree
0.000
0.400
0.000
Identification value of damage degree
0.000
0.391
0.000Table 9
The damage degree table of Point C at horizontal pipe AE in SCE-UA algorithm.
Cell number
1–26695
26696
26697–56400
Case1
Design value of damage degree
0.000
0.100
0.000
Identification value of damage degree
0.000
0.093
0.000
Case2
Design value of damage degree
0.000
0.200
0.000
Identification value of damage degree
0.000
0.192
0.000
Case3
Design value of damage degree
0.000
0.300
0.000
Identification value of damage degree
0.000
0.286
0.000
Case4
Design value of damage degree
0.000
0.400
0.000
Identification value of damage degree
0.000
0.394
0.000Table 10
The damage degree table of Point G of the second layer jacket FG in genetic algorithm.
Cell number
1–22004
22005
22006–56400
Case1
Design value of damage degree
0.000
0.100
0.000
Identification value of damage degree
0.000
0.083
0.000
Case2
Design value of damage degree
0.000
0.200
0.000
Identification value of damage degree
0.000
0.197
0.000
Case3
Design value of damage degree
0.000
0.300
0.000
Identification value of damage degree
0.000
0.274
0.000
Case4
Design value of damage degree
0.000
0.400
0.000
Identification value of damage degree
0.000
0.388
0.000Table 11
The damage degree table of Point G of the second layer jacket FG in genetic algorithm.
Cell number
1–22004
22005
22006–56400
Case1
Design value of damage degree
0.000
0.100
0.000
Identification value of damage degree
0.000
0.082
0.000
Case2
Design value of damage degree
0.000
0.200
0.000
Identification value of damage degree
0.000
0.199
0.000
Case3
Design value of damage degree
0.000
0.300
0.000
Identification value of damage degree
0.000
0.281
0.000
Case4
Design value of damage degree
0.000
0.400
0.000
Identification value of damage degree
0.000
0.394
0.000Table 12
Damage determination analysis of the two methods.
Type
Damage degree (%)
Accuracy of GA
Accuracy of SCE-UA
Single crack
10
100%
100%
20
99.8%
99.9%
30
100%
100%
40
99.9%
100%


## 5.3. Comparison of Algorithms

The parameters of this paper are shown as in Table13, and we compared the evolution results of two algorithms as in Figure 4.Table 13
Parameters in GA and SCE-UA.
Algorithm
Population size
Evolutional generation
Computation time
GA
50
1000
293.7
SCE-UA
50
1000
231.2Figure 4
Fitness of each calculation.We can find that operation time of SCE-UA algorithm is less under the same population size and evolutional generation. Although two algorithms almost did not change afterwards, SCE-UA has better convergence and higher robustness [23]. The fitness of SCE-UA did not change after 800th. The fitness of GA increased rapidly before 500th generation, but it changed smoothly after 500th generation. GA had good convergence rate only in the initial stage of evolution, but when the distance is close to the optimal solution, GA was unable to search the optimal solution of this area quickly.


## 6. Conclusions

Pipe structure of offshore platform is very huge, which was suffered by a variety of environmental factors. Thus, the jacket offshore platform was often caused with crack. It is an important task to identify the structural damage of pipe. However, it is difficult to detect the crack due to its unknown location. Thus, the damage identification problem is a large-scale complicated problem. Heuristic algorithm is often a first choice to solve this kind of complicated problem. This paper firstly overviewed the basic theory of GA and SCE-UA algorithm and expounded the flow of the two algorithms. The process of applying GA and SCE-UA to identify the structural damage degree of platform is introduced. We selected strain modal difference as the input parameter owing to its accuracy and took 5 damages of a platform as an example to identify structural damage. The results showed that GA and SCE-UA algorithm can achieve higher recognition accuracy and have good adaptabilities. The errors of SCE-UA algorithm are smaller, the computation time is less, and convergence is better. SCE-UA is a powerful tool for identifying structural damage of a platform pipe. In addition, the results also suggest that intelligent algorithm is a feasible method for structural damage identification.



---

*Source: 101483-2013-12-30.xml*