David Wolfinger

David Wolfinger

Auto-generated profile, based on publicly available information

David Wolfinger

University of Vienna

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications

1 March 2021 in European Journal of Operational Research
Verified
Journal Article
Open access
DWDavid Wolfinger
David Wolfinger
JSJuan-José Salazar-González
Juan-José Salazar-González

22 August 2018 in EURO Journal on Transportation and Logistics
Verified
Journal Article
Open access
PDF file
DWDavid Wolfinger
David Wolfinger
FTFabien Tricoire
Fabien Tricoire
KDKarl F. Doerner
Karl F. Doerner
We address a planning problem faced by logistics service providers who transport freight over long distances. Given a set of transportation requests, where the origin and the destination of each request are located far apart from each other, a logistics service provider must find feasible vehicle routes to fulfil those requests at minimum cost. When transporting freight over long distances, multimodal transportation provides a viable alternative to traditional unimodal road transportation. We introduce this new problem, which we call the multimodal long haul routing problem (MMLHRP), and present a mathematical formulation for it. Furthermore, we propose a matheuristic, using iterated local search within a column generation framework, for solving the MMLHRP. Results show that large cost savings can be achieved through multimodal transportation compared to unimodal road transportation.

21 October 2021 in European Journal of Operational Research
Verified
Journal Article
Open access
DWDavid Wolfinger
David Wolfinger
MGMargaretha Gansterer
Margaretha Gansterer
KDKarl F. Doerner
Karl F. Doerner
NPNikolas Popper
Nikolas Popper
In late 2019 a new coronavirus disease (COVID-19) emerged, causing a global pandemic within only a few weeks. A crucial factor in the public health response to pandemics is achieving a short turnaround time between a potential case becoming known, specimen collection and availability of a test result. In this article we address a logistics problem that arises in the context of testing potential cases. We assume that specimens can be collected in two ways: either by means of a mobile test-team or by means of a stationary test-team in a test-centre. After the specimens have been collected they must be delivered to a laboratory in order to be analysed. The problem we address aims at deciding how many test-centres to open and where, how many mobile test-teams to use, which suspected cases to assign to a test-centre and which to visit with a mobile test-team, which specimen to assign to which laboratory, and planning the routes of the mobile test-teams. The objective is to minimise the total cost of opening test-centres and routing mobile test-teams. We introduce this new problem, which we call the contagious disease testing problem (CDTP), and present a mixed-integer linear-programming formulation for it. We propose a large neighbourhood search metaheuristic for solving the CDTP and present an extensive computational study to illustrate its performance. Furthermore, we give managerial insights regarding COVID-19 test logistics, derived from problem instances based on real world data.

9 September 2025 in Logistics Research
Verified
Journal Article
Open access
DWDavid Wolfinger
David Wolfinger
MGMargaretha Gansterer
Margaretha Gansterer
KDKarl F. Doerner
Karl F. Doerner
Purpose: 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. Design/methodology/approach: 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. Findings: We solve and analyze real-world-based problem instances from which we draw insights regarding the solution quality produced by our approach. Originality/value: 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.