Shock and Vibration
Volume 2020 (2020), Article ID 1091548, 8 pages
https://doi.org/10.1155/2020/1091548

Research Article

An Improved Lagrange Particle Swarm Optimization Algorithm and Its Application in Multiple Fault Diagnosis

Xiaofeng Lv,1,2 Deyun Zhou,¹ Ling Ma,² Yuyuan Zhang,² and Yongchuan Tang1,3

¹School of Electronics and Information, Northwestern Polytechnical University, Xi’an, Shaanxi 710072, China
²Naval Aviation University, Yantai, Shandong 264001, China
³School of Big Data and Software Engineering, Chongqing University, Chongqing 401331, China

Correspondence should be addressed to Xiaofeng Lv; lxf00112@mail.nwpu.edu.cn and Yongchuan Tang; tangyongchuan@mail.nwpu.edu.cn

Received 31 December 2019; Revised 22 May 2020; Accepted 6 June 2020; Published 27 June 2020

Academic Editor: Jiawei Xiang

Copyright © 2020 Xiaofeng Lv et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract.

The fault rate in equipment increases significantly along with the service life of the equipment, especially for multiple fault. Typically, the Bayesian theory is used to construct the model of faults, and intelligent algorithm is used to solve the model. Lagrangian relaxation algorithm can be adopted to solve multiple fault diagnosis models. But the mathematical derivation process may be complex, while the updating method for Lagrangian multiplier is limited and it may fall into a local optimal solution. The particle swarm optimization (PSO) algorithm is a global search algorithm. In this paper, an improved Lagrange-particle swarm optimization algorithm is proposed. The updating of the Lagrangian multipliers is with the PSO algorithm for global searching. The difference between the upper and lower bounds is proposed to construct the fitness function of PSO. The multiple fault diagnosis model can be solved by the improved Lagrange-particle swarm optimization algorithm. Experiment on a case study of sensor data-based multiple fault diagnosis verifies the effectiveness and robustness of the proposed method.

1. Introduction

The problem of fault detection and diagnosis in complex equipment is a hot topic for theory and practical research [1–5]. On one hand, if the complex electromechanical system of existing weapons or equipment fails, it is difficult to address the problems solely with traditional diagnostic methods or the experience of maintenance personnel, because the system is composed of very complicated mechanical and electronic systems [6–8]. On the other hand, studies show that the available maintenance cost of complex equipment is a key issue and may be extremely high [9, 10]. Meanwhile, because of lack of effective detection and maintenance procedure, the maintenance cost of equipment is often 3–10 times bigger than the research cost. Therefore, it is of great importance to make effective fault diagnosis for weapon equipment, especially for complex electromechanical equipment. Existing studies [11–14] play a great effort in lowering the cost of maintenance and test, simplifying the test equipment, and improving the testability of equipment.

Model-based fault diagnosis and data-driven fault diagnosis are commonly used fault diagnosis methods [15, 16], among which the dependency model of Data Sciences International (DSI) company is a typical approach [6, 17, 18]. The optimization algorithm can be used to solve the objective function under the correlation model of complex system. The correlation model is transformed into a multiple fault diagnosis model in [19]. Subsequently, the multiple fault diagnosis model is solved based on the Lagrange relaxation algorithm [20, 21]. Apart from being applied in multiple fault diagnosis, the Lagrange relaxation algorithm is also applied for other applications as partitioning problem [22], scheduling problem [23], the adjacent only quadratic minimum spanning tree problem [24], the supply chain network problem [25], and so on [26–28].

Lagrangian relaxation algorithm can be adopted to solve multiple fault diagnosis models. Traditionally, the method of updating Lagrange multiplier is based on the subgradient method. But the mathematical derivation process in the algorithm is complex. In addition, the updating method for Lagrangian multiplier is limited, and the traditional Lagrangian relaxation algorithm may fall into a local optimal solution. In [29], the Lagrange relaxation algorithm is improved and applied to multiple fault diagnosis problem, which brings about a better result. In this paper, the particle swarm optimization (PSO) algorithm will be adopted to update the Lagrange multiplier. The PSO algorithm is a global search algorithm [30, 31]. As a result, the PSO algorithm has a good adaptability and simplicity in practical applications [32–35]. We adopt the PSO algorithm to update the Lagrange multiplier in this paper.

In this paper, we propose an improved method for multiple fault diagnosis based on the Lagrangian relaxation algorithm and PSO algorithm. The updating of Lagrange multiplier will be designed as the optimization iteration process of particle swarm. A new method for updating of speed and location is proposed based on the nonnegative characteristic of Lagrange multiplier. The fitness function in the improved optimization algorithm is designed based on the absolute value of the difference between the upper and lower bounds. An experiment based on the system state diagnosis before a launch of Apollo spacecraft is adopted for verification of the proposed method.

The rest of this paper is organized as follows. The multiple fault diagnosis model is introduced in Section 2. In Section 3, the Lagrangian model is briefly introduced. Then, the improved Lagrange-particle swarm optimization algorithm is proposed in Section 4. Section 5 presents the simulation and verification experiment of the proposed method. Section 6 draws the conclusion of this paper.

2. Multiple Fault Diagnosis Model

The multiple fault diagnosis problem consists of the following elements. The fault source vector of the system can be denoted as , where represents the th fault state of the system. The set of test points in the system is denoted as , where represents the th test point. The fault source-test point dependency matrix is , where the element represents the dependency between the fault state and the test point . In addition, if the fault state and the test point are dependent on each other, then  = 1; otherwise,  = 0. The prior probability vector of the fault is , where represents the prior probability of the th fault state.

Basing on the aforementioned factors, the process of multiple fault diagnosis can be described as follows. Basing on the test results, a set of possible fault sources can be calculated to maximize the posterior probability. The posterior probability can be converted to a prior probability with Bayesian formula [19]:

where is the test set that has passed the test. is the test set that has not passed the test. The vector of dimension is defined to represent the fault state of the component. When the fault state occurs,  = 1; otherwise,  = 0. is a constant that is independent of . Thus, we can get the following function:

where

where is the prior probability of the failure in component , calculating the probability of the occurrence regarding the fault source set . If the fault state happens, , , then, do multiplication of the prior probability regarding the fault state . Otherwise, the fault state does not happen; do multiplication of , which is the prior probability of the fault state that does not happen. The values of and are relative to the information in the matrix [19]:

where and denote the test points and respectively.

Obtaining the maximum value of , since they can be only 0 or 1, thus, both and must be 1. The following four cases exist:

(i)If the test point passes the test, for the faulty component  = 1, the test must be independent with the component ( = 0)(ii)If the test point passes the test, for the component without failure  = 0, the test must be independent with the component ( = 0 or  = 1)(iii)If the test point fails to pass the test, for the component without failure  = 0, the test must be independent with the component ( = 0 or  = 1)(iv)If the test point fails to pass the test, there is at least one faulty component  = 1 which makes the test dependent on the fault component ( = 1)

According to the aforementioned analysis, a lemma can be summarized as follows [19].

Lemma 1. The maximum value of can be calculated on the condition that the following conditions are satisfied:

(1)If and  = 1, then  = 0(2)If , there is at least one faulty component ( = 1) which makes the test dependent on the fault component xi, subsequently,  = 1

To fulfil the aforementioned condition 1, delete the fault set that has been confirmed not to happen from the fault set and get the fault set . In other words, the value of the confirmed fault that will not happen is 0, and the value of others is still unknown. Subsequently, condition 1) can be converted into the following constraints: for , , where can be calculated as the transposed matrix of in which the test column without failure has been deleted. The size of is . is a unit vector of column.

Taking the negative natural logarithm of formula(3) and ignoring its constant, the problem can be converted as follows [19]:

where .

3. Lagrangian Relaxation Model

The Lagrangian relaxation algorithm can be adopted to solve the aforementioned multiple fault diagnosis problem. The original multiple fault diagnosis model is shown as follows [19]:

where is the set of fault sources in which the fault from the set that has been confirmed to never occur is removed. is the matrix that is transposed from matrix where the test column corresponding to the fault that did not occur has been removed. depends on the prior probability , and can be presented as follows:

Lagrangian relaxation algorithm is applied to the model. The improved optimization model is proposed as follows [19]:

where , is the Lagrangian multiplier. Subsequently, the Lagrangian dual model can be represented as follows:

Finally, the fault source can be obtained by solving the Lagrangian dual model .

4. Lagrange-Particle Swarm Optimization Algorithm

The gradually approaches its optimal solution in the original problem by improving the value of Lagrangian multiplier λ during the process of solving the Lagrangian dual model . The optimal solution of the problem can be calculated once the optimized value of Lagrangian multiplier λ is found out. In general, the method of updating multiplier λ in Lagrange relaxation algorithm is with the subgradient method, which means complex mathematical tool and theoretical analysis. Thus, the PSO algorithm is adopted to update the multiplier λ because it is not that complex and can solve the problem of optimization solution. Consequently, the PSO algorithm is combined with the Lagrangian relaxation model. In Lagrange-particle swarm optimization algorithm, the PSO algorithm is adopted to find the optimized value of Lagrangian multiplier λ. That is to say, the subgradient method is replaced by the PSO algorithm for calculating the Lagrangian multiplier λ.

The problem of defining a fitness function is involved in PSO algorithm. Here, the absolute value of the difference between upper and lower bounds is chosen as the reference standard. The upper bound of the original multiple fault model () is introduced as a parameter ; it can be replaced by the value of a feasible solution. is a lower bound that is the nearest value to for the function . The absolute value of the difference between upper and lower bounds is . The fitness function is , where is a scaling coefficient. If the particle λ reaches the optimal solution, then, the distance calculated by the particle between the upper bound and lower bound decreases. A smaller difference value between the upper and lower bounds means a bigger value of the fitness function, which shows the rationality of the designed fitness function . In addition, the absolute value of the difference between upper and lower bounds is a positive value; thus, the interval for the value of the fitness function is [0, 1]. The normalization method is beneficial for the position updating of the particle λ and the searching for the global optimal particle. Consequently, the fitness function meets the requirement of the algorithm.

The flow chart of the algorithm is shown in Figure 1. It should be noted that the particle λ should be a nonnegative value for updating [19]. Consequently, the speed and position of the particle shall be limited during the updating process to slow down the speed of moving to the negative direction.

Figure 1: The flow chart of the Lagrange-particle swarm optimization algorithm.

Defining as the optimal value for function for the current situation of λ. Above all, the Lagrange-particle swarm optimization algorithm can be summarized as follows:

(i)Step 1. Initialization of parameters. The initial population is , the size of the population is , the best position for initial particle is and the initial velocity vector is . The initial velocity is required to be between and . The optimal fitness function value for each initial particle is set as , where the dimension is . The difference of the absolute value between the minimum upper and lower bounds for each initial particle is , where the dimension is . The difference of the absolute value between the optimal upper and lower bounds for the overall initial situation is . Define and , where the dimension is .(iii)Step 2. Searching the global optimal particle.

 Step 2.1. Do the following five steps for each element in the th iteration of the particle denoted as .(1)Solving equation (8) with . The optimal value calculated by equation (8) is . Then, updating .(2)Constructing a feasible solution vectors for the original problem in equation (6) with the following four steps:

(a)Defining , where the vector is the calculation result of equation (8) by using . The value of is chosen as the subscript of the element in corresponding to .(b)For the row uncovered in (namely, ), add the corresponding value of to regarding .(c)Checking all the subscript satisfying . If is still the feasible solution of , define . This strategy is used for (1) removing unnecessary fault sources in the following application, (2) reducing the gap between , and , and (3) terminating the algorithm as soon as possible.(d)Updating the .

(3)Calculating the absolute value of the difference between the upper and lower bounds denoted as .(4)Calculating the value of the fitness function denoted as .(5)Basing on the fitness value of the global optimal value and the current generation’s value to determine whether to update the optimal position of the particle . If , update the position as , the value of fitness function as , and the difference between upper and lower bounds as ; otherwise, update no parameter. Step 2.2. Basing on the value of the fitness function , selecting the global optimal particle in the optimal position among all the particles. In addition, calculating the corresponding difference between the upper and lower bounds as , which is also the global smallest difference value between the upper and lower bounds.

(iv)Step 3. Updating the particles.

 Step 3.1. Updating the inertia weight . Step 3.2. Updating the velocity and position of the particles. The velocity of the th particle in the dimension for the times iteration is . If the updated velocity is negative, defining to slow down the movement speed in the negative direction. This is because the Lagrangian multiplier is required to be a nonnegative value. The updated position is . If , setting . Updating the time of the iteration as . Step 3.3. Determining whether the maximum number of the iterations has been reached. If or the absolute value () of the difference between the upper and lower bounds obtained by calculating the global optimal particle is less than the preset threshold, then, continue and turn to Step 4; else, turn to Step 2.

(v)Step 4. Solving equation (8) with the global optimal solution . Outputting the fault source  = . The proposed Lagrange-particle swarm updating algorithm inherits the advantages in PSO algorithm and Lagrangian relaxation model. On one hand, the objective function of the proposed algorithm integrates the complex constraint conditions, which makes it easier for solving the multiple fault diagnosis. On the other hand, the subgradient method is replaced by the PSO algorithm for calculating the Lagrangian multiplier λ, which simplifies the theoretical analysis and solving process. It should be noted that the proposed algorithm has more than one feasible solution, which shows priority over the original Lagrange relaxation algorithm. While using PSO to update the Lagrangian multiplier λ, there are many alternative particles except for the optimal ones. This contributes to more alternative fault diagnosis strategies in solving multiple fault diagnosis problem, which makes the proposed method more suitable for locating the multiple fault types in fault diagnosis.

5. Experiment and Discussion

To test the performance of Lagrange-particle swarm updating algorithm in multiple fault diagnosis problem, an example of system state diagnosis before the launch of Apollo spacecraft was adopted from [36, 37]. In the case study, 10 fault states and 15 sensor test points are known and the prior probabilities among all the fault states are assumed to be equal. The dependency matrix of the system is shown in Table 1.

Table 1: The dependency matrix for fault status and test in the system of Apollo spacecraft.

Fault no.
Test point
Prior probability

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15

1
0
0
0
1
0
0
0
1
0
1
1
1
1
0
0
0.1

2
0
0
1
0
1
0
0
0
0
0
1
1
0
1
0
0.1

3
0
0
0
0
1
1
1
0
1
1
1
1
0
0
1
0.1

4
0
1
0
0
0
1
1
0
0
0
0
0
0
1
1
0.1

5
0
1
0
1
0
1
1
1
1
1
0
0
1
1
0
0.1

6
0
0
0
1
1
0
0
1
1
1
0
1
1
1
1
0.1

7
1
0
0
1
1
0
0
0
0
0
0
1
0
1
1
0.1

8
1
1
1
0
0
1
1
0
1
1
1
0
0
1
0
0.1

9
1
0
0
1
1
0
0
0
0
0
0
1
0
1
1
0.1

10
1
1
1
1
0
0
1
0
0
0
1
0
1
1
0
0.1

Establishing the corresponding Lagrangian dual model, the proposed Lagrange-particle swarm optimization algorithm is adopted to solve the model. The solving of the model is by programming in MATLAB R2014a. The parameters in the algorithm are chosen as follows. The maximum iteration number  = 200, population size popsize = 50, acceleration factor and , maximum of inertia weight , minimum inertia of weight , maximum of velocity , minimum of velocity , proportional coefficient and , and the absolute value of the minimum difference between upper and lower bounds . affects the quality of solution and the calculating time significantly. If is too small, it may lead to a failure of the solution to be less than the threshold even after the solution reached the maximum number of iterations, which means a high but unnecessary requirement on the quality of solution. On the contrary, if is too big, the number of iterations may be too less, which may lead to a bad quality of solution. After many times of trial, is finally to be chosen as 0.01.

Take the double-fault diagnosis problem as an example, the results are shown in Table 2. The corresponding fault isolation rate is 91.11%. The proposed method has a right diagnosis result on almost all the double-fault types. As for the fault No. (4 and 6), the proposed method gives a solution as (4, 5, and 6), which includes all the potential fault elements 4, 5, and/or 6. In this case, the fault diagnosis with the proposed method eliminates all possible faults without the missed one. Similar situation also exists in the fault No. (5 and 6), (5 and 8), and (5 and 10) according to Table 2.

Table 2: The results of double-fault diagnosis with Lagrange relaxation-particle swarm optimization algorithm.

Fault no.
Sensor report no.
Diagnosis results

1, 2
3, 4, 5, 8, 10, 11, 12, 13, 14
1, 2

1, 3
4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15
1, 3

1, 4
2, 4, 6, 7, 8, 10, 11, 12, 13, 14, 15
1, 4

1, 5
2, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14
1, 5

1, 6
4, 5, 8, 9, 10, 11, 12, 13, 14, 15
1, 6

1, 7
1, 4, 5, 8, 10, 11, 12, 13, 15
1, 7

1, 8
1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14
1, 8

1, 9
1, 4, 5, 8, 11, 12, 13, 14, 15
1, 9

1, 10
1, 2, 3, 4, 7, 8, 10, 11, 12, 13, 14
1, 10

2, 3
3, 5, 6, 7, 9, 10, 11, 12, 14, 15
2, 3

2, 4
2, 3, 5, 6, 7, 11, 12, 14, 15
2, 4

2, 5
2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14
2, 5

2, 6
3, 4, 5, 8, 9, 10, 11, 12, 13, 14, 15
2, 6

2, 7
1, 3, 4, 5, 8, 11, 12, 13, 14, 15
2, 7

2, 8
1, 2, 3, 5, 6, 7, 9, 10, 11, 12, 14
2, 8

2, 9
1, 3, 4, 5, 11, 12, 14, 15
2, 9

2, 10
1, 2, 3, 4, 5, 7, 11, 12, 13, 14
2, 10

3, 4
2, 5, 6, 7, 9, 10, 11, 12, 14, 15
3, 4

3, 5
2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15
3, 5

3, 6
4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15
3, 6

3, 7
1, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15
3, 7

3, 8
1, 2, 3, 5, 6, 7, 9, 10, 11, 12, 14, 15
3, 8

3, 9
1, 4, 5, 6, 7, 9, 10, 11, 12, 14, 15
3, 9

3, 10
1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15
3, 10

4, 5
2, 4, 6, 7, 8, 9, 10, 13, 14, 15
4, 5

4, 6
2, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15
4, 5, 6

4, 7
1, 2, 4, 5, 6, 7, 8, 11, 13, 14, 15
4, 7

4, 8
1, 2, 3, 6, 7, 9, 10, 11, 14, 15
4, 8

4, 9
1, 2, 4, 5, 6, 7, 12, 14, 15
4, 9

4, 10
1, 2, 3, 4, 6, 7, 11, 13, 14, 15
4, 10

5, 6
2, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15
4, 5, 6

5, 7
1, 2, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 15
5, 7

5, 8
1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 13, 14
5, 8, 10

5, 9
1, 2, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15
5, 9

5, 10
1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 13, 14
5, 8, 10

6, 7
1, 4, 5, 8, 9, 10, 11, 12, 13, 14, 15
6, 7

6, 8
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15
6, 8

6, 9
1, 4, 5, 8, 9, 10, 12, 13, 14, 15
6, 9

6, 10
1, 2, 3, 4, 5, 7, 8, 9, 10, 11, 12, 13, 14, 15
6, 10

7, 8
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 15
7, 8

7, 9
1, 4, 5, 8, 11, 12, 13, 14, 15
7, 9

7, 10
1, 2, 3, 4, 5, 7, 8, 11, 13, 14, 15
7, 10

8, 9
1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 14, 15
8, 9

8, 10
1, 2, 3, 4, 6, 7, 9, 10, 11, 13, 14
8, 10

9, 10
1, 2, 3, 4, 5, 7, 11, 12, 13, 14, 15
9, 10

Fault isolation rate

 91.11%

Adopting the case study in [19] where Lagrange relaxation algorithm is proposed for the diagnosis of double-fault types, the failure states are not recognized with the fault No.: (1) 3 and 5, (2) 6 and 8, (3) 8 and 9, (4) 4 and 6, (5) 5 and 6, (6) 5 and 10, and (7) 5 and 8. The experiment results with the original Lagrange relaxation algorithm and the improved algorithm are shown in Table 3.

Table 3: The experiment results with the Lagrange relaxation algorithm and the proposed method.

Fault
Sensor report no.
Lagrange algorithm
Proposed method

3, 5
2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15
1, 3, 4
3, 5

6, 8
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15
2, 3, 4, 7
6, 8

8, 9
1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 14, 15
2, 3, 4, 9
8, 9

4, 6
2, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15
4, 6
4, 5, 6

5, 6
2, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15
4, 6
4, 5, 6

5, 10
1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 13, 14
5, 8
5, 8, 10

5, 8
1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 13, 14
5, 8
5, 8, 10

According to Table 3, the fault status exists in fault No. (3 and 5), and the diagnosis result with the original Lagrange relaxation algorithm is fault No. (1, 3 and 4), while the result with the proposed method is fault No. 3 and 5. The proposed method can successfully find the right fault types. In addition, if the fault status exists in fault No. (4 and 6), (5 and 6), the improved method can locate all the potential faults denoted as No. (4, 5 and 6), which can ensure that all potential fault statuses can be located during the fault diagnosis process. For the fault No. (3 and 5), (6 and 8), and (8 and 9), the proposed method gets accurate and right solution, while the method with only Lagrange relaxation algorithm gets wrong diagnosis results where some elements with no fault are also included in the fault diagnosis reports (e.g., element No. 1 and 2). As for the fault No. (4 and 6), (5 and 6), (5 and 8), and (5 and 10), the original Lagrange relaxation algorithm cannot distinguish the fault status with the same alarm sensor report numbers, while the proposed method reports the diagnosis results including all the fault elements without missing fault type or including normal element. The fault isolation rate of the improved algorithm for double-fault diagnosis reaches 91.11% which is higher than that of the literature [19] (where the fault isolation rate is 88.89%). In addition, the troubleshooting rate with the proposed method reaches 100% in this case. Above all, the proposed method has a better performance on the fault isolation rate and the troubleshooting rate which is helpful for solving the problem of multiple fault diagnosis in complex equipment.

Simulation experiment result shows that the fault isolation rate of the proposed method is higher than that of the original Lagrange relaxation algorithm. The proposed method has a higher accuracy in fault diagnosis. This is because the Lagrangian multiplier in the original Lagrange relaxation algorithm has been improved. In the proposed method, (1) the PSO algorithm is adopted to update the Lagrangian multiplier, and (2) the fitness function is constructed by using the difference between upper and lower bounds. With PSO, the initial particle and its iterative updating process have the feature of a random process; consequently, a global search can be achieved and contribute to more choices for selecting particles.

6. Conclusions

In this paper, the Lagrange-particle swarm optimization algorithm is proposed to solve the multiple fault diagnosis model. Being different from the original subgradient ascending method, the Lagrangian multiplier in the original Lagrangian relaxation algorithm is updated by the PSO algorithm, which makes it easier for theoretical analysis and algorithm implementation. The fitness function is constructed based on the absolute value of the difference between the upper and lower bounds. The new fitness function can be a main adjusted index that is responsible for the effectiveness of the multiplier. By controlling the speed of updating speed to the negative direction, we can improve the search performance in the proposed approach. The effectiveness of the new method is verified according to the simulation experiment, and the superiority is also discussed in comparison with the original algorithm.

In the following work, the reliability of the test can be taken into consideration. The multiple fault diagnosis model may include the occurrence of failure in sensors. Currently, it is assumed that the test of fault detection is reliable. If a fault occurs, the fault can be detected by the test safely and reliably. However, in practical system, the fault detection rate may not reach 100%, because the test is composed of several sensors, while the sensor itself may fail.

Data Availability

All relevant data are provided within the paper.

Conflicts of Interest

The authors declare that there are no conflicts of interest regarding the publication of this paper.

References

H. Liu and J. Xiang, “Autoregressive model-enhanced variational mode decomposition for mechanical fault detection,” IET Science, Measurement & Technology, vol. 13, no. 6, pp. 843–851, 2019.

S. Wang, J. Xiang, H. Tang, X. Liu, and Y. Zhong, “Minimum entropy deconvolution based on simulation-determined band pass filter to detect faults in axial piston pump bearings,” ISA Transactions, vol. 88, pp. 186–198, 2019.

D. Wu and Y. Tang, “An improved failure mode and effects analysis method based on uncertainty measure in the evidence theory,” Quality and Reliability Engineering International, pp. 1–22, 2020.

L. Wang, J. Xiang, and Y. Liu, “A time-frequency-based maximum correlated kurtosis deconvolution approach for detecting bearing faults under variable speed conditions,” Measurement Science and Technology, vol. 30, no. 12, p. 125005, 2019.

Y. Wang, L. Yang, J. Xiang, J. Yang, and S. He, “A hybrid approach to fault diagnosis of roller bearings under variable speed conditions,” Measurement Science and Technology, vol. 28, no. 12, 2017.

X. Lv, D. Zhou, L. Ma, and Y. Tang, “Dependency model-based multiple fault diagnosis using knowledge of test result and fault prior probability,” Applied Sciences, vol. 9, no. 2, p. 311, 2019.

B. Jiang, J. Xiang, and Y. Wang, “Rolling bearing fault diagnosis approach using probabilistic principal component analysis denoising and cyclic bispectrum,” Journal of Vibration and Control, vol. 22, no. 10, pp. 2420–2433, 2016.

S. Wang, J. Xiang, Y. Zhong, and Y. Zhou, “Convolutional neural network-based hidden Markov models for rolling element bearing fault identification,” Knowledge-Based Systems, vol. 144, no. 65–76, 2018.

D. Kayrbekova, A. Barabadi, and T. Markeset, “Maintenance cost evaluation of a system to be used in arctic conditions: a case study,” Journal of Quality in Maintenance Engineering, vol. 17, no. 4, pp. 320–336, 2011.

P. Gupta, S. Gupta, and O. P. Gandhi, “Annual maintenance budget estimation for a plant system,” Journal of Quality in Maintenance Engineering, vol. 20, no. 2, pp. 193–210, 2014.

C. He Chang and P. Yang JiangP. Ju Cao, “Research on testability evaluation method of complex equipment based on test data in development phase,” in Advanced Materials Research, vol. 301–303, pp. 913–918, Trans Tech Publ, 2011.

X. Zhang, K. Huang, P. Yan, and G. Lian, “Hierarchical hybrid testability modeling and evaluation method based on information fusion,” Journal of Systems Engineering and Electronics, vol. 26, no. 3, pp. 523–532, 2015.

T. Li, Y. Li, Y. Qian, and Y. Xu, “Optimizing reliability, maintainability and testability parameters of equipment based on gspn,” Journal of Systems Engineering and Electronics, vol. 26, no. 3, pp. 633–643, 2015.

M. Efatmaneshnik, M. J. Ryan, and S. Shoval, “A framework for testability analysis from a systems architecture perspective,” Insight, vol. 21, no. 3, pp. 72–79, 2018.

S. Wang, J. Xiang, Y. Zhong, and H. Tang, “A data indicator-based deep belief networks to detect multiple faults in axial piston pumps,” Mechanical Systems and Signal Processing, vol. 112, pp. 154–170, 2018.

W. Song, J. Xiang, and Y. Zhong, “A simulation model based fault diagnosis method for bearings,” Journal of Intelligent & Fuzzy Systems, vol. 34, no. 6, pp. 3857–3867, 2018.

X. Lv, D. Zhou, Y. Tang, and L. Ma, “An improved test selection optimization model based on fault ambiguity group isolation and chaotic discrete pso,” Complexity, vol. 2018, Article ID 3942723, 10 pages, 2018.

M. Amit, S. Ghoshal, D. Haste et al., “An integrated support system for rotorcraft health management and maintenance,” in Proceedings of the 2000 IEEE Aerospace Conference Proceedings (Cat. No. 00TH8484), vol. 6, pp. 1–8, IEEE, Big Sky, MT, USA, March 2000.

L. Ke, B. Long, and H. J. Wang, “A fault diagnosis approach of the large complex system based on bayes theory,” Acta Armamentarii, vol. 29, no. 3, pp. 352–356, 2008.

V. Neven, P. Kovaˇcki, M Vidovi´c, and A. T. Sari´c, “Scalable algorithm for the dynamic reconfiguration of the distribution network using the Lagrange relaxation approach,” International Journal of Electrical Power & Energy Systems, vol. 94, pp. 188–202, 2018.

Z. Rafie-Majd, S. H. R. Pasandideh, and B. Naderi, “Modelling and solving the integrated inventory-location-routing problem in a multi-period and multi-perishable product supply chain with uncertainty: Lagrangian relaxation algorithm,” Computers & Chemical Engineering, vol. 109, no. 9–22, 2018.

O. G. Czibula, H. Gu, and Y. Zinder, “Lagrangian relaxation versus genetic algorithm based metaheuristic for a large partitioning problem,” Theoretical Computer Science, vol. 718, pp. 24–36, 2018.

S. Emami, M. Sabbagh, and G. Moslehi, “A Lagrangian relaxation algorithm for order acceptance and scheduling problem: a globalised robust optimisation approach,” International Journal of Computer Integrated Manufacturing, vol. 29, no. 5, pp. 535–560, 2016.

D. L. Pereira and A. S. da Cunha, “Polyhedral results, branch-and-cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem,” Networks, vol. 71, no. 1, pp. 31–50, 2018.

M. Kheirabadi, B. Naderi, A. Arshadikhamseh, and V. Roshanaei, “A mixed-integer program and a Lagrangian-based decomposition algorithm for the supply chain network design with quantity discount and transportation modes,” Expert Systems with Applications, vol. 137, pp. 504–516, 2019.

S. Yamada and A. Takeda, “Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization,” Journal of Global Optimization, vol. 71, no. 2, pp. 313–339, 2018.

L. Ping, K. Xiangrui, F. Chen, and Y. Zheng, “Novel distributed state estimation method for the ac-dc hybrid microgrid based on the Lagrangian relaxation method,” The Journal of Engineering, vol. 2019, no. 18, pp. 4932–4936, 2019.

M.-C. Tsai, F. Y.-S. Lin, and Y.-F. Wen, “Lagrangian-relaxation-based self-repairing mechanism for wi-fi networks,” IEEE Access, vol. 7, pp. 15868–15883, 2019.

J.-c. Huang, Y. Tao, L. You, and S. Jia-you, “Improved Lagrange relaxation algorithms and its application in multiple fault diagnostic strategy,” Computer Engineering and Design, vol. 38, no. 4, pp. 1040–1044, 2017.

S. D. Chavan and N. P. Adgokar, “An overview on particle swarm optimization: basic concepts and modified variants,” International Journal of Science and Research, vol. 4, no. 5, pp. 255–260, 2015.

D. Wang, D. Tan, and L. Liu, “Particle swarm optimization algorithm: an overview,” Soft Computing, vol. 22, no. 2, pp. 387–408, 2018.

Q.-b. Zhang, P. Wang, and Z.-h. Chen, “An improved particle filter for mobile robot localization based on particle swarm optimization,” Expert Systems with Applications, vol. 135, 2019.

Z. Xiang, D. Ji, H. Zhang, H. Wu, and Y. Li, “A simple pid-based strategy for particle swarm optimization algorithm,” Information Sciences, vol. 502, 2019.

M. Imran, R. Hashim, and N. Khalid, “An overview of particle swarm optimization variants,” Procedia Engineering, vol. 53, pp. 491–496, 2013.

Y. Mao, C. Liu, X. Dong, J. Wang, and T. Ba, “Study of the magnetic properties of haematite based on spectroscopy and the ipso-elm neural network,” Journal of Sensors, vol. 2018, Article ID 6357905, 9 pages, 2018.

J. G. Wohl, “Information automation and the apollo program: a retrospective,” IEEE Transactions on Systems, Man, and Cybernetics, vol. 12, no. 4, pp. 469–478, 1982.

S. Deng, B. Jing, and H. Zhou, “Heuristic particle swarm optimization approach for test point selection with imperfect test,” Journal of Intelligent Manufacturing, vol. 28, no. 1, pp. 37–50, 2017.