Quality control and genetic algorithms: Difference between revisions

Revision as of 02:26, 3 June 2007

Latest revision as of 13:35, 13 June 2025

(89 intermediate revisions by 26 users not shown)

Line 1:

The combination of '''quality control and genetic algorithms''' led to novel solutions of complex [[quality control]] design and [[Optimization (mathematics)|optimization]] problems. Quality is the degree to which a set of inherent characteristics of an entity fulfils a need or expectation that is stated, general implied or obligatory.<ref>Hoyle D. ISO 9000 quality systems handbook. Butterworth-Heineman 2001;p.654</ref> [[ISO 9000]] defines [[quality control]] as "A part of [[quality management]] focused on fulfilling quality requirements".<ref>ISO 9000:2005, Clause 3.2.10</ref> [[Genetic algorithms]] are search algorithms, based on the mechanics of natural selection and natural genetics.<ref>Goldberg DE. Genetic algorithms in search, optimization and machine learning. Addison-Wesley 1989; p.1.</ref>

{{Cleanup|date=June 2007}}

==Quality control==

Alternative [[quality control]]<ref>Duncan AJ. Quality control and industrial statistics. Irwin 1986;pp.1-1123.</ref> (QC) procedures can be applied onto a process to [[Statistical hypothesis testing|test]] statistically the [[null hypothesis]], that the process conforms to the quality specifications and consequently is in control, against the alternative, that the process is out of control. When a true [[null hypothesis]] is rejected, a statistical type I error is committed. We have then a false rejection of a run of the process . The probability of a type I error is called probability forof false rejection. When a false null hypothesis is accepted, a statistical type II error is committed. We fail then to detect a significant change in the distributionprobability density function of errora inquality characteristic of the process. The probability forof rejection of a false [[null hypothesis]] isequals calledthe probability for errorof detection.<br />of the nonconformity of the process to the quality specifications.

The QC procedure to be designed or optimized can be formulated as :<br /> <br />

''Q₁(n₁,'''''X₁''''')# Q₂(n₂'','''X₂''') ''#...# Q_q(n_q,'''''X_q''''')'' (1)<br /> <br />

The QC procedure to be designed or optimized can be formulated as :<br /> <br />

where ''Q_i(n_i,'''''X_i''''')'' denotes a statistical decision rule, ''n_i'' denotes the size of the sample '''S_i''', that is the number of the measurements the rule is applied upon, and '''X_i''' denotes the vector of the rule specific parameters, including the decision limits. Each symbol ''#'' denotes either the Boolean operator AND or the operator OR. Obviously, for ''#'' denoting AND, and for ''n₁ < n₂ <...< n_q'', that is for '''S₁''' <math>\subset</math> '''S₂''' <math>\subset</math> ....<math>\subset</math> '''S_q''', the (1) denotes a ''q''-sampling QC procedure.<br />

Each statistical decision rule is evaluated by calculating the respective statistic of the sample of the measurements. Then, if the statistic is out of the interval between the decision limits, the decision rule is considered to be true. Many statistics can be used, including the following: a single value of the sample, the [[range]] of the sample, the [[mean]] of the sample, the [[standard deviation]] of the sample, the cumulative sum, the smoothed mean, and the smoothed [[standard deviation]]. Finally, the QC procedure is evaluated as a [[Boolean]] proposition. If it is true, then the [[null hypothesis]] is considered to be false, the process is considered to be out of control, and the run is rejected.<br />

:<math>Q_1 ( n_1,\mathbf{ X_1} ) \# Q_2 ( n_2,\mathbf{ X_2} ) \# ... \# Q_q (n_q,\mathbf{ X_q} )\;</math> (1)

A QC procedure is considered to be optimum when it minimizes (or maximizes) a context specific objective function. The objective function depends on the probabilities for error detection and for false rejection. The probabilities for error detection and for false rejection depend on the parameters of the QC procedure (1) and on the [[probability density function]] of the error in the process.

=Genetic algorithms=

where ''Q<sub>i</submath>Q_i (n_i n_i,'''''X<sub>i\mathbf{ X_i} )\;</submath>''''')'' denotes a statistical [[decision rule]], {{math|''n_i''}} denotes the size of the sample {{math|'''S'''_''i'''''}}, that is the number of the measurementssamples the rule is applied upon, and '''X<submath>i\mathbf{ X_i}\;</submath>''' denotes the vector of the rule specific parameters, including the decision limits. Each symbol {{math|''#''}} denotes either the [[Boolean operator (Boolean algebra)|Boolean operator]] AND or the operator OR. Obviously, for {{math|''#''}} denoting AND, and for {{math|''n''₁ < ''n''₂ <...< ''n''_''q''''}}, that is for {{math|'''S'''₁ ⊂ ''' <math>\subset</math> S'''S₂''' <math>\subset</math>⊂ ....<math>\subset</math> ⊂ '''S'''_''q'''''}}, the (1) denotes a {{math|''q''}}-sampling QC procedure.<br />

In general, we can not use algebraic methods to optimize the QC procedures. Usage of enumerative methods would be very tedious, especially with multi-rule procedures, as the number of the points of the parameter space to be searched grows exponentially with the number of the parameters to be optimized. [[Optimization]] methods based on the [[genetic algorithms]] (GAs) offer an appealing alternative as they are robust search [[algorithms]], that do not require knowledge of the objective function and search through large spaces quickly. GAs have been derived from the processes of the [[molecular biology]] of the [[gene]] and the [[evolution]] of life. Their operators, cross-over, mutation, and reproduction, are isomorphic with the synonymous biological processes. GAs have been used to solve a variety of complex optimization problems. Furthermore, the complexity of the design process of novel QC procedures is obviously greater than the complexity of the optimization of predefined ones. The classifier systems and the [[genetic programming]] paradigm have shown us that GAs can be used for tasks as complex as the program induction.<br />

In fact, since 1993, GAs have been successfully used to optimize and to design novel QC procedures, as it is described in (a), (b), and (c).<br />

Each statistical decision rule is evaluated by calculating the respective statistic of the samplemeasured quality characteristic of the measurementssample. Then, if the statistic is out of the interval between the decision limits, the decision rule is considered to be true. Many statistics can be used, including the following: a single value of the variable of a sample, the [[range (statistics)|range]] of the sample, the [[mean]], of the sample,and the [[standard deviation]] of the samplevalues of the variable of the samples, the cumulative sum, the smoothed mean, and the smoothed [[standard deviation]]. Finally, the QC procedure is evaluated as a [[Boolean]] proposition. If it is true, then the [[null hypothesis]] is considered to be false, the process is considered to be out of control, and the run is rejected.<br />

<br />

=References=

A QC[[quality control]] procedure is considered to be optimum when it minimizes (or maximizes) a context specific objective function. The objective function depends on the probabilities for errorof detection andof forthe falsenonconformity rejection.of Thethe probabilities for error detectionprocess and forof false rejection. These probabilities depend on the parameters of the QC[[quality control]] procedure (1) and on the probability density functions (see [[probability density function]]) of the errormonitored invariables of the process.

(a) Hatjimihail AT. Genetic algorithms based design and optimization of statistical quality control procedures. Clin Chem 1993;39:1972-8.[http://www.clinchem.org/cgi/reprint/39/9/1972]<br />

(b) Hatjimihail AT, Hatjimihail TT. Design of statistical quality control procedures using genetic algorithms. In LJ Eshelman (ed): Proceedings of the Sixth International Conference on Genetic Algorithms. San Francisco: Morgan Kauffman, 1995:551-7.<br />

==Genetic algorithms= =

(c) Hatjimihail AT, Hatjimihail TT. Design of statistical quality control procedures using genetic algorithms [HCSL Technical Report No II]. Drama: Hellenic Complex Systems Laboratory, 1994. [http://users.otenet.gr/~daidalos/hcsl/hcsltr03.pdf]<br />

In[[Genetic generalalgorithms]]<ref>Holland, weJH. canAdaptation notin usenatural algebraicand methodsartificial to optimize the QC proceduressystems. UsageThe University of enumerativeMichigan methodsPress would1975;pp.1-228.</ref><ref>Goldberg beDE. veryGenetic tedious,algorithms especiallyin with multi-rule proceduressearch, asoptimization theand numbermachine oflearning. theAddison-Wesley points1989; ofpp.1-412.</ref><ref>Mitchell theM. parameterAn spaceIntroduction to be searched grows exponentially with the number of the parameters to be optimized. [[Optimization]] methods based on the [[genetic algorithms]]. (GAs)The offerMIT anPress appealing alternative as they1998;pp.1-221.</ref> are robust search [[algorithms]], that do not require [[knowledge]] of the objective function to be optimized and search through large spaces quickly. GAs[[Genetic algorithms]] have been derived from the processes of the [[molecular biology]] of the [[gene]] and the [[evolution]] of life. Their operators, cross-over, [[mutation]], and [[reproduction]], are [[isomorphic]] with the synonymous biological processes. GAs[[Genetic algorithms]] have been used to solve a variety of complex [[Optimization (mathematics)|optimization]] problems. Furthermore,Additionally the complexity of the design process of novel QC procedures is obviously greater than the complexity of the optimization of predefined ones. The classifier systems and the [[genetic programming]] [[paradigm]] have shown us that GAs[[genetic algorithms]] can be used for tasks as complex as the program induction.<br />

=External references=

Hellenic Complex Systems Laboratory [http://www.hcsl.com]<br />

==Quality control and genetic algorithms==

=See also=

In general, we can not use algebraic methods to optimize the [[quality control]] procedures. Usage of [[enumerative]] methods would be very tedious, especially with multi-rule procedures, as the number of the points of the [[parameter space]] to be searched grows exponentially with the number of the parameters to be optimized. [[Optimization (mathematics)|Optimization]] methods based on [[genetic algorithms]] offer an appealing alternative.

[[Quality control]]<br />

[[Genetic algorithm]]<br />

Furthermore, the complexity of the design process of novel [[quality control]] procedures is obviously greater than the complexity of the [[Optimization (mathematics)|optimization]] of predefined ones.

[[Optimization]]

In fact, since 1993, [[genetic algorithms]] have been used successfully to optimize and to design novel [[quality control]] procedures.<ref> Hatjimihail AT. Genetic algorithms based design and [[Optimization (mathematics)|optimization]] of statistical quality control procedures. [[Clin Chem]] 1993;39:1972-8. [http://www.clinchem.org/cgi/reprint/39/9/1972]</ref><ref>Hatjimihail AT, Hatjimihail TT. Design of statistical quality control procedures using genetic algorithms. In LJ Eshelman (ed): Proceedings of the Sixth International Conference on Genetic Algorithms. [[San Francisco]]: [[Morgan Kaufmann]] 1995;551-7.</ref><ref>He D, Grigoryan A. Joint statistical design of double sampling x and s charts. European Journal of Operational Research 2006;168:122-142.</ref>

==See also==

*[[Quality control]]<br />

*[[Genetic algorithm]]<br />

*[[Optimization (mathematics)]]

==References==

{{reflist}}

==External referenceslinks==

* [https://asq.org American Society for Quality (ASQ)]

* [https://www.hcsl.com Hellenic Complex Systems Laboratory (HCSL)]

[[Category:Statistical process control]]

[[Category:Genetic algorithms]]