Optimization of a Moving Averages Program Using a Simulated Annealing Algorithm: The Goal is to Monitor the Process
David Ng1, Frank A Polito1, Mark A Cervinski2
1Department of Pathology and Laboratory Medicine, Dartmouth-Hitchcock Medical Center, Lebanon, NH;
Background:
The patient moving average (MA) is a QC strategy using the mean patient result to continuously monitor assay performance. Developing sensitive MA protocols that rapidly detect systematic error (SE) is challenging. We compare MA protocols established using a previously published report as a guide and demonstrate the use of a simulated annealing (SA) algorithm to optimize MA protocol performance.
Methods:
Using 400 days of patient data, we developed MA protocols for 23 assays. MA protocols developed using a previously published report and our SA algorithm were compared using the average number of patient samples affected until error detection (ANPed).
Results:
Comparison of the strategies demonstrated that protocols developed using the SA algorithm generally proved superior. Some analytes such as total protein showed considerable improvement, with positive SE equal to 0.8 g/dL detected with an ANPed of 135 samples using the previously published method whereas the SA algorithm detected this SE with an ANPed of 18. Not all analytes demonstrated similar improvement with the SA algorithm. Phosphorus, for instance, demonstrated only minor improvements, with a positive SE of 0.9 mg/dL detected with an ANPed of 34 using the previously published method vs an ANPed of 29 using the SA algorithm. We also demonstrate an example of SE detection in a live environment using the SA algorithm derived MA protocols.
Conclusions:
The SA algorithm-developed MA protocols are currently in use in our laboratory and they rapidly detect SE, reducing the number of samples requiring correction and improving patient safety.
More Related Videos
Related Concept Videos
Optimization Problems
Maxwell-Boltzmann Distribution: Problem Solving
This distribution function f(v) is defined by saying that the expected number N (v1,v2) of particles with speeds between v1 and v2 is given by
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Average Value of a Function
Weighted Mean
For example, consider the number of goals scored in the matches of a tournament. While computing the average number of goals scored in the tournament, it may be more important to...
Trial and Error and Algorithm


