{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T02:40:29Z","timestamp":1778899229323,"version":"3.51.4"},"reference-count":30,"publisher":"Emerald","issue":"1-2","license":[{"start":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T00:00:00Z","timestamp":1757289600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licences\/by\/4.0\/"}],"funder":[{"name":"Austrian Science Fund","award":["P-34151-N"],"award-info":[{"award-number":["P-34151-N"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,12,10]]},"abstract":"<jats:sec>\n                    <jats:title>Purpose<\/jats:title>\n                    <jats:p>In early 2020, the coronavirus disease 2019 (COVID-19) pandemic reached global proportions within only a few weeks. A key strategy to contain and control pandemics is to isolate infected people, which requires making test results available quickly, in order to be effective. The contagious disease testing problem (CDTP) arises precisely in this context of testing potential cases (of infection). In this paper, we address the stochastic and dynamic version of the CDTP, where only some suspected cases are known in advance, while others arrive randomly throughout the course of the day. For each newly arriving suspected case, it must be decided whether to accept or reject it. The specimens of accepted suspected cases must be collected on the same day; either by assigning the case to a time slot in a test-center or by visiting the patient with a mobile test-team. Rejected suspected cases must be serviced on the next day. The task in this problem is to decide how many mobile test-teams to use, how many test-centers to open and where, which suspected cases to visit with a mobile test-team and which to assign to a test-center, and designing the vehicle routes for the mobile test-teams. The objective is to identify a dynamic assignment-and-routing policy that minimizes the number of open test-centers and used vehicles, services all early-known suspected cases, and maximizes the expected number of serviced late-known suspected cases.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title>Design\/methodology\/approach<\/jats:title>\n                    <jats:p>We introduce this new problem, which we call the stochastic dynamic contagious disease testing problem (SDCDTP), and formulate it as a Markov decision process. We propose a solution method based on value function approximation for solving the SDCDTP, and illustrate its performance with an extensive computational study.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title>Findings<\/jats:title>\n                    <jats:p>We solve and analyze real-world-based problem instances from which we draw insights regarding the solution quality produced by our approach.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title>Originality\/value<\/jats:title>\n                    <jats:p>We find that a (significant) increase in the number of covered late-known suspected cases can be achieved by not minimizing the number of used vehicles and test-centers, albeit for the price of equally significant increases in the amount of used infrastructure.<\/jats:p>\n                  <\/jats:sec>","DOI":"10.1108\/lore-05-2025-0061","type":"journal-article","created":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:08:53Z","timestamp":1757311733000},"page":"135-160","source":"Crossref","is-referenced-by-count":2,"title":["Solving the stochastic dynamic contagious disease testing problem"],"prefix":"10.1108","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9003-9659","authenticated-orcid":true,"given":"David","family":"Wolfinger","sequence":"first","affiliation":[{"name":"University of Vienna , ,","place":["Vienna, Austria"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0039-4519","authenticated-orcid":true,"given":"Margaretha","family":"Gansterer","sequence":"additional","affiliation":[{"name":"University of Klagenfurt , ,","place":["Klagenfurt, Austria"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karl F.","family":"Doerner","sequence":"additional","affiliation":[{"name":"University of Vienna , ,","place":["Vienna, Austria"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","published-online":{"date-parts":[[2025,9,9]]},"reference":[{"key":"2025121003011801100_ref001","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.trb.2021.02.010","article-title":"The location-or-routing problem","volume":"147","author":"Arslan","year":"2021","journal-title":"Transportation Research Part B: Methodological"},{"issue":"6","key":"2025121003011801100_ref002","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1287\/opre.1040.0124","article-title":"Scenario-based planning for partially dynamic vehicle routing with stochastic customers","volume":"52","author":"Bent","year":"2004","journal-title":"Operations Research"},{"key":"2025121003011801100_ref003","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2025.103305","article-title":"Managing equitable contagious disease testing: a mathematical model for resource optimization","volume":"135","author":"Ghasemi","year":"2025","journal-title":"Omega"},{"issue":"1","key":"2025121003011801100_ref004","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.tre.2008.08.003","article-title":"Anticipatory algorithms for same-day courier dispatching","volume":"45","author":"Ghiani","year":"2009","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"3","key":"2025121003011801100_ref005","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1287\/trsc.1110.0374","article-title":"A comparison of anticipatory algorithms for the dynamic and stochastic traveling salesman problem","volume":"46","author":"Ghiani","year":"2012","journal-title":"Transportation Science"},{"key":"2025121003011801100_ref006","first-page":"8","article-title":"The multi-period location routing problem with locker boxes","volume":"15","author":"Grabenschweiger","year":"2022","journal-title":"Logistics Research"},{"key":"2025121003011801100_ref007","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.106041","article-title":"A location-or-routing problem with partial and decaying coverage","volume":"149","author":"Haghi","year":"2023","journal-title":"Computers and Operations Research"},{"issue":"4","key":"2025121003011801100_ref008","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1287\/trsc.1060.0166","article-title":"Solving a dynamic and stochastic vehicle routing problem with a sample scenario hedging heuristic","volume":"40","author":"Hvattum","year":"2006","journal-title":"Transportation Science"},{"issue":"4","key":"2025121003011801100_ref009","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1002\/net.20182","article-title":"A branch-and-regret heuristic for stochastic and dynamic vehicle routing problems","volume":"49","author":"Hvattum","year":"2007","journal-title":"Networks: An International Journal"},{"issue":"2","key":"2025121003011801100_ref010","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1287\/trsc.1050.0114","article-title":"Exploiting knowledge about future demands for real-time vehicle dispatching","volume":"40","author":"Ichoua","year":"2006","journal-title":"Transportation Science"},{"key":"2025121003011801100_ref011","first-page":"33","article-title":"A decision support tool for the location routing problem during the covid-19 outbreak in Colombia","author":"Mart\u00ednez-Reyes","year":"2020"},{"issue":"7","key":"2025121003011801100_ref012","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1016\/j.trb.2003.09.002","article-title":"Waiting strategies for the dynamic pickup and delivery problem with time windows","volume":"38","author":"Mitrovi\u0107-Mini\u0107","year":"2004","journal-title":"Transportation Research Part B: Methodological"},{"key":"2025121003011801100_ref013","doi-asserted-by":"crossref","DOI":"10.1002\/9781118029176","volume-title":"Approximate Dynamic Programming: Solving the Curses of Dimensionality","author":"Powell","year":"2011","edition":"2nd ed."},{"issue":"3","key":"2025121003011801100_ref014","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1016\/j.ejor.2018.07.014","article-title":"A unified framework for stochastic optimization","volume":"275","author":"Powell","year":"2019","journal-title":"European Journal of Operational Research"},{"key":"2025121003011801100_ref015","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2020.102341","article-title":"Optimising the assignment of swabs and reagent for pcr testing during a viral epidemic","volume":"102","author":"Santini","year":"2021","journal-title":"Omega"},{"issue":"1-2","key":"2025121003011801100_ref016","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s10479-017-2509-0","article-title":"A survey of the standard location-routing problem","volume":"259","author":"Schneider","year":"2017","journal-title":"Annals of Operations Research"},{"issue":"10","key":"2025121003011801100_ref017","doi-asserted-by":"publisher","first-page":"2920","DOI":"10.1016\/j.ifacol.2022.10.175","article-title":"A vehicle routing problem with time windows and workload balancing for covid-19 testers: a case study","volume":"55","author":"Shahnejat-Bushehri","year":"2022","journal-title":"IFAC-PapersOnLine"},{"issue":"3","key":"2025121003011801100_ref018","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s12599-019-00582-7","article-title":"Adaptive state space partitioning for dynamic decision processes","volume":"61","author":"Soeffker","year":"2019","journal-title":"Business and Information Systems Engineering"},{"issue":"4","key":"2025121003011801100_ref019","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1016\/0305-0483(93)90082-v","article-title":"Alternate solution procedures for the location-routing problem","volume":"21","author":"Srivastava","year":"1993","journal-title":"Omega"},{"issue":"3","key":"2025121003011801100_ref020","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1287\/trsc.1060.0183","article-title":"Waiting strategies for anticipating service requests from known customer locations","volume":"41","author":"Thomas","year":"2007","journal-title":"Transportation Science"},{"issue":"1","key":"2025121003011801100_ref021","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s10100-018-0588-x","article-title":"Horizontal combinations of online and offline approximate dynamic programming for stochastic dynamic vehicle routing","volume":"28","author":"Ulmer","year":"2020","journal-title":"Central European Journal of Operations Research"},{"key":"2025121003011801100_ref022","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/978-3-319-13177-1_25","volume-title":"Logistics Management","author":"Ulmer","year":"2015"},{"issue":"1","key":"2025121003011801100_ref023","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1287\/trsc.2017.0767","article-title":"Offline\u2013online approximate dynamic programming for dynamic vehicle routing with stochastic requests","volume":"53","author":"Ulmer","year":"2019","journal-title":"Transportation Science"},{"issue":"2","key":"2025121003011801100_ref024","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejtl.2020.100008","article-title":"On modeling stochastic dynamic vehicle routing problems","volume":"9","author":"Ulmer","year":"2020","journal-title":"EURO Journal on Transportation and Logistics"},{"issue":"1","key":"2025121003011801100_ref025","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1287\/trsc.2016.0719","article-title":"Budgeting time for dynamic vehicle routing with stochastic customer requests","volume":"52","author":"Ulmer","year":"2018","journal-title":"Transportation Science"},{"issue":"3","key":"2025121003011801100_ref026","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1016\/j.ejor.2018.02.038","article-title":"Value function approximation for dynamic multi-period vehicle routing","volume":"269","author":"Ulmer","year":"2018","journal-title":"European Journal of Operational Research"},{"key":"2025121003011801100_ref027","volume-title":"Managing Epidemics: Key Facts about Major Deadly Diseases","author":"WHO","year":"2018"},{"key":"2025121003011801100_ref028","doi-asserted-by":"publisher","DOI":"10.17632\/gryttgptsg.1","article-title":"sdcdtp","author":"Wolfinger","year":"2023"},{"issue":"1","key":"2025121003011801100_ref029","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.ejor.2021.10.028","article-title":"A large neighbourhood search metaheuristic for the contagious disease testing problem","volume":"304","author":"Wolfinger","year":"2023","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"2025121003011801100_ref030","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1016\/j.ejor.2022.07.015","article-title":"Solving large-scale dynamic vehicle routing problems with stochastic requests","volume":"306","author":"Zhang","year":"2023","journal-title":"European Journal of Operational Research"}],"container-title":["Logistics Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/lore\/article-pdf\/18\/1-2\/135\/10202394\/lore-05-2025-0061en.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/www.emerald.com\/lore\/article-pdf\/18\/1-2\/135\/10202394\/lore-05-2025-0061en.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T08:01:24Z","timestamp":1765353684000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.emerald.com\/lore\/article\/18\/1-2\/135\/1278876\/Solving-the-stochastic-dynamic-contagious-disease"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,9]]},"references-count":30,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2025,12,10]]}},"URL":"https:\/\/doi.org\/10.1108\/lore-05-2025-0061","relation":{},"ISSN":["1865-035X","1865-0368"],"issn-type":[{"value":"1865-035X","type":"print"},{"value":"1865-0368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,9]]}}}