Computational Intelligence in Modeling Complex Systems and Solving Complex ProblemsView this Special Issue
Research Article | Open Access
Xiaofeng Lv, Deyun Zhou, Yongchuan Tang, Ling 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. https://doi.org/10.1155/2018/3942723
An Improved Test Selection Optimization Model Based on Fault Ambiguity Group Isolation and Chaotic Discrete PSO
Sensor data-based test selection optimization is the basis for designing a test work, which ensures that the system is tested under the constraint of the conventional indexes such as fault detection rate (FDR) and fault isolation rate (FIR). From the perspective of equipment maintenance support, the ambiguity isolation has a significant effect on the result of test selection. In this paper, an improved test selection optimization model is proposed by considering the ambiguity degree of fault isolation. In the new model, the fault test dependency matrix is adopted to model the correlation between the system fault and the test group. The objective function of the proposed model is minimizing the test cost with the constraint of FDR and FIR. The improved chaotic discrete particle swarm optimization (PSO) algorithm is adopted to solve the improved test selection optimization model. The new test selection optimization model is more consistent with real complicated engineering systems. The experimental result verifies the effectiveness of the proposed method.
High technologies contribute a lot to the improvement of the performance of complex equipment. However, new challenges are also brought into testing, diagnosis, and maintenance stages of the equipment because the system structure is more and more complicated [1–3]. In order to improve the testing efficiency and diagnosis ability, as well as to reduce the test cost, the design for testability (DFT) should be carried out simultaneously during the design of the equipment . Test optimization selection is a process of selecting the proper test set from all the available test set under the constraints including minimum test cost, test cycle, fault detection rate (FDR) index, fault isolation rate (FIR) index, test resources, and engineering-oriented constraint rules . Test optimization selection is a nondeterministic polynomial-time hard (NP-hard) problem , which is a challenging problem related to the combination problem and the permutation problem.
In general, two categories of methods have been applied to solve the test optimization selection problem: sequential fault diagnosis methods [7–11] and direct searching algorithms [12–15]. Sequential fault diagnosis methods include dynamic programming (DP) algorithm, information entropy method, graph search method, and heuristics method. These methods model the test optimization selection problem as a binary identification problem [7, 16]. Direct searching algorithms are intelligent optimization algorithms, including evolution algorithms and particle swarm optimization (PSO) algorithm. The direct searching method with artificial intelligence searching method can directly find the optimal test set, for example, the multidimensional discrete PSO algorithm [17, 18], the genetic algorithm (GA) , and so on . With these methods, although the optimal solution can be found, some faults with low probability cannot be detected and isolated, which means information loss for the system.
In the process of test selection optimization, among the alternative test sets, if the test cost of each test is equal to each other, the test set corresponding to faults of high fault rate is usually chosen. This may lead to failure in fault detection and isolation of those faults with low probability. More seriously for the complex system, the losing of some fault information may lead to increasing of the maintenance costs of equipment system. In addition, if all those faults with low probability are taken into consideration by increasing the FDR, the test cost will increase significantly. In real engineering practice, it is unreasonable and uneconomical to realize the unique isolation of all the faults. Thus a process of fault detection and isolation that can isolate the fault into a specific replacement unit or some fault ambiguity groups is consistent with real applications. In this paper, an improved test selection optimization model is proposed. Firstly, a fault is isolated to a fault ambiguity group with a number of replacement unit (in real applications, is usually chosen to be 3). After that, the maintenance methods such as replacement are adopted to isolate the fault to a specific replacement unit. The proposed strategy is different from the methods in [20, 21], where the fault ambiguity degree of FIR is 1. A more flexible model for test selection optimization model will be proposed in this paper, which can be more compatible with real engineering applications.
Computational intelligence (CI) theories such as evolutionary algorithms [22, 23], artificial neural networks , cognitive map analysis , Physarum solver [26–28], fuzzy sets [29–31], belief function [32–34], PSO [35–37], and so on , have been widely used to cope the complex problems including the permutation flow shop problem , supply chain network [40, 41], traveling salesman problem , pattern recognition [43–46], power system , product design and manufacturing , and so on [49–52]. Recently, based on this progress in CI, many nature inspired approaches have been proposed to solve test selection optimization problem, such as the greedy strategy , the genetic algorithm [54, 55], the evolutionary algorithm [56, 57], and so on . The PSO has some advantages in comparison with some other methods; for example, it requires less parameters and has a fast convergence rate. In this paper, the improved chaotic discrete PSO (ICDPSO) algorithm is applied to deal with the improved test selection optimization model. The indexes including FDR and FIR are handled simultaneously to solve the improved test selection optimization model. While modelling the fitness function, the fault ambiguity group with different ambiguity degree is taken into consideration. The reasonableness of the improved test selection optimization model as well as the effectiveness of the ICDPSO algorithm is verified according to the experiment. In addition, the computational performance of the proposed method is better than that of GA.
The rest of this paper is organized as follows. The preliminaries are introduced in Section 2. In Section 3, a new evidential sensor fusion method is proposed. The method of solving the improved test selection optimization model is introduced in Section 4. An application example in fault diagnosis is illustrated to show the efficiency of this method in Section 5. Finally, the conclusion is presented in Section 6.
2.1. Fault Test Dependency Matrix
Fault test dependency matrix is a Boolean matrix describing the correlation between the system fault and test. Assume that the fault set is , the alternative test set is , and the dependency matrix is a Boolean matrix with dimensions, denoted as follows [59, 60]:where is generally defined as a Boolean variable, which represents the correlation between the fault mode and the test .
If a fault mode can be detected by the test , then ; otherwise . In the matrix, the vector in the th row represents the correlation of the fault mode with all the tests. is called the symptom of the fault mode . The vector in the th column represents the correlation of the test with all the fault modes. is called the symptom of the test .
A test set that can be affected by the fault mode is defined as . Similarly, a fault set that can be detected by the test is defined as .
2.2. Testability Index
Testability index includes fault detection rate (FDR) and fault isolation rate (FIR).
2.2.1. Fault Detection Rate
Fault detection rate (FDR) is generally defined as, within the prescribed time, the ratio of the total fault rate of the fault modes to the total fault rate of the units under test. The condition of a fault mode which can be detected by the test set is that, in the fault test dependency matrix, at least one element of the row vector corresponding to the is 1. Mathematically, the condition can be denoted as follows:where is the OR operation of Boolean variable and is the element number in the set . Then, all the fault modes detected by can be denoted as a set , shown as follows:Thus, FDR is defined as follows:where is the fault rate of the th fault mode.
2.2.2. Fault Isolation Rate
Fault isolation rate (FIR) is generally defined as, within the prescribed time, with the specified method, and under the constraint that the number of the replacement unit is no more than the requested replacement number , the ratio of the total fault rate that can be isolated correctly to the detected total fault rate. The replacement number represents the ambiguity of fault isolation. If , it is called the unique isolation. If , it is called ambiguity isolation.
Assume that and are the symptom sets of the fault modes and , respectively; then the condition that a fault mode can be isolated can be shown as follows:where is the exclusive OR operator of two sets. If two sets are the same, the calculation result with is 0; otherwise, the result is 1. Define an operator for two sets, denoted as , satisfying the following condition: if , then ; that is, the fault modes and belong to the same fault ambiguity group.
For a given ambiguity of fault isolation , the fault set, denoted as , that can be isolated by a test set is defined as follows:FIR is defined as follows:where represents the total fault ratio of all the detected fault modes and represents the total fault ratio of the fault modes that can be isolated under the constraint that the number of the replaced units is no more than the replacement number .
3. The Improved Test Selection Optimization Model
In real applications, the value of ambiguity of fault isolation () is generally not bigger than 3. Without lose generality, we define FIR as follows:where represents the ambiguity of fault isolation and is the fault rate of the th fault mode with the isolated replacement unit number of the fault being . Equation (8) contains the following conditions:(1): in this case, , where is the fault rate of the th fault mode while the isolated replacement unit number of the fault is 1.(2): in this case, , where is the fault rate of the th fault mode while the isolated replacement unit number of the fault is 2.(3): in this case, , where is the fault rate of the th fault mode while the isolated replacement unit number of the fault is 3.
The aim of the improved test selection optimization model is selecting the optimized test set from the alternative test sets of the system to meet the requirements of the system testability index as well as to minimize the test cost corresponding to the selected test set. Assume that is the vector of prior probability of fault modes, is the vector of test cost, and the selected test set is , where . The total test cost of the test set is defined as follows:Based on the constraint of testability index and the objective function, the proposed test selection optimization model is defined as follows:where , , , , and are the desired fault detection rate of the system, the fault isolation rate with an ambiguity degree 1, the fault isolation rate with an ambiguity degree 2, the fault isolation rate with an ambiguity degree 3, and the fault isolation rate with an ambiguity degree , respectively. The fault isolation rate of the ambiguity degree enables the proposed test selection optimization model to be more flexible in real applications.
4. Solving the Improved Test Selection Optimization Model
The process of test selection optimization is a multiobjective optimization problem. The ICDPSO algorithm has been adopted to solve the improved test selection optimization model.
4.1. Chaos Initialization
The chaotic motion seems to be random, but it has a hidden exquisite structure such as the characteristics of ergodicity, randomness, and regularity. The basic idea of this algorithm is, firstly, to generate a set of chaotic variables, which has the same number as the optimization variables; secondly, to introduce the chaos into the optimization variables with a way similar to carrier and to amplify the search scope of chaotic motion to the range of the value of the optimization variables simultaneously; finally, to search for and optimize the chaotic variables directly.
The improved Tent map has better ergodic uniformity and is beneficial to global optimization of chaos; thus, it is adopted to generate the chaotic variables. The Tent map is shown as follows:The Tent map may iterate to a fixed point, for example, 0, 0.25, 0.5, 0.75; to avoid this situation, a small disturbance is added to the sequence to enable the Tent map to go back to chaos. The added disturbance is shown as follows: if = 0, 0.25, 0.5, 0.75 or , then , else ,
where is a chaotic variable, , . The improved Tent map enables the ergodic process of to cover the whole range among . The iterative results starting from an arbitrary initial value of can be a deterministic chaotic time sequences: , , , etc.
4.2. Calculation of Fitness Function
The fitness value aims to evaluate the pros and cons of each particle in the group, of which the calculation method has an important influence on the performance of a particle swarm. To solve the test selection optimization model in (10), the FDR and the penalty function are adopted to define the fitness function; the fitness degree of the test set is defined as follows:where , , , and are penalty factors and they are constants, the penalty function aims to correct the particle that crossed the boundary, and the heuristic strategy is used to process the FDR to get the feasible particle.
According to the fitness degree defined in (12), if a particle in the group meet all the requirements of FIR, its fitness is defined by the first term of (12); thus, the particle has a bigger fitness degree; if a particle in the group does not meet the 3 requirements of FIR, a penalty function is used to penalize the corresponding fitness degree; thus, its fitness degree is much more smaller than the first term of (12); in this way, the chance of this particle entering the next generation can be decreased.
4.3. Inertia Weight Adaptive Adjustment
In the discrete particle swarm algorithm, the purpose of the inertia weight is to control the effect of the former speed on the current speed, which is also for balancing the exploration and exploitation ability of the algorithm. After the initialization of the particle, in the early stage, the movement of the particle is not objective, the searching range is the whole solution space, and, thus, the value of should be bigger than the other cases. With the ongoing of the search, the searching range becomes smaller and will finally determine the range of search at the vicinity of the optimal solution; in this case, the value of should be small until the optimal solution is got. In this paper, the adjustment strategy is based on the degree of premature convergence of the particle, and the inertia weight of the particle is self-adaptively adjusted. The degree of premature convergence of the particle can be assessed with the following equation:where is the fitness value of the global optimum particle and is the average fitness value of the particle whose fitness value is higher than the average fitness value of the current particle swarm (denoted as ). The assessment rule is that the smaller the is, the easier the particle swarm gets premature.
If the fitness value of a particle is , the adjustment strategy is defined as follows:(1)If , which means that the corresponding particle has a good fitness in the whole population and it is near the vicinity of the optimal solution, then a small inertia weight should be assigned on the particle to enhance its local search ability. In this case, the adjustment strategy is defined as follows: where is chosen as the minimum of while doing parameter initialization and is the median of the value range of ; that is to say, .(2)If , which means that the corresponding particle has a proper fitness in the whole population and it has a good global search ability as well as the local search ability, then the adjustment strategy is defined as follows: where is the maximum iterations of the algorithm and is the current number of iterations.(3)If , which means that the corresponding particle has bad fitness in the whole population and it is far from the vicinity of the optimal solution, then, a big inertia weight should be assigned on the particle to enhance its global search ability. In this case, the adjustment strategy is defined as follows: where is the controlling parameter () and is the adjusting parameter ().
4.4. Algorithm Implementation
The ICDPSO algorithm for test selection optimization is implemented as in the following steps.
Step 1 (parameter initialization). The initial value is assigned to the following parameters, respectively: the size of the population denoted as , the learning factors denoted as and , the inertia weights denoted as and , the maximum iteration denoted as , and the constants such as , , , and .
Step 2 (generation of an initial population). The iteration counter of the population is set as . The initial population with a size , which is denoted as , is generated based on chaos initialization.
Step 3 (calculation of fitness function). The fitness degree of each individual in the population is calculated based on (12). Simultaneously, the individual extremum, denoted as , and the global extremum, denoted as , are updated.
Step 4 (inertia weight adjustment). The update of the population speed and location is based on the strategy of the inertia weight adaptive adjustment presented in Section 4.3. The next generation of population is . The counter should be updated, which means .
Step 6 (output). Output the results of test selection optimization.
The procedure of the algorithm solving the improved test selection optimization model is presented in Figure 1.
The improved test selection optimization model is applied to a superheterodyne receiver system, which is adopted from . There are 36 different alternative tests denoted as () and 22 fault modes denoted as () in the system. The fault probabilities, denoted as (), of all the 22 fault modes are 1.85, 9.23, 185, 1.85, 1.85, 9.23, 1.85, 9.23, 185, 185, 185, 1.85, 9.23, 185, 9.23, 1.85, 9.23, 1.85, 1.85, 1.85, 1.85, 1.85. The cost of each test is assumed to be a standard unit. The testability indicators for the system are shown in Table 1.
The ICDPSO algorithm has been applied to solve the improved test selection optimization model of the superheterodyne receiver system. The values of the parameters are as follows: the size of the population is , the maximum iteration number is , the inertia weights is , the learning factors are , , , and the penalty factors are .
After 30 times of independent calculation with 200 iterations for each independent calculation, the fitness convergence curve of the particle can be got, as is shown in Figure 2. The optimal solutions for all the independent calculation can be got after about 45 to 95 iterations, which shows the convergence performance of the proposed method.
The optimal solutions of simulation are 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, which means that the optimal complete test set is [, , , , , , ]. The corresponding fault set of the optimal complete test set is [, , , , , , , , , , , , , , , ], as is shown in Table 2.
The FDR of the system isThe fault set with an ambiguity degree of 1 is [, , , , , , ]; thus, the FIR with an ambiguity degree of 1 isThe fault set with an ambiguity degree of 2 is [, , , , , ]; thus, the FIR with an ambiguity degree of 2 isThe fault set with an ambiguity degree of 3 is [, , ]; thus, the FIR with an ambiguity degree of 3 isThe experimental result shows that the FIRs with the ambiguity degrees of 1, 2, and 3 are 95.3%, 98.68%, and 100%, respectively; the optimal complete test set is [, , , , , , ], which means the test cost is 7; there are 6 fault modes that cannot be detected and isolated by the optimal test set, including , , , , , . In comparison with the experimental results in , the number of fault modes that cannot be detected and isolated decreases from 9 to 6, which can be a marked improvement because 3 more fault modes in the system have been addressed. In addition, the FDR increases from 96.86% to 98.15%. This improvement should not be ignored especially for a core system or some big systems, in which each tiny improvement may lead to a more safe or more economical system. The comparison of the experimental results between the proposed method and the method in  is shown in Table 3. In general, it is complicated to judge which method is better. The judgement should be dependent on the specific needs. However, two things are for sure: on the one hand, the effectiveness of the proposed method has been verified; on the other hand, the proposed method has a better performance than the method in , including a higher FDR and more detected fault modes. Last but not least, the proposed method can handle the FIR with a complicated ambiguity degree.
Figure 3 presents the average convergence time of solving the test selection model in the application with ICDPSO algorithm, as well as the average convergence time with GA. In the aforementioned application, with GA, define that the population size is , the maximum iteration number is , the length of the chromosome is , the probabilities of crossover and mutation are and , respectively, and the penalty factors are .
The curves of the fitness values with respect to the running time of ICDPSO and GA presented in Figure 3 show that, regarding the running time, ICDPSO has a significantly better performance in solving global optimization solution in comparison with GA. The running time of GA is about twice the cost of ICDPSO. After 30 times of independent experiments of the test selection optimization model for the superheterodyne receiver system, the statistical results of GA and ICDPSO are shown in Table 4. Although both ICDPSO and GA have the same minimum test cost of 7 and the success rates of searching out optimal solution are both 100%, the average running time of GA is more than 2 times that of ICDPSO. The priority of the proposed method in running time is not that significant while dealing with small scale test selection problem. However, with the increasing of test size, for example, in complex equipment or systems, the proposed method with ICDPSO can have a significant improvement in working performance than GA.
A proper selection of the appropriate test set plays an important role in measuring the testability level, which is related to the test cost of the diagnostic for a system or equipment as well as the subsequent maintenance costs. An improved test selection optimization model based on fault ambiguity group isolation and chaotic discrete PSO is proposed in this paper, which considers the ambiguity FIR index constraint. The main contribution of this paper is the modelling and mathematical expressions of the FIR with a complicated ambiguity degree, as well as the corresponding solving algorithm based on the chaotic discrete PSO algorithm. The FDR and FIR indexes are handled simultaneously while solving the improved test selection optimization model. The simulation result shows the feasibility and effectiveness of the proposed method, as well as the superiority in convergence.
The following work will be focused on combining the selection of test set with the designing of the diagnosis strategy, which is quite a complicated open issue related to the combination problem and the permutation problem. In addition, some new developed optimization techniques like differential evolution should be taken into consideration in the ongoing work.
Conflicts of Interest
The authors declare that there are no conflicts of interest regarding the publication of this paper.
The work is partially supported by the Innovation Foundation for Doctor Dissertation of Northwestern Polytechnical University under Grant CX201705.
- A. Falcoz, D. Henry, and A. Zolghadri, “Robust fault diagnosis for atmospheric reentry vehicles: a case study,” IEEE Transactions on Systems, Man, and Cybernetics: Systems, vol. 40, no. 5, pp. 886–899, 2010.
- P. Joshi, M. Imadabathuni, D. He, M. Al-Kateb, and E. Bechhoefer, “Application of the Condition Based Maintenance checking system for aircrafts,” Journal of Intelligent Manufacturing, vol. 23, no. 2, pp. 277–288, 2012.
- M. E. Paté-Cornell, “Organizational aspects of engineering system safety: The case of offshore platforms,” Science, vol. 250, no. 4985, pp. 1210–1217, 1990.
- S.-M. Yang, J. Qiu, G.-J. Liu, and P. Yang, “Sensor selection and optimization for aerospace system health management under uncertainty testing,” Transactions of the Japan Society for Aeronautical and Space Sciences, vol. 56, no. 4, pp. 187–196, 2013.
- I. Hwang, S. Kim, Y. Kim, and C. E. Seah, “A survey of fault detection, isolation, and reconfiguration methods,” IEEE Transactions on Control Systems Technology, vol. 18, no. 3, pp. 636–653, 2010.
- L. Hyafil and R. L. Rivest, “Constructing optimal binary decision trees is NP-complete,” Information Processing Letters, vol. 5, no. 1, pp. 15–17, 1976.
- R. A. Johnson, “An information theory approach to diagnosis,” IRE Transactions on Reliability and Quality Control, vol. 9, no. 1, p. 35, 1960.
- K. R. Pattipati and M. G. Alexandridis, “Application of Heuristic Search and Information Theory to Sequential Fault Diagnosis,” IEEE Transactions on Systems, Man, and Cybernetics, vol. 20, no. 4, pp. 872–887, 1990.
- V. Raghavan, M. Shakeri, and K. Pattipati, “Test sequencing algorithms with unreliable tests,” IEEE Transactions on Systems, Man and Cybernetics, Part A: Systems and Humans, vol. 29, no. 4, pp. 347–357, 1999.
- C. Yang, R. Su, and B. Long, “Methods of sequential test optimization in dynamic environment,” Microelectronics Reliability, vol. 70, pp. 112–121, 2017.
- C. Yang, J. Yan, B. Long, and Z. Liu, “A novel test optimizing algorithm for sequential fault diagnosis,” Microelectronics Journal, vol. 45, no. 6, pp. 719–727, 2014.
- D. F. Jones, S. K. Mirrazavi, and M. Tamiz, “Multi-objective meta-heuristics: an overview of the current state-of-the-art,” European Journal of Operational Research, vol. 137, no. 1, pp. 1–9, 2002.
- Q. Long, C. Z. Wu, T. W. Huang, and X. Y. Wang, “A genetic algorithm for unconstrained multi-objective optimization,” Swarm and Evolutionary Computation, 2015.
- J. Ferrer, F. Chicano, and E. Alba, “Evolutionary algorithms for the multi-objective test data generation problem,” Software: Practice and Experience, vol. 42, no. 11, pp. 1331–1362, 2012.
- 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.
- Y. Zhang, S. Wang, P. Phillips, and G. Ji, “Binary PSO with mutation operator for feature selection using decision tree applied to spam detection,” Knowledge-Based Systems, vol. 64, pp. 22–31, 2014.
- R. Jiang, H. Wang, S. Tian, and B. Long, “Multidimensional fitness function DPSO algorithm for analog test point selection,” IEEE Transactions on Instrumentation and Measurement, vol. 59, no. 6, pp. 1634–1641, 2010.
- W. Hu and G. G. Yen, “Adaptive multiobjective particle swarm optimization based on parallel cell coordinate system,” IEEE Transactions on Evolutionary Computation, vol. 19, no. 1, pp. 1–18, 2015.
- X. Y. Chen, K. W. Chau, and A. O. Busari, “A comparative study of population-based optimization algorithms for downstream river flow forecasting by a hybrid neural network model,” Engineering Applications of Artificial Intelligence, vol. 46, pp. 258–268, 2015.
- H. Lei and K. Qin, “Optimal test selection based on improved quantum-inspired evolutionary algorithm,” Chinese Journal of Scientific Instrument, vol. 34, no. 4, pp. 838–844, 2013.
- X. Chen, J. Qiu, and G. Liu, “Optimal test selection based on hybrid BPSO and GA,” Chinese Journal of Scientific Instrument, vol. 30, no. 8, pp. 1674–1680, 2009.
- K. Balazs and L. T. Koczy, “Hierarchical-interpolative fuzzy system construction by genetic and bacterial memetic programming approaches,” International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, vol. 20, pp. 105–131, 2012.
- K. Balazs and L. T. Koczy, “Constructing dense, sparse, and hierarchical fuzzy systems by applying evolutionary optimization techniques,” Applied And Computational Mathematics, vol. 11, pp. 81–101, 2012.
- A. Azizi, “Introducing a novel hybrid artificial intelligence algorithm to optimize network of industrial applications in modern manufacturing,” Complexity, vol. 2017, Article ID 8728209, 18 pages, 2017.
- E. I. Papageorgiou, M. F. Hatwágner, A. Buruzs, and L. T. Kóczy, “A concept reduction approach for fuzzy cognitive map models in decision making and management,” Neurocomputing, vol. 232, pp. 16–33, 2017.
- X. Zhang and S. Mahadevan, “A bio-inspired approach to traffic network equilibrium assignment problem,” IEEE Transactions on Cybernetics, 2017.
- Y. Deng, S. Mahadevan, and D. Zhou, “Vulnerability assessment of physical protection systems: a bio-inspired approach,” International Journal of Unconventional Computing, vol. 11, no. 3-4, pp. 227–243, 2015.
- X. Zhang, A. Adamatzky, F. T. Chan, S. Mahadevan, and Y. Deng, “Physarum solver: a bio-inspired method for sustainable supply chain network design problem,” Annals of Operations Research, vol. 254, no. 1-2, pp. 533–552, 2017.
- H.-Y. Jung, J. H. Yoon, and S. H. Choi, “Fuzzy linear regression using rank transform method,” Fuzzy Sets and Systems, vol. 274, pp. 97–108, 2015.
- M. Namdari, J. H. Yoon, A. Abadi, S. M. Taheri, and S. H. Choi, “Fuzzy logistic regression with least absolute deviations estimators,” Soft Computing, vol. 19, no. 4, pp. 909–917, 2015.
- W.-J. Lee, H. Y. Jung, J. H. Yoon, and S. H. Choi, “The statistical inferences of fuzzy regression based on bootstrap techniques,” Soft Computing, vol. 19, no. 4, pp. 883–890, 2015.
- Z.-G. Liu, Q. Pan, J. Dezert, and A. Martin, “Adaptive imputation of missing values for incomplete pattern classification,” Pattern Recognition, vol. 52, pp. 85–95, 2016.
- R. Jirousek and P. P. Shenoy, “Compositional models in valuation-based systems,” International Journal of Approximate Reasoning, vol. 55, no. 1, part 3, pp. 277–293, 2014.
- K. Zhou, A. Martin, Q. Pan, and Z.-G. Liu, “ECMdd: Evidential c-medoids clustering with multiple prototypes,” Pattern Recognition, vol. 60, pp. 239–257, 2016.
- A. R. Yildiz, “A novel particle swarm optimization approach for product design and manufacturing,” The International Journal of Advanced Manufacturing Technology, vol. 40, no. 5-6, pp. 617–628, 2009.
- A. R. Yildiz and K. N. Solanki, “Multi-objective optimization of vehicle crashworthiness using a new particle swarm based approach,” The International Journal of Advanced Manufacturing Technology, vol. 59, no. 1–4, pp. 367–376, 2012.
- O. Abedinia, A. Ghasemi, and N. Ojaroudi, “Improved time varying inertia weight PSO for solved economic load dispatch with subsidies and wind power effects,” Complexity, vol. 21, no. 4, pp. 40–49, 2016.
- B. S. Yildiz, “A comparative investigation of eight recent population-based optimisation algorithms for mechanical and structural design problems,” International Journal of Vehicle Design, vol. 73, no. 1, pp. 208–218, 2017.
- K. Balazs, Z. Horvath, and L. T. Koczy, “Different Chromosome-based Evolutionary Approaches for the Permutation Flow Shop Problem,” Acta Polytechnica Hungarica, vol. 9, pp. 115–138, 2012.
- X. Zhang, F. T. S. Chan, A. Adamatzky et al., “An intelligent physarum solver for supply chain network design under profit maximization and oligopolistic competition,” International Journal of Production Research, vol. 55, no. 1, pp. 244–263, 2017.
- Y. Tang, D. Zhou, and S. Xu, “An improved physarum solver for supply chain network with fuzzy numbers,” International Journal of Unconventional Computing, vol. 13, no. 2, pp. 161–184, 2017.
- L. T. Kóczy, P. Földesi, and B. Tüű-Szabó, “An effective Discrete Bacterial Memetic Evolutionary Algorithm for the Traveling Salesman Problem,” International Journal of Intelligent Systems, vol. 32, no. 8, pp. 862–876, 2017.
- M. Bereta, W. Pedrycz, and M. Reformat, “Analysis and design of rank-based classifiers,” Expert Systems with Applications, vol. 40, no. 8, pp. 3256–3265, 2013.
- J. Medina, “Minimal solutions of generalized fuzzy relational equations: clarifications and corrections towards a more flexible setting,” International Journal of Approximate Reasoning, vol. 84, pp. 33–38, 2017.
- M. Bereta, P. Karczmarek, W. Pedrycz, and M. Reformat, “Local descriptors in application to the aging problem in face recognition,” Pattern Recognition, vol. 46, no. 10, pp. 2634–2646, 2013.
- P. Karczmarek, W. Pedrycz, M. Reformat, and E. Akhoundi, “A study in facial regions saliency: A fuzzy measure approach,” Soft Computing, vol. 18, no. 2, pp. 379–391, 2014.
- N. Ghadimi, “A new hybrid algorithm based on optimal fuzzy controller in multimachine power system,” Complexity, vol. 21, no. 1, pp. 78–93, 2015.
- A. R. Yildiz, “A new hybrid particle swarm optimization approach for structural design optimization in the automotive industry,” Proceedings of the Institution of Mechanical Engineers, Part D: Journal of Automobile Engineering, vol. 226, no. 10, pp. 1340–1351, 2012.
- A. Azadeh, N. Pourmohammad Zia, M. Saberi et al., “A trust-based performance measurement modeling using t-norm and t-conorm operators,” Applied Soft Computing, vol. 30, pp. 491–500, 2015.
- P. Julián-Iranzo, J. Medina, and M. Ojeda-Aciego, “On reductants in the framework of multi-adjoint logic programming,” Fuzzy Sets and Systems, vol. 317, pp. 27–43, 2017.
- J. H. Kim, K. Wong, G. Athanasopoulos, and S. Liu, “Beyond point forecasting: Evaluation of alternative prediction intervals for tourist arrivals,” International Journal of Forecasting, vol. 27, no. 3, pp. 887–901, 2011.
- S. Rai and K. Wong, “The use of interactive simulations to affect driving behaviour,” in Proceedings of the 3rd Annual International Conference on Computer Games Multimedia and Allied Technologies (CGAT), Prakash. and E., Eds., pp. 51–57, Global Science & Technology Forum, Singapore, 2010.
- M. Tian, X. Gao, and C. Dai, “Differential evolution with improved individual-based parameter setting and selection strategy,” Applied Soft Computing, vol. 56, pp. 286–297, 2017.
- H.-T. Ouyang, “Multi-objective optimization of typhoon inundation forecast models with cross-site structures for a water-level gauging network by integrating ARMAX with a genetic algorithm,” Natural Hazards and Earth System Sciences, vol. 16, no. 8, pp. 1897–1909, 2016.
- K. Mahesh, P. Nallagownden, and I. Elamvazuthi, “Advanced Pareto front non-dominated sorting multi-objective particle swarm optimization for optimal placement and sizing of distributed generation,” Energies, vol. 9, no. 12, article no. 982, 2016.
- Y. Yuan, H. Xu, B. Wang, and X. Yao, “A New Dominance Relation-Based Evolutionary Algorithm for Many-Objective Optimization,” IEEE Transactions on Evolutionary Computation, vol. 20, no. 1, pp. 16–37, 2016.
- S. M. Islam, S. Das, S. Ghosh, S. Roy, and P. N. Suganthan, “An adaptive differential evolution algorithm with novel mutation and crossover strategies for global numerical optimization,” IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, vol. 42, no. 2, pp. 482–500, 2012.
- S. Mirjalili, S. M. Mirjalili, and A. Hatamlou, “Multi-verse optimizer: a nature-inspired algorithm for global optimization,” Neural Computing and Applications, vol. 27, pp. 495–513, 2016.
- J.-Y. Shi, L. Chen, and W.-W. Cui, “A new hybrid fault diagnostic method for combining dependency matrix diagnosis and fuzzy diagnosis based on an enhanced inference operator,” Circuits, Systems and Signal Processing, vol. 35, no. 1, pp. 1–28, 2016.
- Y. Cui, J. Shi, and Z. Wang, “An analytical model of electronic fault diagnosis on extension of the dependency theory,” Reliability Engineering & System Safety, vol. 133, pp. 192–202, 2015.
Copyright © 2018 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.