Smart routes: a system for development and comparison of algorithms for solving vehicle routing problems with realistic constraints
Not on the map. Why?
Abstract (arXiv)
The problem of route optimization with realistic constraints is becoming extremely relevant in the face of global urban population growth. While we are aware of approaches that theoretically provide an exact optimal solution, their application becomes challenging as the problem size increases because of exponential complexity. We investigate the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) and compare solutions obtaining by exact solver SCIP with heuristic algorithms such as LKH, 2-OPT, 3-OPT, the ORTools framework, and the deep learning model JAMPR. We demonstrate that for problem of size 50 deep learning and classical heuristic solutions became close to SCIP exact solution but requires less time. Additionally for problems with size 100, SCIP exact methods around 13 times slower that neural and classical heuristics with the same route cost and on around 50% worse for the first feasible solution on the same time. To conduct experiments, we developed the Smart Routes platform for solving route optimization problems, which includes exact, heuristic, and deep learning models, and facilitates convenient integration of custom algorithms and datasets.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 8 of its 31 references that are in the map. First posted on arXiv 14 Aug 2026.
Builds on
8 of 31 references.
References · 8
- 2017Attention Is All You Needcited by 60,361
- 2015Pointer Networkscited by 895
- 2018Attention, Learn to Solve Routing Problems!cited by 656
- 2018Reinforcement Learning for Solving the Vehicle Routing Problemcited by 333
- 2018Learning to Perform Local Rewriting for Combinatorial Optimizationcited by 185
- 2021Learning to Delegate for Large-scale Vehicle Routingcited by 109
- 2020Learning to Solve Vehicle Routing Problems with Time Windows through Joint Attentioncited by 29
- 2021A Branch-and-Cut Algorithm for Mixed Integer Bilevel Linear Optimization Problems and Its Implementationcited by 6
Built on by
Not cited yet.