ArticleslgStudy

biology

Quality control and genetic algorithms

Quality control and genetic algorithms is a biology topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Quality control and genetic algorithms rather than just read about it. In short: The combination of quality control and genetic algorithms led to novel solutions of complex quality control design and 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.

Key takeaways

  • Quality control and genetic algorithms belongs to biology; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect Quality control and genetic algorithms to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Quality control and genetic algorithms from memory before moving on to harder problems.

Reference excerpt

The combination of quality control and genetic algorithms led to novel solutions of complex quality control design and 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. ISO 9000 defines quality control as "A part of quality management focused on fulfilling quality requirements". Genetic algorithms are search algorithms, based on the mechanics of natural selection and natural genetics.

Quality control Alternative quality control (QC) procedures can be applied to a process to 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 of 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 probability density function of a quality characteristic of the process. The probability of rejection of a false null hypothesis equals the probability of detection of the nonconformity of the process to the quality specifications. The QC procedure to be designed or optimized can be formulated as:

Q 1 ( n 1 , X 1 ) # Q 2 ( n 2 , X 2 ) # . . . # Q q ( n q , X q ) {\displaystyle Q_{1}(n_{1},\mathbf {X_{1}} )\#Q_{2}(n_{2},\mathbf {X_{2}} )\#...\#Q_{q}(n_{q},\mathbf {X_{q}} )\;} (1) where Q i ( n i , X i ) {\displaystyle Q_{i}(n_{i},\mathbf {X_{i}} )\;} denotes a statistical decision rule, ni denotes the size of the sample Si, that is the number of the samples the rule is applied upon, and X i {\displaystyle \mathbf {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 n1 < n2 <...< nq, that is for S1 ⊂ S2 ⊂ .... ⊂ Sq, the (1) denotes a q-sampling QC procedure. 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, 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. A 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 of detection of the nonconformity of the process and of false rejection. These probabilities depend on the parameters of the quality control procedure (1) and on the probability density functions (see probability density function) of the monitored variables of the process.

Genetic algorithms Genetic algorithms are robust search algorithms, that do not require knowledge of the objective function to be optimized and search through large spaces quickly. 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. Genetic algorithms have been used to solve a variety of complex optimization problems. Additionally the classifier systems and the genetic programming paradigm have shown us that genetic algorithms can be used for tasks as complex as the program induction.

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 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 of predefined ones. In fact, since 1993, genetic algorithms have been used successfully to optimize and to design novel quality control procedures.

See also Quality control Genetic algorithm Optimization (mathematics)

References

External links American Society for Quality (ASQ) Hellenic Complex Systems Laboratory (HCSL)

Worked examples

Example 1 — a first encounter with Quality control and genetic algorithms

Start with the simplest possible case. Write down what Quality control and genetic algorithms claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In biology, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Quality control and genetic algorithms before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Quality control and genetic algorithms ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Quality control and genetic algorithms

In research
Quality control and genetic algorithms appears in biology research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses Quality control and genetic algorithms in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
Quality control and genetic algorithms is common in secondary-school and first-year university syllabi. It links to neighbouring topics Genetic algorithms, Statistical process control, so understanding it makes those chapters shorter.
In everyday life
Look for Quality control and genetic algorithms outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.
Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “Quality control and genetic algorithms” →

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Quality control and genetic algorithms in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Quality control and genetic algorithms means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain Quality control and genetic algorithms out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Quality control and genetic algorithms in simple terms?

The combination of quality control and genetic algorithms led to novel solutions of complex quality control design and 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.

Why does Quality control and genetic algorithms matter?

Because it connects several biology ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Quality control and genetic algorithms?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Quality control and genetic algorithms.

Tags

  • Genetic algorithms
  • Statistical process control

Keep exploring