Scientific Research

An Academic Publisher

**Applying GA and Fuzzy Logic to Breakdown Diagnosis for Spinning Process** ()

Share and Cite:

*Intelligent Information Management*,

**9**, 21-38. doi: 10.4236/iim.2017.91002.

1. Introduction

It is crucial for a manufacturing process to be of an intelligent diagnosis system to help effectively find out the occurred problems and eliminate them in no time when breakdowns occur. However, nowadays the inspecting & tracing process for the breakdowns causes during producing product in manufacturing industry still heavily depends on the expertise of an experienced technician. In general a junior inspector is lacking in the knowledge or the experience needed for tracing out break down causes from the occurred problems. Results of inspection and diagnosis are exclusively influenced with mental and physical conditions of an inspector. It is not only time-consuming but also economically infeasible for an enterprise to retrain a new operator to expert at the specific technical knowledge of engineering, once the trained operator leaves the job. For the sake to help solve the above-mentioned problems, an intelligent diagnosis system is developed by using fuzzy logic and genetic algorithm (GA) in this study.

A good diagnosis system should have the capability to help find the possible causes incurring the defects of product. Fuzzy sets theory is a handy tool for expert information formalization while simulating cause-effect connections in technical and medical diagnostic problems [1] [2] . The model of a diagnostic object, as a rule is built on the basis of compositional Zadeh rule of inference which connects input and output variables of an object (causes and effects) using fuzzy relation matrix [3] . The problem of diagnosis can be formulated in the form of the direct and inverse fuzzy logical inference.

The direct logical inference suggests finding diagnoses (output variables or effects) according to observable internal parameters of the object state (input variables or causes). At present, the majority of fuzzy logic applications to the diagnosis problems adopt the direct logical inference [4] [5] [6] [7] . Several diagnosis systems have been developed to trace breakdowns occurred during manufacturing. Xu et al. [4] treated vibration signals of machinery in unsteady operating conditions by using instantaneous power spectrum (IPS) and genetic programming (GP), generating excellent symptom parameters GP-SP for failure diagnosis, and failure of machinery in unsteady operating conditions is diagnosed. Chen et al. [5] traced multi-fault state for plant machinery using wavelet analysis, genetic programming (GP), and possibility theory. The wavelet analysis is used to extract feature spectra of multi-fault state from measured vibration signal for the diagnosis. Hsu et al. [6] developed a diagnosis system, which is based on fuzzy reasoning to monitor the performance of a discrete manufacturing process and to justify the possible causes.

In the case of inverse logical inference some renewal of causes takes place (of the object state parameters) according to observable effects (symptoms). The inverse logical inference is used much less due to the lack of effective algorithms solving fuzzy logical equation system. It is required to develop a more effective approach to finding solution to inverse fuzzy logic problem during diagnosing breakdown causes. Although the effective algorithm for solving the inverse fuzzy logic problem has been researched [8] [9] [10] and reported in many studies [1] [2] [4] [5] [11] [12] [13] , the proposed methods need proceeding with complicate compare procedures. In order to solve the above-mentioned problems, in this study, the search for the solution to fuzzy logical equation is of an optimization problem solved by genetic algorithm (GA) [14] . We present a GA-based approach to directly find the intervals of solution to the inverse fuzzy inference problem. Moreover an effective search algorithm based on fuzzy reasoning is applied to narrow down search range for the possible breakdown causes. Through the assistance of the developed diagnosis system, an operator can more easily and effectively find various possible breakdown causes by judging from the observed symptoms during manufacturing process. Thus, the manufacturing efficiency can be improved dramatically because the occurred breakdowns can be eliminated in no time based on the problem-incurred causes being effectively traced out.

2. Fuzzy Logical Equation

Let the relationship between symptoms and causes in a diagnosis process be represented as r_{ij}. Thus, the relationship between cause i and symptom j in a diagnosis system can thus be illustrated as that between i and j in an diagnosis situation when a relationship exists between breakdown cause i and symptom j, the r_{ij} is shown as 1; otherwise it is 0. Assume that matrix R is composed of elements r_{ij} of size m × n, matrix A is a row matrix consisting of m elements, and matrix B is a row matrix consisting of n elements, respectively. The relationship between causes and symptoms in a diagnosis system can thus be shown as the following.

$A\circ R=B$ (1)

where

$R=\left(\begin{array}{cccc}{r}_{11}& {r}_{12}& \cdots & {r}_{1n}\\ {r}_{21}& {r}_{22}& \cdots & {r}_{2n}\\ \cdots & \cdots & \cdots & \cdots \\ {r}_{m1}& {r}_{m2}& \cdots & {r}_{mn}\end{array}\right)$

$A=\left({a}_{1}{a}_{2}\cdots {a}_{m}\right)$

$B=\left({b}_{1}{b}_{2}\cdots {b}_{n}\right).$

Calculated result from Equation (1) by max-min composition (Zadeh and Kacprzyk, 1992) yields

$\underset{i}{V}\left({a}_{i}\Lambda {r}_{ij}\right)={b}_{j}$ (2)

where V: max, L: min, $i=1,2,\cdots ,m$ , and $j=1,2,\cdots ,n$ .

The diagnostic procedure seems quite simple using given matrix A and matrix R to find the solution of matrix B because there exists only one specific solution. Yet using matrix B and R to find matrix A, which can fit the requirement of Equation (1), will be rather more sophisticated because more than one solution exists. Such kind of vague relations existing between breakdown causes and symptoms are called fuzzy relations. A fuzzy set, defined originally by Zadeh [15] , is an extension of a crisp set. Crisp sets allow only full membership or no membership at all, whereas fuzzy sets [11] [12] [13] [16] [17] allow partial membership. The diagnostic procedure, usually proceeding with given matrices R and B to find the solution of matrix A that fits the requirements of Equation (1), is an inverse problem of fuzzy relation equation. If the solution of matrix A can be found, then the breakdown cause is obtained.

3. Solutions to the Inverse Problems

Assuming that matrices A, B, and R in Equation (1) are all fuzzy set [18] [19] , to find the solution of matrix A in Equation (1) from given matrices B and R is an inverse problem of a fuzzy relational equation. For instance, when m = n = 1, the solution, represented as a*, of the inverse problem of b = a L r can be shown as

$\{\begin{array}{l}{a}^{*}=b\begin{array}{c}\text{if}\begin{array}{c}\text{}br\end{array}\end{array}\hfill \\ {a}^{*}=\left[b,1\right]\begin{array}{c}\text{if}\begin{array}{c}b=r\end{array}\end{array}\hfill \\ {a}^{*}=\varphi \text{}\begin{array}{c}\text{if}\begin{array}{c}br\end{array}\end{array}\hfill \end{array}$ (3)

Relationships between b, r, and a can be illustrated as in Figure 1, from which we can conclude that when b < r and b = r, it is true for a = b and a = [b, 1] = [r, 1] respectively. But when b > r because there is no a, the solution is f. In accordance with the magnitudes of b and r, there exist three kinds of solutions (i.e., point, set, and f). From Figure 1, we can conclude that a solution exists for b = a L r unless the magnitude of r is less than that of b.

Finding of fuzzy set A amounts to the solution of the fuzzy logical Equations system:

$\begin{array}{l}{b}_{1}=\left({a}_{1}\Lambda {r}_{11}\right)V\left({a}_{2}\Lambda {r}_{21}\right)\cdots V\left({a}_{m}\Lambda {r}_{m1}\right)\\ {b}_{2}=\left({a}_{1}\Lambda {r}_{12}\right)V\left({a}_{2}\Lambda {r}_{22}\right)\cdots V\left({a}_{m}\Lambda {r}_{m2}\right)\\ \text{}\cdots \text{}\cdots \text{}\cdots \text{}\cdots \\ {b}_{n}=\left({a}_{1}\Lambda {r}_{1n}\right)V\left({a}_{2}\Lambda {r}_{2n}\right)\cdots V\left({a}_{m}\Lambda {r}_{mn}\right)\end{array}$ (4)

which is derived from Equation (2). The solution to the problem of fuzzy logical equations (i.e., Equation 2) is formulated in this way. Vector $a=\left({a}_{1},{a}_{2},\cdots ,{a}_{n}\right)$ , which satisfies limitations of ${a}_{i}\in \left[0,1\right],\text{}i=1,2,\cdots ,m$ , should be found and provides the least distance between expert and analytical measures of effects significances, that is between the left and the right parts of Equation (2).

Minimizing

$\underset{j=1}{\overset{n}{\sum}}{\left({b}_{j}-\underset{i}{\vee}\left({a}_{i}\wedge {r}_{ij}\right)\right)}^{2}}.$ (5)

In general, Equation (2) can have no solitary solution but a set of them. Therefore, according to Equation (5), a form of intervals can be acquired as the solution to the fuzzy logical equations system and illustrated as follows.

Figure 1. Graph of $b=a\Lambda r$ .

${a}_{i}=[{a}_{i}^{1},\text{}{a}_{i}^{u}]\subset \left[0,1\right],\text{}i=1,2,\cdots ,m,$ (6)

where ${a}_{i}^{1}\left({a}_{i}^{u}\right)$ is the low (upper) boundary of cause ${a}_{i}$ significance measure.

Formation of intervals ${a}_{i}\left(\text{i}\text{.e}.,\left[{a}_{i}^{1},{a}_{i}^{u}\right]\right)$ is done by way of multiple optimization problem solution to Equation (5) and it begins with the search for the null solution of it.

The null solution to optimization problem in Equation (5) is illustrated as

${a}^{\left(0\right)}=\left({a}_{1}^{\left(0\right)},{a}_{2}^{\left(0\right)},\cdots ,{a}_{n}^{\left(0\right)}\right)$ , where ${a}_{i}^{\left(0\right)}\in \left[{a}_{i}^{1},{a}_{i}^{u}\right],\text{}i=1,2,\cdots ,m$ . The upper boun-

dary $\left({\text{a}}_{i}^{u}\right)$ is found in range $\left[{a}_{i}^{\left(0\right)},1\right]$ and the low $\left({a}_{i}^{1}\right)$ in range $\left[0,{a}_{i}^{\left(0\right)}\right]$ .

Let ${a}^{\left(k\right)}=\left({a}_{1}^{\left(k\right)},{a}_{2}^{\left(k\right)},\cdots ,{a}_{n}^{\left(k\right)}\right)$ be some kth solution of optimization problem in

Equation (5). While searching for upper boundaries $\left({a}_{i}^{u}\right)$ it is suggested that

${a}_{i}^{\left(k\right)}\ge {a}_{i}^{\left(k-1\right)}$ , and while searching for low boundaries $\left({a}_{i}^{1}\right)$ it is suggested that

${a}_{i}^{\left(k\right)}\le {a}_{i}{}^{\left(k-1\right)}$ . It is shown in the Figure 2 where the arrows correspond to direction of the search.

The upper and low boundary can be found as the following steps.

1) Randomly find an optimal solution (i.e., ${a}^{\left(0\right)}$ ) based on Equation (5).

2) Search dynamics of upper solutions boundaries (i.e., ${a}_{i}^{\left(k\right)}\ge {a}_{i}^{\left(k-1\right)}$ ).

{If ${a}^{\left(k\right)}\ne {a}^{\left(k-1\right)}$ , then ${a}_{i}^{u}\left({a}_{i}\right)={a}_{i}^{\left(k\right)},\text{}i=1,2,\cdots ,m,\text{}k=1,2,\cdots ,p$ .

Else if ${a}^{\left(k\right)}={a}^{\left(k-1\right)}$ , then the search is stopped.}

3) Search dynamics of low solutions boundaries (i.e., ${a}_{i}^{\left(k\right)}\le {a}_{i}{}^{\left(k-1\right)}$ ).

{If ${a}^{\left(k\right)}\ne {a}^{\left(k-1\right)}$ , then ${a}_{i}^{1}\left({a}_{i}\right)={a}_{i}^{\left(k\right)}\text{,}i=1,2,\cdots ,m,\text{}k=1,2,\cdots ,p$ .

Else if ${a}^{\left(k\right)}={a}^{\left(k-1\right)}$ , then the search is stopped.}

4. Developing Search Mechanism

To solve a problem, the GA randomly generates a set of solutions for the first generation. Each solution is called a chromosome that is usually in the form of a binary string. According to a fitness function, a fitness value is assigned to each solution. The fitness values of these initial solutions may be poor; however, they will rise as better solutions survive in the next generation. A new generation is

(a)(b)

Figure 2. Search for upper (a) and low (b) boundary of the interval.

produced through the following three basic operations [14] [20] .

1) Randomly generate an initial solution set (population) of N strings and evaluate each solution by fitness function.

2) If the termination condition does not meet, do

Repeat {Select parents for crossover.

Generate offspring.

Mutate some of the numbers

Merge mutants and offspring into population.

Cull some members of the population.}

3) Stop and return the best fitted solution.

4.1. Encoding and Decoding A Chromosome

In order to apply GAs to our problem, we firstly need to encode the elements of matrix A as a binary string. The domain of variable a_{i} is
$\left[{d}_{i}^{1},{d}_{i}^{u}\right]$ and the required precision is dependent on the size of encoded-bit. The precision requirement implies that the range of domain of each variable should be divided into at least
$\left({d}_{i}^{u}-{d}_{i}^{1}\right)/\left({2}^{n}-1\right)$ size ranges. The required bits (denoted with n) for a variable is calculated as follows and the mapping from a binary string to a real number for variable a_{i} is straightly forward and completed as follows.

${a}_{i}={d}_{i}^{1}+{s}_{i}\left({d}_{i}^{u}-{d}_{i}^{1}\right)/\left({2}^{n}-1\right)$ (7)

where s_{i} is an integer between
$0\text{}\text{-}{2}^{n}$ and is called a searching index.

After finding an appropriate s_{i} to put into Equation (7) to have an a_{i}, which can make fitness function to come out with a fitness value approaching to “1”, the desired parameters can thus be obtained. Combine all of the parameters as a string to be an index vector, i.e.
$A=\left({a}_{1},{a}_{2},\cdots ,{a}_{m}\right)$ , and unite all of the encoder of each searching index as a bit string to construct a chromosome shown as below.

$P={p}_{11}\cdots {p}_{1j}{p}_{21}\cdots {p}_{2j}\cdots {p}_{i1}\cdots {p}_{ij}\text{}{p}_{ij}\in \left\{0,1\right\};\text{}i=1,2,\cdots ,m;\text{}j=1,2,\cdots ,n;$ (8)

Suppose that each a_{i} was encoded by n bits and there was m parameters then the length of Equation (8) should be an N-bit (N = m × n) string. During each generation, all the searching index sis of the generated chromosome can be obtained by Equation (9).

${s}_{i}={p}_{i1}\times {2}^{n-1}+{p}_{i2}\times {2}^{n-2}+\cdots +{p}_{in}\times {2}^{n-n}i=1,2,\cdots ,m;$ (9)

Finally the real number for variable a_{i} can thus be obtained from Equation (7) and Equation (9). The flow chart for the encoding and decoding of the parameter is illustrated in Figure 3.

4.2. Chromosome

A main difference between genetic algorithms and more traditional optimization search algorithms is that genetic algorithms work with a coding of the parameter set and not the parameters themselves [14] . Thus, before any type of genetic search can be performed, a coding scheme must be determined to represent the parameters in the problem in hand. In finding the solution (i.e., matrix A) of a fuzzy logical inference problem, a coding scheme for the elements of matrix A must be determined and considered in advance. Suppose that matrix A is a row one of n elements. A multi-parameter coding, consisting of n sub-strings, is required to code each of the n variables (i.e., elements) into a single string. In this study, a binary coding is utilized and the bit-sizes of the encoding for the elements of Matrix A are as follows. The bit-size of each element of matrix A is set to 7 bits. Thus a chromosome string consisting of N (=n × 7) bits can be formed and its layout is shown in Figure 4.

4.3. Fitness Function

The target is to minimize the distance between the observed values (i.e., b_{j}) and the calculated ones (i.e.,
$\underset{i}{V}\left({a}_{i}\Lambda {r}_{ij}\right)$ ) shown as Equation (5). The fitness of GA used in search mechanism can thus be set as Equation (10). This approach will allow the GA to find the minimum difference between them when the fitness function value is maximum (i.e., approaches to 1).

$\text{Fitness}=1-{\displaystyle \underset{j=1}{\overset{n}{\sum}}{\left({b}_{j}-\underset{i}{\vee}\left({a}_{i}\wedge {r}_{i}{}_{j}\right)\right)}^{2}}$ (10)

where V: max, L: min, $i=1,2,\cdots ,m$ , and $j=1,2,\cdots ,n$ .

Figure 3. Flow chart for the encoding and decoding of a variable with 4-bit precision.

Figure 4. Layout of chromosome.

4.4. Make the Diagnostic Procedure More Effective

In order to develop a more effective diagnosis system, which is capable of tracing the possible breakdown causes from the categories of defects and providing an immediate response, it is necessary to sketch an effective searching algorithm for the diagnosis procedure. The methodology used in research [21] is employed in the study. Firstly, we define the following symbols:

${A}_{i}=\left\{{a}_{1},{a}_{2},\cdots ,{a}_{m}\right\}=\text{causeset}$

${B}_{j}=\left\{{b}_{1},{b}_{2},\cdots ,{b}_{n}\right\}=\text{symptomset}$

${R}_{ij}={\left({r}_{ij}\right)}_{\text{mxn}}=\text{fuzzy}$ relation matrix of size m × n between a and b

where

${a}_{1}-{a}_{m}$ : m kinds of breakdown causes,

${b}_{1}-{b}_{n}$ : n kinds of symptoms, and

${r}_{ij}$ : the fuzzy truth value between the ith kind of cause and the jth kind of symptom.

The fuzzy truth values of r_{ij}s are acquired empirically from experts of engineering using the following linguistic values [20] [22] (e.g., completely true, very true, true, rather true, rather rather true, and unknown) of the linguistic variable “truth.” Their meaning is defined as follows.

1) completely true: Once a_{i} occurs then b_{j} appears.

2) very true: When a_{i} occurs, b_{j} will appear very definitely.

3) true: When a_{i} occurs, b_{j} will appear very probably.

4) rather true: When a_{i} occurs, b_{j} will appear probably.

5) rather rather true: When a_{i} occurs, b_{j} will appear seldom.

6) unknown: When a_{i} occurs, b_{j} will never appear.

Generally speaking, in a diagnosis problem, the symptoms can be divided into two kinds of categories, the positive symptom set (J_{1}), consisting of those symptoms that have been observed by the operator, and the negative one (J_{2}), consisting of those symptoms that have not yet been observed by the operator. When only certain symptoms have been observed by the operator, the diagnosis process can proceed. It is impossible for all the symptoms of the system to appear at one time, so that J_{1} ¹ f and J_{2} ¹ f.

Actually during tracing a certain kind of breakdown cause through the observed symptoms, the reliability of diagnostic results should be very high as long as all possible symptoms for this kind of breakdown are all observed [19] . However, if there are many other symptoms (not the observed ones) that should have appeared but have not yet done so, then the reliability of diagnostic results of this kind of breakdown cause will be very low.

We can thus conclude that the diagnostic range can be narrowed effectively by neglecting those breakdown causes seldom noticed a_{i}. For instance, breakdown causes that are in accordance with the circumstance of

$\underset{j\in {J}_{2}}{V}{R}_{ij}<\begin{array}{ccc}\text{rather}& \text{rather}& \text{true}\end{array}$

should firstly be investigated. That is, the searching range of the diagnosis can be narrowed from $i\in I\left(=\left\{i|i=1,2,\cdots ,m\right\}\right)$ down to

$i\in {I}_{1}\left(=\left\{i|\underset{j\in {J}_{2}}{V}{R}_{ij}<\begin{array}{ccc}\text{rather}& \text{rather}& \text{true}\end{array}\right\}\right)$ .

A relationship should occur between the breakdown causes searched a_{i} and the observed symptoms b_{j}. In other words, the condition of

$\underset{j\in {J}_{1}}{V}{R}_{ij}>\text{unknown}$

should be true. Therefore the searching range of diagnosis I_{1} can be reconstructed as

${I}_{1}=\left\{i|\underset{j\in {J}_{2}}{V}{R}_{ij}<\begin{array}{ccc}\text{rather}& \text{rather}& \text{true}\end{array},\u3000\underset{j\in {J}_{1}}{V}{R}_{ij}>\text{unknown}\right\}$ .

In a practical diagnostic procedure in the real world, the members in I_{1} are much fewer than those in cause set I (consisting of m members). Thus, an efficient searching method can be obtained.

Nevertheless, in a practical diagnostic procedure, while searching for the members of the set searching range I_{1}, the circumstance of I_{1} = f can happen. Then a wider searching range should be reset to search once again. Yet the wider the searching range is set, the less reliable the breakdown cause found through this diagnostic procedure is. In order to achieve both effectively narrowing the diagnostic searching range and specific reliability of the diagnostic result, the extension of the searching range in a diagnosis procedure should have a proper limitation. Therefore, there are three kinds of searching range selected in this study. These sets and their reliability are represented as

${I}_{1}\left(=\left\{i|\underset{j\in {J}_{2}}{V}{R}_{ij}<\begin{array}{ccc}\text{rather}& \text{rather}& \text{true}\end{array},\u3000\underset{j\in {J}_{1}}{V}{R}_{ij}>\text{unknown}\right\}\right)$ ,

which has the greatest reliability and from which the diagnostic result that is found can be regarded as the actual “cause”;

${I}_{2}\left(=\left\{i|\underset{j\in {J}_{2}}{V}{R}_{ij}<\begin{array}{cc}\text{rather}& \text{true}\end{array},\underset{j\in {J}_{1}}{V}{R}_{ij}>\text{unknown}\right\}\right)$ ,

which is less reliable than I_{1} and from which the diagnostic result that is found can be regarded as “very probable”; and

${I}_{3}\left(=\left\{i|\underset{j\in {J}_{2}}{V}{R}_{ij}<\text{true},\underset{j\in {J}_{1}}{V}{R}_{ij}>\text{unknown}\right\}\right)$ ,

which is the least reliable, and from which the diagnostic result that is found can be regarded as “probable”.

The flow chart of the system’s diagnostic procedures is illustrated in Figure 5. Finally after searching for the members of the searching ranges I_{1}, I_{2}, and I_{3} using the effective diagnostic procedure mentioned above, there probably exists the circumstance of I_{1} = I_{2} = I_{3} = f. Then the system will select five a_{i}s of greater L_{i} value as the suspected breakdown causes for further diagnosis:

${L}_{i}={\displaystyle \underset{j\in J1}{\sum}{R}_{ij}}$ (11)

where

Figure 5. Flow chart of diagnostic procedure for diagnosis system.

R_{ij}: the fuzzy truth value between the ith kind of breakdown cause and the jth kind of symptom.

J_{1}: the positive symptom set.

5. Results and Assessment of the System

5.1. System Implementation

An application of the intelligent diagnosis system to tracing the breakdown causes occurred during spinning was reported in this study. There were 6 kinds of defects that are most likely found during spinning and 20 possible occurrence causes of these defects all chosen from and referred to the reports [22] on the occurrence causes and the effects of the defects in spinning.

1) Symptom Set and Cause Set

The cause set A and the symptom set B consist of the above-mentioned 20 causes and 6 kinds of defects respectively and the elements of each of the two are illustrated as below.

SYMPTOMS

b_{1} smash

b_{2} stick-out on the edge of cone

b_{3} ribbon-shaped defects around cone’s surface

b_{4} ring-shaped defects

b_{5} spindle-shaped defects

b_{6} too much happening in yarn’s cut-off

CAUSES

a_{1} mal-set for Bobbin holder

a_{2} mal-functioned pulley tension caused by neps or cotton trash

a_{3} bobbin slipping from slot

a_{4} gap occurred between bobbin and sketch

a_{5} improper setting of skeleton

a_{6} improper yarn’s adjunction

a_{7} big gap on top of cone

a_{8} lack of yarn tension

a_{9} defects in cylinder-slot

a_{10} too big gap between bottom of bobbin and cylinder

a_{11} forward shifting during bobbin’s circulation

a_{12} un-smooth spindle-spinning

a_{13} too big gap on top of cone

a_{14} over-heavy tension pulley

a_{15} mal-positioned tension device

a_{16} mal-functioned back-forth motion

a_{17} too much yarn tension

a_{18} mal-positioned empty bobbin

a_{19} mal-positioned de-knotter

a_{20} mal-positioned plug base of bobbin

2) Fuzzy Relation Matrix

All the truth values of members of fuzzy relation matrix R are illustrated as Table 1. The fuzzy truth value of each r_{ij} in Table 1 was acquired empirically from experts of textile engineering and technical references [22] [23] on causes and effects of the yarn defects in spinning. By using the linguistic values (e.g., completely true, very true, true, rather true, rather rather true, and unknown) of the “truth” linguistic variable, the fuzzy truth value of each r_{ij} in the fuzzy relation matrix R of the diagnosis system thus can be characterized. Furthermore, for making it feasible for the computer to execute the logic operation processing, the fuzzy truth value of each linguistic value (e.g., completely true, very true, true, rather true, rather rather true, and unknown) is characterized by specific weight value (e.g., 1.0, 0.8, 0.6, 0.4, 0.2, and 0.0) respectively and is listed in Table 1, in which A-E represent 1.0, 0.8, 0.6, 0.4, and 0.2, respectively and the blank represents 0.0.

5.2. Diagnosis Example

After the operator examines the defects (breakdown causes) occurred on the yarns, “ring-shaped defects” (i.e., b_{4}) formed during winding process is found so that symptom “b_{4}” is input into the system to proceed with the diagnosis. According to the diagnosis procedure shown in Figure 4, the positive and negative symptom sets are
${J}_{1}=\left\{{b}_{4}\right\}$ ,
${J}_{2}=\left\{{b}_{1},{b}_{2},{b}_{3},{b}_{5},{b}_{6}\right\}$ respectively. Firstly, the searching range is narrowed from
$I\left(=\left\{i|i=1,2,\cdots ,20\right\}\right)$ down to

Table 1. Fuzzy relationship between causes and symptoms.

$\begin{array}{l}{I}_{1}\left(=\left\{i|\underset{j\in {J}_{2}}{V}{R}_{ij}<\begin{array}{ccc}\text{rather}& \text{rather}& \text{true}\end{array},\underset{j\in {J}_{1}}{V}{R}_{ij}>\text{unknown}\right\}\right)\\ \text{}\left(i.e.,{I}_{1}=\left\{i|\underset{j\in {J}_{2}}{V}{R}_{ij}0.2,\underset{j\in {J}_{1}}{V}{R}_{ij}0\right\}\right)\end{array}$ and

$\begin{array}{l}{I}_{2}\left(=\left\{i|\underset{j\in {J}_{2}}{V}{R}_{ij}<\begin{array}{cc}\text{rather}& \text{true}\end{array},\u3000\underset{j\in {J}_{1}}{V}{R}_{ij}>\text{unknown}\right\}\right)\\ \text{}\left(i.e.,\text{}{I}_{2}=\left\{i|\underset{j\in {J}_{2}}{V}{R}_{ij}0.4,\u3000\underset{j\in {J}_{1}}{V}{R}_{ij}0\right\}\right).\end{array}$

There is no breakdown cause a_{i}, which lives up to the I_{1} and I_{2} conditions (Lin et al., 1995). Thus the situation
$\left(i.e.,\text{}{I}_{1}={I}_{2}=\varphi \right)$ is found. Next, the searching range is more broadened up to

${I}_{3}\left(=\left\{i|\underset{j\in {J}_{2}}{V}{R}_{ij}<\text{true},\underset{j\in {J}_{1}}{V}{R}_{ij}>\text{unknown}\right\}\right)\left(i.e.,{I}_{3}=\left\{i|\underset{j\in {J}_{2}}{V}{R}_{ij}<0.6,\underset{j\in {J}_{1}}{V}{R}_{ij}>0\right\}\right)$

to investigate the possible breakdown causes. There is a suspected one (i.e., a_{15}), which regarded as “probable”, found under the searching range
${I}_{3}\left(\ne \varphi \right)$ after checking fuzzy relation matrix shown in Table 1 based on the above-set

${J}_{1}\left(=\left\{{b}_{4}\right\}\right)$ and
${J}_{2}\left(=\left\{{b}_{1},{b}_{2},{b}_{3},{b}_{5},{b}_{6}\right\}\right)$ . Following the suggestion of the “probable” breakdown cause a_{15} (i.e., mal-positioned tension device) from the system, the operator can immediately check it up. It is found nothing wrong with a_{15} after the operator’s inspection. Excluding the “probable” breakdown cause a_{15}, the system provides the operator with five suspected breakdown causes shown as follows.

SUGGEST again CHECK

${a}_{1}-{b}_{1},{b}_{3},\left|{b}_{4}\right|,{b}_{5}\text{}\left({L}_{1}=3.8,{J}_{1}=\left\{{y}_{4}\right\}\right)$

${a}_{11}-{b}_{1},{b}_{3},\left|{b}_{4}\right|,{b}_{5}\text{}\left({L}_{11}=3.8,{J}_{1}=\left\{{y}_{4}\right\}\right)$

${a}_{16}-{b}_{3},\left|{b}_{4}\right|,{b}_{6}\text{}\left({L}_{16}=1.6,{J}_{1}=\left\{{y}_{4}\right\}\right)$

${a}_{15}-{b}_{2},\left|{b}_{4}\right|,{b}_{6}\text{}\left({L}_{15}=1.4,{J}_{1}=\left\{{y}_{4}\right\}\right)$

where the symptoms with lines to both sides denote the already-recognized ones. The operator re-inspects the product defects in relation to the suspected causes and their related symptoms suggested by the system, and he/she find that there is another two more “stick-out on the edge of cone” (i.e., b_{2}) and “too much happening in yarn’s cut-off” (i.e., b_{6}). Therefore he can re-input b_{2}, b_{4} and b_{6} into the system to proceed with the further diagnosis. According to the observed symptoms, the positive and negative symptom are obtained as
${J}_{1}=\left\{{b}_{2},{b}_{4},{b}_{6}\right\}$ and
${J}_{2}=\left\{{b}_{1},{b}_{3},{b}_{5}\right\}$ respectively. Firstly, the searching range is set to

${I}_{1}\left(=\left\{i|\underset{j\in {J}_{2}}{V}{R}_{ij}<\begin{array}{ccc}\text{rather}& \text{rather}& \text{true}\end{array},\underset{j\in {J}_{1}}{V}{R}_{ij}>\text{unknown}\right\}\right)$ to investigate the po- ssible break down causes. The found diagnostic result can be regarded as the actual “cause”. There are five suspected breakdowns (i.e., a_{9}, a_{10}, a_{15}, a_{19}, a_{20}) found based on the searching range
${I}_{1}\left(\ne \varphi \right)$ after checking fuzzy relation matrix shown in Table 1 based on the above-set
${J}_{1}\left(=\left\{{b}_{2},{b}_{4},{b}_{6}\right\}\right)$ and
${J}_{2}\left(=\left\{{b}_{1},{b}_{3},{b}_{5}\right\}\right)$ . The number of possible breakdown causes are effectively reduced from 20 (i.e., a_{1}, a_{2},···, a_{20}) down to 5 (i.e., a_{9}, a_{10}, a_{15}, a_{19}, a_{20}). The obtained vectors, i.e., A and R, are as follows.

$\underset{\_}{A}=\left({a}_{9},{a}_{10},{a}_{15},{a}_{19},{a}_{20}\right),\text{}\underset{\_}{R}=\left(\begin{array}{ccc}\mathrm{0.6.}& 0& 0.4\\ 0.4& 0& 0.4\\ 0.2& 0.8& 0.4\\ 0& 0& 1\\ 0& 0& 0.6\end{array}\right)$

Let the obtained relation matrix R has the following form.

As the result of product examination the inspector find out there are three defects (i.e., symptoms) occurred, i.e., b_{2} = 1, b_{4} = 1, b_{6} = 1. As mentioned above, there is no solution for
$b=a\Lambda r$ if the magnitude of r is less than b. Therefore the values of b_{2}, b_{4}, and b_{6} are adjusted to the maximum values of the respective columns in
$\underset{\_}{R}$ matrix and shown as follows.

${b}_{2}=\mathrm{max}{r}_{i2}=0.6,\text{}{b}_{4}=\mathrm{max}{r}_{i4}=0.8,\text{}{b}_{6}=\mathrm{max}{r}_{i6}=1.0,\text{}$

where i = 9,10,15,19, and 20.

Once the vectors, i.e., $\underset{\_}{R}$ and $\underset{\_}{B}$ , are obtained, we can proceed with the 3- step method mentioned in Section 3 to search for the upper and low boundaries.

Firstly, following the three steps mentioned in Section 4, we encode the unknown occurring possibility of breakdown causes (i.e., a_{9}, a_{10}, a_{15}, a_{19}, and a_{20}) by using a binary coding method. The bit-size of each of them is set to 7 bits in this study. Thus a chromosome illustrated in Figure 4 can be formed as a 35 (=5 × 7)-bit string. The search ranges of variable a_{9}, a_{10}, a_{15}, a_{19}, and a_{20} are set to be the same as [0, 1] (i.e.,
$\left[{d}_{i}^{1},{d}_{i}^{u}\right]$ , i = 9, 10, 15, 19, and 20). Through proceeding with the search mechanism of GA based on Equations (7) and (9), we can find a solution, whose fitness approaches to 1, as the optimal one. Fitness function simulation runs with the crossover, mutation, and reproduction operations under conditions of crossover probability, mutation probability, random seed, and initial population being set to 0.3, 0.033, 0.8 and 30 respectively. Figure 6 shows the simulation graph for the best fitness and average fitness of the 50 generations. It shows that after 46^{th} generation the solution is not improved. Therefore, we choose vector (0.60, 0.00, 0.99, 0.98, 0.25), which is generated from the 50^{th} generation and has fitness = 0.9998 as the optimal solution. Therefore a null solution
${a}_{i}^{\left(0\right)}$ ^{ }is found and shown as follows.

${a}_{9}^{\left(0\right)}=0.60,\text{}{a}_{10}^{\left(0\right)}=0.00,\text{}{a}_{15}^{\left(0\right)}=0.99,\text{}{a}_{19}^{\left(0\right)}=0.98,\text{}{a}_{20}^{\left(0\right)}=0.25$

Secondly, by means of the null solution, we can search for the upper and low boundaries. Table 2 and Table 3 illustrate the searched results for the upper and low ones respectively. When search the upper boundaries, the search ranges of variable a_{9}, a_{10}, a_{15}, a_{19}, and a_{20} are set different to each other as [0.60, 1], [0, 1], [0.99, 1] [0.98, 1] and [0.25, 1] (i.e.,

$\left[{d}_{9}^{1\left(0\right)},{d}_{9}^{u\left(0\right)}\right],\left[{d}_{10}^{1\left(0\right)},{d}_{10}^{u\left(0\right)}\right],\left[{d}_{15}^{1\left(0\right)},{d}_{15}^{u\left(0\right)}\right],\left[{d}_{19}^{1\left(0\right)},{d}_{19}^{u\left(0\right)}\right]\text{and}\left[{d}_{20}^{1\left(0\right)},{d}_{20}^{u\left(0\right)}\right]$ ).

Through proceeding with the search mechanism of GA, we can find a solution, whose fitness approaches to 1, as the optimal one. An optimal solution after generations of GA search can be obtained as follows.

${a}_{9}^{\left(1\right)}=0.66,\text{}{a}_{10}^{\left(1\right)}=0.80,\text{}{a}_{15}^{\left(1\right)}=0.99,\text{}{a}_{19}^{\left(1\right)}=0.99,\text{}{a}_{20}^{\left(1\right)}=0.43$

Figure 6. Simulation results.

By narrowing down the search range step by step, the upper boundaries of
${a}_{9}^{u}$ ,
${a}_{10}^{u}$ ,
${a}_{15}^{u}$ ,
${a}_{19}^{u}$ and
${a}_{20}^{u}$ ^{ }can be acquired. Table 2 shows the searched results after five iterations. Finally, the obtained values of a_{9,} a_{10}, a_{15}, a_{19}, and a_{20} remains the same (i.e.,
${a}_{i}^{\left(6\right)}={a}_{i}^{\left(5\right)}$ ), the search is stopped.

When search the low boundaries, the search ranges of variable a_{9,} a_{10}, a_{15,} a_{19} and a_{20} are set different to each other as [0, 0.60], [0, 0], [0, 0.99], [0, 0.98], and [0, 0.25] (i.e.,
$\left[{d}_{i}^{1\left(0\right)},{d}_{i}^{u\left(0\right)}\right]$ , i = 9, 10, 15, 19, 20). Through proceeding with the search mechanism of GA, we can find a solution, whose fitness approaches to 1, as the optimal one. An optimal solution after generations of GA search can be obtained as follows.

${a}_{9}^{\left({1}^{\prime}\right)}=0.46,\text{}{a}_{10}^{\left({1}^{\prime}\right)}=0.00,\text{}{a}_{15}^{\left({1}^{\prime}\right)}=0.78,\text{}{a}_{19}^{\left({1}^{\prime}\right)}=0.70,\text{}{a}_{20}^{\left({1}^{\prime}\right)}=0.11$

By narrowing down the search range step by step, the low boundaries of
${a}_{9}^{1}$ ,
${a}_{10}^{1}$ ,
${a}_{15}^{1}$ ,
${a}_{19}^{1}$ , and
${a}_{20}^{1}$ ^{ }can be acquired. Table 3 shows the searched results after five iterations. Finally, the obtained values of a_{9}, a_{10}, a_{15}, a_{19}, and a_{20} remains the same (i.e.,
${a}_{i}^{\left({6}^{\prime}\right)}={a}_{i}^{\left({5}^{\prime}\right)}$ ), the search is stopped.

Table 2 and Table 3 shows that the solution to fuzzy logical equation can be expressed in the form of intervals

${a}_{9}=\left[0,1\right],\text{}{a}_{10}\in \left[0,1\right],\text{}{a}_{15}\in \left[0.36,1\right],\text{}{a}_{19}\in \left[0.44,1\right],\text{}{a}_{20}\in \left[0,1\right].$

The obtained solution allows making a diagnosis conclusion. The cause of the observed defects should be considered as a_{19} (i.e., mal-positioned de-knotter), because of which has a higher solution boundary than the other four. Excluding

Table 2. Genetic search for upper boundaries of the intervals.

Table 3. Genetic search for low boundaries of the intervals.

the obtained solution, system supports five a_{i}s of greater L_{i} value as the suspected breakdown causes for further diagnosis. They are illustrated as follows.

SUGGEST again CHECK

${a}_{1}-{b}_{1},{b}_{3},\left|{b}_{4}\right|,{b}_{5}\text{}\left({L}_{1}=3.8,{J}_{1}=\left\{{y}_{2},{y}_{4},{y}_{6}\right\}\right)$

${a}_{11}-{b}_{1},{b}_{3},\left|{b}_{4}\right|,{b}_{5}\text{}\left({L}_{11}=3.8,{J}_{1}=\left\{{y}_{2},{y}_{4},{y}_{6}\right\}\right)$

${a}_{8}-\left|{b}_{2}\right|,{b}_{5},{\left|{b}_{6}\right|}_{}\text{}\left({L}_{8}=2.8,{J}_{1}=\left\{{y}_{2},{y}_{4},{y}_{6}\right\}\right)$

${a}_{17}-{b}_{5},{\left|{b}_{6}\right|}_{}\text{}\left({L}_{17}=2.0,{J}_{1}=\left\{{y}_{2},{y}_{4},{y}_{6}\right\}\right)$

${a}_{10}-{b}_{1},\left|{b}_{2}\right|,{\left|{b}_{6}\right|}_{}\text{}\left({L}_{10}=1.8,{J}_{1}=\left\{{y}_{2},{y}_{4},{y}_{6}\right\}\right)$

where the symptoms with lines to both sides denote the already-recognized ones.

Through the assistance of the diagnosis system, the operator can obtain three derived suspected breakdown causes a_{9}, a_{10}, a_{15}, a_{19} and a_{20}, which have a reliability of “cause” because the searching range is I_{1}, to help him/her in troubleshooting and eliminating the breakdown. In this experimental case, after the technician for maintenance in the mill proceeding with the troubleshooting, the exact breakdown cause is confirmed to be a_{19} (i.e., mal-positioned de-knotter). From the diagnostic case illustrated as above, the accuracy of the implementation of this system is approvable. Even when the diagnostic result is not the exact break- down cause, nevertheless, the system will still provide the operator with some suspected ones for further check. This system can thus achieve the demand of providing with a solution in any circumstance during diagnosing in the real world.

6. Conclusion

The determination on the breakdown causes becomes more effective and efficient by adopting a GA-based diagnosis procedure proposed in the study. It was constructed that using the fuzzy set theory, which does not simply perform the routine calculations like those developed by the conventional programming algorithm, can be more flexible and effective to find the solution to fuzzy logical equation by genetic algorithm. The developed diagnosis model is of the nature of human capability in recognition and evaluation of uncertain linguistic description. Through the assistance of the developed diagnosis model, even a new inspector, who lacks in the expertise and experience in the spinning engineering field, can still easily find out the breakdown causes occurred during manufacturing process and then eliminate them. Furthermore, it is expected that the developed diagnosis model can be applied to other industries for the troubleshooting of machines or facilities as long as the relation matrix for the application in specific field is provided.

Conflicts of Interest

The authors declare no conflicts of interest.

[1] |
Yager, R.R. and Zadeh, L.A. (1992) An Introduction to Fuzzy Logic Applications in Intelligent Systems. Kluwer Academic Publishers, Boston.
https://doi.org/10.1007/978-1-4615-3640-6 |

[2] | Kosko, B. (1992) Neural Networks and Fuzzy Systems. Prentice Hall, NJ. |

[3] | Zadeh, L. and Kacprzyk, J. (1992) Fuzzy Logic for the Management of Uncertainty. John Wiley & Sons, Inc., NY. |

[4] |
Xu, G., Luo, Z., Li, M. and Chen, P. (2001) Mechanical Failure Diagnosis in Unsteady Operating Conditions. Chinese Journal of Mechanical Engineering, 37, 104-107. https://doi.org/10.3901/JME.2001.12.104 |

[5] | Chen, P., Taniguchi, M. and Toyota, T. (2003) Intelligent Diagnosis Method of Multi-Fault State for Plant Machinery Using Wavelet Analysis, Genetic Programming and Possibility Theory. IEEE International Conference on Robotics and Automation, 1, 610-615. |

[6] |
Hsu, H.M. and Chen, Y.K. (2001) A Fuzzy Reasoning Based Diagnosis System for X Control Charts. Journal of Intelligent Manufacturing, 12, 57-64.
https://doi.org/10.1023/A:1008903614042 |

[7] | Welstead, S.T. (1994) Neural Network and Fuzzy Logic Applications in C/C++. John Wiley & Sons, Inc, NY. |

[8] |
Liu, H.W. and Wang, G.J. (2007) Multi-Criteria Decision-Making Methods Based on Intuitionistic Fuzzy Sets. European Journal of Operational Research, 179, 220-233. https://doi.org/10.1016/j.ejor.2006.04.009 |

[9] |
Pappis, C.P. and Sugeno, M. (1985) Fuzzy Relational Equations and the Inverse Problem. Fuzzy Sets System, 15, 79-90.
https://doi.org/10.1016/0165-0114(85)90036-3 |

[10] |
Sanchez, E. (1976) Resolution of Composite Fuzzy Equation. Information and Control, 30, 38-48. https://doi.org/10.1016/S0019-9958(76)90446-0 |

[11] |
Torra, V. (2010) Hesitant Fuzzy Sets. International Journal of Intelligent Systems, 25, 529-539. https://doi.org/10.1002/int.20418 |

[12] |
Data, S., Samantra, C., Mahapatra, S.S., Mondal, G., Chakraborty, P.S. and Majumdar, G. (2013) Selection of Internet Assessment Vendor Using TOPSIS Method in Fuzzy Environment. International Journal of Business Performance and Supply Chain Modelling, 5, 1-27. https://doi.org/10.1504/IJBPSCM.2013.051645 |

[13] |
Abdullab, L. and Zulkifli, N. (2015) Integration of Fuzzy AHP and Interval Type-2 Fuzzy DEMATEL: An Application to Human Resource Management. Expert Systems with Applications, 42, 4397-4409. https://doi.org/10.1016/j.eswa.2015.01.021 |

[14] | Goldberg, D.E. (1989) Genetic Algorithms in Search, Optimization & Machine Learning. Addison-Wesley Publish Co., NY. |

[15] |
Zadeh, L.A. (1965) Fuzzy Sets. Information and Control, 8, 338-353.
https://doi.org/10.1016/S0019-9958(65)90241-X |

[16] |
Chen, S.M., Lee, I.W., Liu, H.C. and Yang, S.W. (2012) Multi-Attribute Decision Making Based on Interval-Valued Intuitionistic Fuzzy Value. Expert Systems with Applications, 39, 10343-10351. https://doi.org/10.1016/j.eswa.2012.01.027 |

[17] |
Derika, K., Khodaverdi, R., Olfat, L. and Jatarian, A. (2013) Integrated Fuzzy Multi Criteria Decision Making Method and Multi-Objective Programming Approach for Supplier Selection and Order Allocation in a Green Supply Chain. Journal of Cleaner and Production, 47, 355-367. https://doi.org/10.1016/j.jclepro.2013.02.010 |

[18] | Murayama, Y. and Ziya, S. (1990) Applying Fuzzy Theory to Breakdown Diagnosis. System and Control, 24, 719-725. |

[19] |
Zimmermann, H.-J. (1991) Fuzzy Set Theory—and Its Application. 2nd Edition, Kluwer Academic Publishers, Boston, MA.
https://doi.org/10.1007/978-94-015-7949-0 |

[20] | Gen, M. and Cheng, R. (1997) Genetic Algorithms & Engineering Design. John Wiley & Sons, Inc., NY. |

[21] |
Lin, J.J., Tsai, I.S. and Lin, C.H. (1995) An Application of Expert System and Fuzzy Logic to Intelligent Diagnosis System. Textile Research Journal, 65, 697-709.
https://doi.org/10.1177/004051759506501201 |

[22] | Lin, C.A., et al. (1990) Report on Causes and Effects of Textile Defects Occurred during Weaving and Spinning. Association of Textile Industry. |

[23] | Ormerod, A. (1983) Modern Preparation and Weaving Machinery. Butterworth & Co. Ltd., UK. |

Copyright © 2020 by authors and Scientific Research Publishing Inc.

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.