IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v21y2019i3d10.1007_s11009-017-9601-4.html
   My bibliography  Save this article

Sterrett Procedure for the Generalized Group Testing Problem

Author

Listed:
  • Yaakov Malinovsky

    (University of Maryland)

Abstract

Group testing is a useful method that has broad applications in medicine, engineering, and even in airport security control. Consider a finite population of N items, where item i has a probability pi to be defective. The goal is to identify all items by means of group testing. This is the generalized group testing problem. The optimum procedure, with respect to the expected total number of tests, is unknown even in case when all pi are equal. (Hwang 1975) proved that an ordered partition (with respect to pi) is the optimal for the Dorfman procedure (procedure D), and obtained an optimum solution (i.e., found an optimal partition) by dynamic programming. In this paper, we investigate the Sterrett procedure (procedure S). We provide close form expression for the expected total number of tests, which allows us to find the optimum arrangement of the items in the particular group. We also show that an ordered partition is not optimal for the procedure S or even for a slightly modified Dorfman procedure (procedure D′). This discovery implies that finding an optimal procedure S appears to be a hard computational problem. However, by using an optimal ordered partition for all procedures, we show that procedure D′ is uniformly better than procedure D, and based on numerical comparisons, procedure S is uniformly and significantly better than procedures D and D′.

Suggested Citation

  • Yaakov Malinovsky, 2019. "Sterrett Procedure for the Generalized Group Testing Problem," Methodology and Computing in Applied Probability, Springer, vol. 21(3), pages 829-840, September.
    • Handle: RePEc:spr:metcap:v:21:y:2019:i:3:d:10.1007_s11009-017-9601-4
    DOI: 10.1007/s11009-017-9601-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11009-017-9601-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11009-017-9601-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Shaul K. Bar-Lev & Onno Boxma & Wolfgang Stadje & Frank A. Duyn Schouten, 2010. "A Two-Stage Group Testing Model for Infections with Window Periods," Methodology and Computing in Applied Probability, Springer, vol. 12(3), pages 309-322, September.
    2. Bilder, Christopher R. & Tebbs, Joshua M. & Chen, Peng, 2010. "Informative Retesting," Journal of the American Statistical Association, American Statistical Association, vol. 105(491), pages 942-955.
    3. Lei Zhu & Jacqueline M. Hughes-Oliver & S. Stanley Young, 2001. "Statistical Decoding of Potent Pools Based on Chemical Structure," Biometrics, The International Biometric Society, vol. 57(3), pages 922-930, September.
    4. Chakravarty, Amiya K., 1982. "Inventory grouping for joint replenishment," Engineering Costs and Production Economics, Elsevier, vol. 7(1), pages 19-24, July.
    5. A. K. Chakravarty & J. B. Orlin & U. G. Rothblum, 1982. "Technical Note—A Partitioning Problem with Additive Objective with an Application to Optimal Inventory Groupings for Joint Replenishment," Operations Research, INFORMS, vol. 30(5), pages 1018-1022, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Daniel K. Sewell, 2022. "Leveraging network structure to improve pooled testing efficiency," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 71(5), pages 1648-1662, November.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Frank K. Hwang & Uriel G. Rothblum, 2011. "On the number of separable partitions," Journal of Combinatorial Optimization, Springer, vol. 21(4), pages 423-433, May.
    2. Huilan Chang & Frank K. Hwang & Uriel G. Rothblum, 2012. "A new approach to solve open-partition problems," Journal of Combinatorial Optimization, Springer, vol. 23(1), pages 61-78, January.
    3. Sheikh-Zadeh, Alireza & Rossetti, Manuel D. & Scott, Marc A., 2021. "Performance-based inventory classification methods for large-Scale multi-echelon replenishment systems," Omega, Elsevier, vol. 101(C).
    4. Siddhartha Syam & Bala Shetty, 1998. "Coordinated replenishments from multiple suppliers with price discounts," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(6), pages 579-598, September.
    5. Christopher R. Bilder & Joshua M. Tebbs & Christopher S. McMahan, 2019. "Informative group testing for multiplex assays," Biometrics, The International Biometric Society, vol. 75(1), pages 278-288, March.
    6. Daniel K. Sewell, 2022. "Leveraging network structure to improve pooled testing efficiency," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 71(5), pages 1648-1662, November.
    7. Hrayer Aprahamian & Douglas R. Bish & Ebru K. Bish, 2019. "Optimal Risk-Based Group Testing," Management Science, INFORMS, vol. 65(9), pages 4365-4384, September.
    8. Samuel D. Lendle & Michael G. Hudgens & Bahjat F. Qaqish, 2012. "Group Testing for Case Identification with Correlated Responses," Biometrics, The International Biometric Society, vol. 68(2), pages 532-540, June.
    9. Yaakov Malinovsky & Gregory Haber & Paul S. Albert, 2020. "An optimal design for hierarchical generalized group testing," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 69(3), pages 607-621, June.
    10. Ho, Sin C. & Szeto, W.Y. & Kuo, Yong-Hong & Leung, Janny M.Y. & Petering, Matthew & Tou, Terence W.H., 2018. "A survey of dial-a-ride problems: Literature review and recent developments," Transportation Research Part B: Methodological, Elsevier, vol. 111(C), pages 395-421.
    11. Christopher S. McMahan & Joshua M. Tebbs & Christopher R. Bilder, 2012. "Informative Dorfman Screening," Biometrics, The International Biometric Society, vol. 68(1), pages 287-296, March.
    12. Wildeman, R. E. & Dekker, R. & Smit, A. C. J. M., 1997. "A dynamic policy for grouping maintenance activities," European Journal of Operational Research, Elsevier, vol. 99(3), pages 530-551, June.
    13. Joshua M. Tebbs & Christopher S. McMahan & Christopher R. Bilder, 2013. "Two-Stage Hierarchical Group Testing for Multiple Infections with Application to the Infertility Prevention Project," Biometrics, The International Biometric Society, vol. 69(4), pages 1064-1073, December.
    14. Bar-Lev, Shaul K. & Boxma, Onno & Kleiner, Igor & Perry, David & Stadje, Wolfgang, 2017. "Recycled incomplete identification procedures for blood screening," European Journal of Operational Research, Elsevier, vol. 259(1), pages 330-343.
    15. Shaul K. Bar-Lev & Hans Blanc & Onno Boxma & Guido Janssen & David Perry, 2013. "Tandem Queues with Impatient Customers for Blood Screening Procedures," Methodology and Computing in Applied Probability, Springer, vol. 15(2), pages 423-451, June.
    16. Christopher S. McMahan & Joshua M. Tebbs & Christopher R. Bilder, 2012. "Two-Dimensional Informative Array Testing," Biometrics, The International Biometric Society, vol. 68(3), pages 793-804, September.
    17. Chung‐Lun Li & Zhi‐Long Chen, 2006. "Bin‐packing problem with concave costs of bin utilization," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(4), pages 298-308, June.
    18. Ogawa, Sanae & Ohta, Hiroshi, 1995. "Common order cycle system for multi-item inventory model with learning in ordering and transportation," International Journal of Production Economics, Elsevier, vol. 41(1-3), pages 321-325, October.
    19. Claeys, Dieter & Walraevens, Joris & Laevens, Koenraad & Bruneel, Herwig, 2010. "A queueing model for general group screening policies and dynamic item arrivals," European Journal of Operational Research, Elsevier, vol. 207(2), pages 827-835, December.
    20. Hrayer Aprahamian & Hadi El-Amine, 2022. "Optimal Screening of Populations with Heterogeneous Risk Profiles Under the Availability of Multiple Tests," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 150-164, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:metcap:v:21:y:2019:i:3:d:10.1007_s11009-017-9601-4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.