Jonas T. Witt
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Jonas T. Witt has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Marco E. Lübbecke
Chair of Operations Research, RWTH Aachen University, Aachen, Germany
5 shared publications Martin Bergner
RWTH Aachen University, Aachen, Germany
2 shared publicationsBaris Cem Sal
DHL Data & Analytics, Deutsche Post DHL Group, 53113 Bonn, Germany
1 shared publication- Bruce Reed
Laboratoire I3S CNRS
1 shared publication Severin Schmitt
DHL Data & Analytics, Deutsche Post DHL Group, 53113 Bonn, Germany
1 shared publicationThorsten Kranz
DHL Data & Analytics, Deutsche Post DHL Group, 53113 Bonn, Germany
1 shared publication
Latest Publications
- 1 September 2023
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Applied Analytics
- Vol. 53 (5) , 359-371
Human-Centric Parcel Delivery at Deutsche Post with Operations Research and Machine Learning
Features such as estimated delivery time windows and live tracking of shipments play a key role in improving the customer experience in last-mile delivery. The building blocks for enabling these features are reliable knowledge about the expected order of deliveries in a tour and precise delivery time window predictions. For Deutsche Post’s parcel delivery service in Germany, we developed a courier-centric routing algorithm and a corresponding state-of-the-art machine learning model for delivery time window predictions. The routing algorithm combines operations research with statistics and machine learning to implicitly gather and use the tacit knowledge of our experienced couriers within the tour generation. This is achieved by deducing and selecting appropriate precedence constraints from historical delivery data. This novel combination of optimization with data-driven constraints enabled us to provide custom routes to the individual couriers. It proved to be a main driver allowing us to provide accurate delivery time window predictions and live tracking of shipments. Our solution is used by Deutsche Post to plan the daily routes of couriers to the approximately 13,000 parcel delivery districts in Germany as well as to provide live tracking and estimated delivery time windows for 1.6 million parcels each day. History: This paper has been accepted for the INFORMS Journal on Applied Analytics Special Issue—2022 Daniel H. Wagner Prize for Excellence in the Practice of Advanced Analytics and Operations Research.
- 1 September 2023
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Applied Analytics
- Vol. 53 (5) , 359-371
Human-Centric Parcel Delivery at Deutsche Post with Operations Research and Machine Learning
Features such as estimated delivery time windows and live tracking of shipments play a key role in improving the customer experience in last-mile delivery. The building blocks for enabling these features are reliable knowledge about the expected order of deliveries in a tour and precise delivery time window predictions. For Deutsche Post’s parcel delivery service in Germany, we developed a courier-centric routing algorithm and a corresponding state-of-the-art machine learning model for delivery time window predictions. The routing algorithm combines operations research with statistics and machine learning to implicitly gather and use the tacit knowledge of our experienced couriers within the tour generation. This is achieved by deducing and selecting appropriate precedence constraints from historical delivery data. This novel combination of optimization with data-driven constraints enabled us to provide custom routes to the individual couriers. It proved to be a main driver allowing us to provide accurate delivery time window predictions and live tracking of shipments. Our solution is used by Deutsche Post to plan the daily routes of couriers to the approximately 13,000 parcel delivery districts in Germany as well as to provide live tracking and estimated delivery time windows for 1.6 million parcels each day. History: This paper has been accepted for the INFORMS Journal on Applied Analytics Special Issue—2022 Daniel H. Wagner Prize for Excellence in the Practice of Advanced Analytics and Operations Research.
- 1 November 2018
- Published by Elsevier in Discrete Optimization
- Vol. 30, 168-187
The strength of Dantzig–Wolfe reformulations for the stable set and related problems
- 1 November 2018
- Published by Elsevier in Discrete Optimization
- Vol. 30, 168-187
The strength of Dantzig–Wolfe reformulations for the stable set and related problems
- 7 June 2017
- Published by Springer Nature in Mathematical Programming
- Vol. 171 (1-2) , 519-522
Polyhedral results on the stable set problem in graphs containing even or odd pairs
- 7 June 2017
- Published by Springer Nature in Mathematical Programming
- Vol. 171 (1-2) , 519-522
Polyhedral results on the stable set problem in graphs containing even or odd pairs
- Open Access
- 29 January 2016
- Published by Association for Computing Machinery (ACM) in ACM Journal of Experimental Algorithmics
- Vol. 21, 1-16
A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs
The cut packing problem in an undirected graph is to find a largest cardinality collection of pairwise edge-disjoint cuts. We provide the first experimental study of this NP-hard problem that is interesting from a pure theorist’s viewpoint as well as from the standpoint of scientific applications (e.g., in bioinformatics and network reliability). So far it could not be solved exactly. We propose a branch-price-and-cut algorithm to optimally solve instances from various graph classes, random and from the literature, with up to several hundred vertices. In particular, we investigate how complexity results match computational experience and how combinatorial properties help improve the algorithm’s performance.
- 29 January 2016
- Published by Association for Computing Machinery (ACM) in ACM Journal of Experimental Algorithmics
- Vol. 21, 1-16
Open AccessA Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs
The cut packing problem in an undirected graph is to find a largest cardinality collection of pairwise edge-disjoint cuts. We provide the first experimental study of this NP-hard problem that is interesting from a pure theorist’s viewpoint as well as from the standpoint of scientific applications (e.g., in bioinformatics and network reliability). So far it could not be solved exactly. We propose a branch-price-and-cut algorithm to optimally solve instances from various graph classes, random and from the literature, with up to several hundred vertices. In particular, we investigate how complexity results match computational experience and how combinatorial properties help improve the algorithm’s performance.
- 20 June 2015
- Published by Springer Nature
- p. 110-121
Separation of Generic Cutting Planes in Branch-and-Price Using a Basis
- 20 June 2015
- Published by Springer Nature
- p. 110-121
Separation of Generic Cutting Planes in Branch-and-Price Using a Basis
- 1 January 2014
- Published by Springer Nature
- p. 34-45
A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs
- 1 January 2014
- Published by Springer Nature
- p. 34-45
A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs