Marie Schmidt

Marie Schmidt

Auto-generated profile, based on publicly available information

Marie Schmidt

Department for Computer Science University of Würzburg Am Hubland 97074 Würzburg Germany

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
1 August 2018 in Transportation Science
Verified
Journal Article
Closed access
NANiels Agatz
Niels Agatz
PBPaul Bouman
Paul Bouman
MSMarie Schmidt
Marie Schmidt
The fast and cost-efficient home delivery of goods ordered online is logistically challenging. Many companies are looking for new ways to cross the last mile to their customers. One technology-enabled opportunity that recently has received much attention is the use of drones to support deliveries. An innovative last-mile delivery concept in which a truck collaborates with a drone to make deliveries gives rise to a new variant of the traveling salesman problem (TSP) that we call the TSP with drone. In this paper, we model this problem as an integer program and develop several fast route-first, cluster-second heuristics based on local search and dynamic programming. We prove worst-case approximation ratios for the heuristics and test their performance by comparing the solutions to the optimal solutions for small instances. In addition, we apply our heuristics to several artificial instances with different characteristics and sizes. Our experiments show that substantial savings are possible with this concept compared to truck-only delivery. The online appendix is available at https://doi.org/10.1287/trsc.2017.0791 .

25 October 2018 in Networks
Verified
Journal Article
Open access
PDF file
PBPaul Bouman
Paul Bouman
NANiels Agatz
Niels Agatz
MSMarie Schmidt
Marie Schmidt
A promising new delivery model involves the use of a delivery truck that collaborates with a drone to make deliveries. Effectively combining a truck and a drone gives rise to a new planning problem that is known as the traveling salesman problem with drone (TSP‐D). This paper presents exact solution approaches for the TSP‐D based on dynamic programming and provides an experimental comparison of these approaches. Our numerical experiments show that our approach can solve larger problems than the mathematical programming approaches that have been presented in the literature thus far. Moreover, we show that restrictions on the number of locations the truck can visit while the drone is away can help significantly reduce the solution times while having relatively little impact on the overall solution quality.

1 November 2016 in Transportation Research Part B: Methodological
Verified
Journal Article
Closed access
YGYuan Gao
Yuan Gao
LKLeo Kroon
Leo Kroon
MSMarie Schmidt
Marie Schmidt
LYLixing Yang
Lixing Yang

1 June 2017 in European Journal of Operational Research
Verified
Journal Article
Closed access
MGMarc Goerigk
Marc Goerigk
MSMarie Schmidt
Marie Schmidt

1 June 2019 in European Journal of Operational Research
Verified
Journal Article
Open access
MSM. Schmidt
M. Schmidt
ASAnita Schöbel
Anita Schöbel
LTLisa Thom
Lisa Thom

1 June 2018 in European Journal of Operational Research
Verified
Journal Article
Open access
ARAndrea Raith
Andrea Raith
MSMarie Schmidt
Marie Schmidt
ASAnita Schöbel
Anita Schöbel
LTLisa Thom
Lisa Thom