IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v335y2024i3d10.1007_s10479-022-05019-1.html
   My bibliography  Save this article

The daily swab test collection problem

Author

Listed:
  • Roberto Aringhieri

    (Università degli Studi di Torino)

  • Sara Bigharaz

    (NTNU)

  • Alessandro Druetto

    (Università degli Studi di Torino)

  • Davide Duma

    (Università degli Studi di Pavia)

  • Andrea Grosso

    (Università degli Studi di Torino)

  • Alberto Guastalla

    (Università degli Studi di Torino)

Abstract

Digital Contact Tracing (DCT) has been proved to be an effective tool to counteract the new SARS-CoV-2 or Covid-19. Despite this widespread effort to adopt the DCT, less attention has been paid to the organisation of the health logistics system that should support the tracing activities. Actually, the DCT poses a challenge to the logistics of the local health system in terms of number of daily tests to be collected and evaluated, especially when the spreading of the virus is soaring. In this paper we introduce a new optimisation problem called the Daily Swab Test Collection (DSTC) problem, that is the daily problem of collecting swab tests at home in such a way to guarantee a timely testing to people notified by the app to be in contact with a positive case. The problem is formulated as a variant of the team orienteering problem. The contributions of this paper are the following: (i) the new optimisation problem DSTC that complements and improves the DCT approach proposed by Ferretti et al. (Science https://doi.org/10.1126/science.abb6936 , 2020), (ii) the DSCT formulation as a variant of the TOP and a literature review highlighting that this variant can have useful application in healthcare management, (iii) new realistic benchmark instances for the DSTC based on the city of Turin, (iv) two new efficient and effective hybrid algorithms capable to deal with realistic instances, (v) the managerial insights of our approach with a special regard on the fairness of the solutions. The main finding is that it possible to optimise the underlying logistics system in such a way to guarantee a timely testing to people recognised by the DCT.

Suggested Citation

  • Roberto Aringhieri & Sara Bigharaz & Alessandro Druetto & Davide Duma & Andrea Grosso & Alberto Guastalla, 2024. "The daily swab test collection problem," Annals of Operations Research, Springer, vol. 335(3), pages 1449-1470, April.
    • Handle: RePEc:spr:annopr:v:335:y:2024:i:3:d:10.1007_s10479-022-05019-1
    DOI: 10.1007/s10479-022-05019-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-022-05019-1
    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/s10479-022-05019-1?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. Michel Gendreau & Alain Hertz & Gilbert Laporte, 1994. "A Tabu Search Heuristic for the Vehicle Routing Problem," Management Science, INFORMS, vol. 40(10), pages 1276-1290, October.
    2. Valenzuela, Christine L. & Jones, Antonia J., 1997. "Estimating the Held-Karp lower bound for the geometric TSP," European Journal of Operational Research, Elsevier, vol. 102(1), pages 157-175, October.
    3. William E. Hart & Carl D. Laird & Jean-Paul Watson & David L. Woodruff & Gabriel A. Hackebeil & Bethany L. Nicholson & John D. Siirola, 2017. "Pyomo — Optimization Modeling in Python," Springer Optimization and Its Applications, Springer, edition 2, number 978-3-319-58821-6, March.
    4. Stavropoulou, F. & Repoussis, P.P. & Tarantilis, C.D., 2019. "The Vehicle Routing Problem with Profits and consistency constraints," European Journal of Operational Research, Elsevier, vol. 274(1), pages 340-356.
    5. Vansteenwegen, Pieter & Souffriau, Wouter & Oudheusden, Dirk Van, 2011. "The orienteering problem: A survey," European Journal of Operational Research, Elsevier, vol. 209(1), pages 1-10, February.
    6. Chao, I-Ming & Golden, Bruce L. & Wasil, Edward A., 1996. "The team orienteering problem," European Journal of Operational Research, Elsevier, vol. 88(3), pages 464-474, February.
    7. Roberto Aringhieri & Sara Bigharaz & Davide Duma & Alberto Guastalla, 2022. "Fairness in ambulance routing for post disaster management," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 30(1), pages 189-211, March.
    8. Chao, I-Ming & Golden, Bruce L. & Wasil, Edward A., 1996. "A fast and effective heuristic for the orienteering problem," European Journal of Operational Research, Elsevier, vol. 88(3), pages 475-489, February.
    9. S. Lin & B. W. Kernighan, 1973. "An Effective Heuristic Algorithm for the Traveling-Salesman Problem," Operations Research, INFORMS, vol. 21(2), pages 498-516, April.
    10. Bernardetta Addis & Roberto Aringhieri & Andrea Grosso & Pierre Hosteins, 2016. "Hybrid constructive heuristics for the critical node problem," Annals of Operations Research, Springer, vol. 238(1), pages 637-649, March.
    11. Hanafi, Saïd & Mansini, Renata & Zanotti, Roberto, 2020. "The multi-visit team orienteering problem with precedence constraints," European Journal of Operational Research, Elsevier, vol. 282(2), pages 515-529.
    12. Gunawan, Aldy & Lau, Hoong Chuin & Vansteenwegen, Pieter, 2016. "Orienteering Problem: A survey of recent variants, solution approaches and applications," European Journal of Operational Research, Elsevier, vol. 255(2), pages 315-332.
    13. Bernardetta Addis & Roberto Aringhieri & Andrea Grosso & Pierre Hosteins, 2016. "Hybrid constructive heuristics for the critical node problem," Annals of Operations Research, Springer, vol. 238(1), pages 637-649, March.
    14. Chris Wymant & Luca Ferretti & Daphne Tsallis & Marcos Charalambides & Lucie Abeler-Dörner & David Bonsall & Robert Hinch & Michelle Kendall & Luke Milsom & Matthew Ayres & Chris Holmes & Mark Briers , 2021. "The epidemiological impact of the NHS COVID-19 app," Nature, Nature, vol. 594(7863), pages 408-412, June.
    Full references (including those not matched with items on IDEAS)

    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. Wu, Qinghua & He, Mu & Hao, Jin-Kao & Lu, Yongliang, 2024. "An effective hybrid evolutionary algorithm for the clustered orienteering problem," European Journal of Operational Research, Elsevier, vol. 313(2), pages 418-434.
    2. Roberto Aringhieri & Sara Bigharaz & Davide Duma & Alberto Guastalla, 2022. "Fairness in ambulance routing for post disaster management," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 30(1), pages 189-211, March.
    3. Balcik, Burcu, 2017. "Site selection and vehicle routing for post-disaster rapid needs assessment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 101(C), pages 30-58.
    4. Li, Jiaojiao & Zhu, Jianghan & Peng, Guansheng & Wang, Jianjiang & Zhen, Lu & Demeulemeester, Erik, 2024. "Branch-Price-and-Cut algorithms for the team orienteering problem with interval-varying profits," European Journal of Operational Research, Elsevier, vol. 319(3), pages 793-807.
    5. Jost, Christian & Jungwirth, Alexander & Kolisch, Rainer & Schiffels, Sebastian, 2022. "Consistent vehicle routing with pickup decisions - Insights from sport academy training transfers," European Journal of Operational Research, Elsevier, vol. 298(1), pages 337-350.
    6. Bian, Zheyong & Liu, Xiang, 2018. "A real-time adjustment strategy for the operational level stochastic orienteering problem: A simulation-aided optimization approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 115(C), pages 246-266.
    7. Ruiz-Meza, José & Montoya-Torres, Jairo R., 2022. "A systematic literature review for the tourist trip design problem: Extensions, solution techniques and future research lines," Operations Research Perspectives, Elsevier, vol. 9(C).
    8. Gulcin Dinc Yalcin & Hilal Malta & Seher Saylik, 2023. "A new mathematical model and a heuristic algorithm for the tourist trip design problem under new constraints: a real-world application," OPSEARCH, Springer;Operational Research Society of India, vol. 60(4), pages 1703-1730, December.
    9. Shiri, Davood & Akbari, Vahid & Hassanzadeh, Ali, 2024. "The Capacitated Team Orienteering Problem: An online optimization framework with predictions of unknown accuracy," Transportation Research Part B: Methodological, Elsevier, vol. 185(C).
    10. Zhao, Yanlu & Alfandari, Laurent, 2020. "Design of diversified package tours for the digital travel industry : A branch-cut-and-price approach," European Journal of Operational Research, Elsevier, vol. 285(3), pages 825-843.
    11. He, Mu & Wu, Qinghua & Benlic, Una & Lu, Yongliang & Chen, Yuning, 2024. "An effective multi-level memetic search with neighborhood reduction for the clustered team orienteering problem," European Journal of Operational Research, Elsevier, vol. 318(3), pages 778-801.
    12. Kim, Hyunjoon & Kim, Byung-In, 2022. "Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem," European Journal of Operational Research, Elsevier, vol. 303(2), pages 550-566.
    13. Majsa Ammouriova & Massimo Bertolini & Juliana Castaneda & Angel A. Juan & Mattia Neroni, 2022. "A Heuristic-Based Simulation for an Education Process to Learn about Optimization Applications in Logistics and Transportation," Mathematics, MDPI, vol. 10(5), pages 1-18, March.
    14. Dontas, Michael & Sideris, Georgios & Manousakis, Eleftherios G. & Zachariadis, Emmanouil E., 2023. "An adaptive memory matheuristic for the set orienteering problem," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1010-1023.
    15. Afsaneh Amiri & Majid Salari, 2019. "Time-constrained maximal covering routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(2), pages 415-468, June.
    16. Samita Kedkaew & Warisa Nakkiew & Parida Jewpanya & Wasawat Nakkiew, 2024. "A Novel Tourist Trip Design Problem with Stochastic Travel Times and Partial Charging for Battery Electric Vehicles," Mathematics, MDPI, vol. 12(18), pages 1-19, September.
    17. Sadan Kulturel-Konak & Bryan A. Norman & David W. Coit & Alice E. Smith, 2004. "Exploiting Tabu Search Memory in Constrained Problems," INFORMS Journal on Computing, INFORMS, vol. 16(3), pages 241-254, August.
    18. Kotiloglu, S. & Lappas, T. & Pelechrinis, K. & Repoussis, P.P., 2017. "Personalized multi-period tour recommendations," Tourism Management, Elsevier, vol. 62(C), pages 76-88.
    19. Gambardella, L.M. & Montemanni, R. & Weyland, D., 2012. "Coupling ant colony systems with strong local searches," European Journal of Operational Research, Elsevier, vol. 220(3), pages 831-843.
    20. Gunawan, Aldy & Lau, Hoong Chuin & Vansteenwegen, Pieter, 2016. "Orienteering Problem: A survey of recent variants, solution approaches and applications," European Journal of Operational Research, Elsevier, vol. 255(2), pages 315-332.

    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:annopr:v:335:y:2024:i:3:d:10.1007_s10479-022-05019-1. 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.