
Decompose-route-improve framework for solving large-scale vehicle routing problems with time windows
Speaker:
Prof. Stefan Minner
School of Management, Technical University of Munich (TUM)
Date: Mar 18, 2026 (Wednesday)
Time: 10:00 am – 12:00 nn
Venue: The Tam Wing Fan Innovation Wing Two, The University of Hong Kong
Abstract
Several metaheuristics use decomposition and pruning strategies to solve large-scale instances of the vehicle routing problem (VRP). Those complexity reduction techniques often rely on simple, problem-specific rules. However, the growth in available data and advances in computer hardware enable data-based approaches that use machine learning to improve scalability of solution algorithms. We propose a decompose-route-improve (DRI) framework, which first partitions the customers of the VRP with time windows (VRPTW) using clustering. Its dissimilarity metric incorporates customers’ spatial, temporal, and demand data and is formulated to reflect the problem’s objective function and constraints. Second, the resulting sub-routing problems are solved independently using any suitable algorithm. Lastly, we apply pruned local search (LS) between solved subproblems to improve the overall solution. Pruning is based on customers’ similarity information obtained in the decomposition phase. In a computational study, we parameterize and compare existing clustering algorithms and benchmark the DRI against a state-of-the-art solver on large VRPTW instances and very large-scale instances with up to 30,000 customers, which are introduced in this study. Results show that our data-based approach outperforms classic and recent cluster-first, route-second approaches as well as decomposition strategies that are solely based on customers’ spatial information. The newly introduced dissimilarity metric forms separate sub-VRPTWs and improves the selection of LS moves in the improvement phase. Thus, the DRI scales existing metaheuristics to achieve high-quality solutions faster for very large-scale VRPTWs by efficiently reducing complexity. Further, the DRI can be adapted to various solution methods and problem characteristics, such as the distribution of customer locations and demands, the depot location, and different time window scenarios, making it a generalizable approach to solving large- and very large-scale practical routing problems.
Following the research presentation, Professor Minner will also share his insights and experiences regarding research publications, drawing from his role as Editor-in-Chief of the International Journal of Production Economics.

About the speaker
Stefan Minner is a Full Professor for Logistics and Supply Chain Management at the School of Management, Technical University of Munich (TUM) and a core-member of the Munich Data Science Institute (MDSI). Currently, he is Vice Dean of Research and Innovation at TUM School of Management. His research interests using methods of operations research, artificial intelligence and machine learning are in global supply chain design, transportation optimization and inventory management. His work was published in many peer reviewed journals, including Management Science, Manufacturing & Service Operations Management, Operations Research, Production and Operations Management, Transportation Science, Transportation Research Parts B, C and E, European Journal of Operational Research, and the International Journal of Production Research. For his research output, he is currently listed among the top 1% business professors in German speaking countries by Wirtschaftswoche and among the top 2% researchers worldwide in a citation-based ranking by Stanford University. He serves on several editorial boards of logistics and operations research journals. Currently, Stefan Minner is the Editor-in-Chief of the International Journal of Production Economics. Stefan Minner is a fellow of the International Society for Inventory Research (ISIR) and the International Foundation of Production Research (IFPR). He received the PhD supervisory award at TUM School of Management in 2024 and the Science Award for his lifetime achievements by the German Operations Research Society in 2025.









