Content deleted Content added
→External links: Inactive link (IlliGAL) removed - Link (ASQ) corrected |
Link suggestions feature: 3 links added. Tags: Visual edit Mobile edit Mobile web edit Newcomer task Suggested: add links |
||
(4 intermediate revisions by 2 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 control==
Line 6:
The QC procedure to be designed or optimized can be formulated as:
:<math>Q_1 ( n_1,\mathbf{ X_1} ) \# Q_2 ( n_2,\mathbf{ X_2} ) \# ... \# Q_q (n_q,\mathbf{ X_q} )
where
Each statistical decision rule is evaluated by calculating the respective statistic of the measured quality characteristic of the sample. 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]], the [[mean]], and the [[standard deviation]] of the values 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.
Line 18:
==Quality control and genetic algorithms==
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.
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.
|